We identify a class of timed automata, which we call counter-free input-determined automata, which characterize the class of timed languages definable by several timed temporal l...
This paper presents a formal framework for compositional reasoning about secure systems. A key insight is to view a trusted system in terms of the interfaces that the various comp...
Deepak Garg, Jason Franklin, Dilsun Kirli Kaynar, ...
We specify the black box behavior of dataflow components by characterizing the relation between their input and their output histories. We distinguish between three main classes of...
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...
Sandip Ray, Warren A. Hunt Jr., John Matthews, J. ...
This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features...