Abstract. We study a propositional variant of Hoare logic that can be used for reasoning about programs that exhibit both angelic and demonic nondeterminism. We work in an uninterpreted setting, where the mean-ing of the atomic actions is specified axiomatically using hypotheses of a certain form. Our logical formalism is entirely compositional and it sub-sumes the non-compositional formalism of safety games on finite graphs. We present sound and complete Hoare-style (partial-correctness) calculi that are useful for establishing Hoare assertions, as well as for synthesiz-ing implementations. The computational complexity of the Hoare theory of dual nondeterminism is investigated using operational models, and it is shown that the theory is co...
AbstractA logical framework is presented for representing and reasoning about nondeterministic progr...
AbstractThe weakest-precondition interpretation of recursive procedures is developed for a language ...
Classical Hoare triples are modified to specify and design distributed real-time systems. The assert...
Generalized Hoare Logic is a formal logical system for deriving invariance properties of programs. ...
Abstract. We present a novel Hoare-style logic, called Reverse Hoare Logic, which can be used to rea...
AbstractA survey of various results concerning the use of Hoare's logic in proving correctness of no...
The equational theory of deterministic monadic recursion schemes is known to be decidable by the res...
Hoare logics are proof systems that allow one to formally establish properties of computer programs....
Hoare and He have proposed unifying theories of programming (UTP): a model of alphabetised relations...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
Nondeterministic strategies are strategies (or protocols, or plans) that, given a history in a game,...
The weakest-precondition interpretation of recursive procedures is developed for a language with a c...
Hoare and He’s unifying theories of programming (UTP) is a model of alphabetised relations expressed...
AbstractThis paper introduces a compositional Hoare logic for reasoning about the partial correctnes...
AbstractWe propose a new and uniform abstract relational approach to demonic nondeterminism and robu...
AbstractA logical framework is presented for representing and reasoning about nondeterministic progr...
AbstractThe weakest-precondition interpretation of recursive procedures is developed for a language ...
Classical Hoare triples are modified to specify and design distributed real-time systems. The assert...
Generalized Hoare Logic is a formal logical system for deriving invariance properties of programs. ...
Abstract. We present a novel Hoare-style logic, called Reverse Hoare Logic, which can be used to rea...
AbstractA survey of various results concerning the use of Hoare's logic in proving correctness of no...
The equational theory of deterministic monadic recursion schemes is known to be decidable by the res...
Hoare logics are proof systems that allow one to formally establish properties of computer programs....
Hoare and He have proposed unifying theories of programming (UTP): a model of alphabetised relations...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
Nondeterministic strategies are strategies (or protocols, or plans) that, given a history in a game,...
The weakest-precondition interpretation of recursive procedures is developed for a language with a c...
Hoare and He’s unifying theories of programming (UTP) is a model of alphabetised relations expressed...
AbstractThis paper introduces a compositional Hoare logic for reasoning about the partial correctnes...
AbstractWe propose a new and uniform abstract relational approach to demonic nondeterminism and robu...
AbstractA logical framework is presented for representing and reasoning about nondeterministic progr...
AbstractThe weakest-precondition interpretation of recursive procedures is developed for a language ...
Classical Hoare triples are modified to specify and design distributed real-time systems. The assert...