Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...
We present patterns for expressing dependability requirements, such as confidentiality, integrity, availability, and reliability. The paper considers random faults as well as cert...
Abstract— In this paper we introduce an analysis of dependability of an elementary yet critical component of robotic systems designed to operate in environments shared with human...
Roberto Filippini, Soumen Sen, Giovanni Tonietti, ...
This paper presents a new approach to integrated security and dependability evaluation, which is based on stochastic modeling techniques. Our proposal aims to provide operational m...
Karin Sallhammar, Bjarne E. Helvik, Svein J. Knaps...
The logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code...