Add to ORKGWe show that propositional Hoare logic is subsumed by the type calculus of typed Kleene algebra augmented with subtypes and typecasting. Assertions are interpreted as typecast operators. Thus Hoare-style reasoning with partial correct-ness assertions reduces to typechecking in this system
AbstractWe consider the completeness of Hoare's logic with a first-order assertion language applied ...
In this paper, we combine a Hoare logic with a typed ¿-calculus to create a reliable tool for derivi...
Proofs of correctness of imperative programs are traditionally done in first order frameworks derive...
We show that propositional Hoare logic is subsumed by the type calculus of typed Kleene algebra augm...
We show that Kleene algebra with tests subsumes propositional Hoare logic. Thus the specialized syn...
Abstract. Hoare logic and proof-carrying code are two independent frameworks for reasoning that prog...
Abstract. Hoare logic and proof-carrying code are two independent frameworks for reasoning that prog...
Abstract. Hoare Type Theory (HTT) combines a dependently typed, higher-order language with monadical...
Kleene algebra (KA) is the algebra of regular events. Familiar examples of Kleene algebras include...
Hoare Type Theory (HTT) combines a dependently typed, higher-order language with monadically-encapsu...
We enrich Kleene algebra by domain and codomain operators. These abstractions of relational notions ...
We enrich Kleene algebra by domain and codomain operators. These abstractions of relational notions ...
We consider the completeness of Hoare’s logic with a first-order assertion language applied to whil...
We present a denotational model of impredicative Hoare Type Theory, a very expressive dependent type...
Modal Kleene algebra is Kleene algebra enriched by forward and backward box and diamond operators. W...
AbstractWe consider the completeness of Hoare's logic with a first-order assertion language applied ...
In this paper, we combine a Hoare logic with a typed ¿-calculus to create a reliable tool for derivi...
Proofs of correctness of imperative programs are traditionally done in first order frameworks derive...
We show that propositional Hoare logic is subsumed by the type calculus of typed Kleene algebra augm...
We show that Kleene algebra with tests subsumes propositional Hoare logic. Thus the specialized syn...
Abstract. Hoare logic and proof-carrying code are two independent frameworks for reasoning that prog...
Abstract. Hoare logic and proof-carrying code are two independent frameworks for reasoning that prog...
Abstract. Hoare Type Theory (HTT) combines a dependently typed, higher-order language with monadical...
Kleene algebra (KA) is the algebra of regular events. Familiar examples of Kleene algebras include...
Hoare Type Theory (HTT) combines a dependently typed, higher-order language with monadically-encapsu...
We enrich Kleene algebra by domain and codomain operators. These abstractions of relational notions ...
We enrich Kleene algebra by domain and codomain operators. These abstractions of relational notions ...
We consider the completeness of Hoare’s logic with a first-order assertion language applied to whil...
We present a denotational model of impredicative Hoare Type Theory, a very expressive dependent type...
Modal Kleene algebra is Kleene algebra enriched by forward and backward box and diamond operators. W...
AbstractWe consider the completeness of Hoare's logic with a first-order assertion language applied ...
In this paper, we combine a Hoare logic with a typed ¿-calculus to create a reliable tool for derivi...
Proofs of correctness of imperative programs are traditionally done in first order frameworks derive...