This paper examines the suitability and use of runtime verification as means for monitoring security protocols and their properties. In particular, we employ the runtime verificat...
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
When a program P fails to satisfy a requirement R supposedly ensured by a detailed speci cation S that was used to implement P, there is a question about whether the problem arise...
Karthikeyan Bhargavan, Carl A. Gunter, Davor Obrad...
Model-checking of asynchronous distributed protocols is challenging because of the large size of the state and solution spaces. This paper tackles this problem in the context of l...
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...