Add to ORKGAbstract. Hoare logic and proof-carrying code are two independent frameworks for reasoning that programs meet their specifications. In this paper, we merge the two approaches by embedding axiomatic specifications in a type system for foundational proof-carrying code. By annotating programs with proof hints, proof checking of Hoare triples becomes decidable and as efficient as type checking.
Starting from Hoare correctness formulae {P} S {Q} which define first-order predicates S by their pr...
We explore conservative refinements of specifications. These form a quite appropriate framework for...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
Abstract. Hoare logic and proof-carrying code are two independent frameworks for reasoning that prog...
Formal reasoning about computer programs can be based directly on the semantics of the programming l...
In this paper, we combine a Hoare logic with a typed ¿-calculus to create a reliable tool for derivi...
Abstract. Matching logic has been recently proposed as an alternative program verification approach....
This paper presents a new theoretical result concerning Hoare Logic. It is shown here that the verif...
Enabling Hoare-style reasoning for low-level code is attractive since it opens the way to regain str...
AbstractWe explore conservative refinements of specifications. These form a quite appropriate framew...
International audienceWe present a Hoare logic for a call-by-value programming language equipped wit...
AbstractWe consider the completeness of Hoare's logic with a first-order assertion language applied ...
In systems verification we are often concerned with multiple, inter-dependent properties that a pro-...
Abstract We introduce a generic framework for proof carrying code, developed and mechanically verifi...
We show that propositional Hoare logic is subsumed by the type calculus of typed Kleene algebra augm...
Starting from Hoare correctness formulae {P} S {Q} which define first-order predicates S by their pr...
We explore conservative refinements of specifications. These form a quite appropriate framework for...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
Abstract. Hoare logic and proof-carrying code are two independent frameworks for reasoning that prog...
Formal reasoning about computer programs can be based directly on the semantics of the programming l...
In this paper, we combine a Hoare logic with a typed ¿-calculus to create a reliable tool for derivi...
Abstract. Matching logic has been recently proposed as an alternative program verification approach....
This paper presents a new theoretical result concerning Hoare Logic. It is shown here that the verif...
Enabling Hoare-style reasoning for low-level code is attractive since it opens the way to regain str...
AbstractWe explore conservative refinements of specifications. These form a quite appropriate framew...
International audienceWe present a Hoare logic for a call-by-value programming language equipped wit...
AbstractWe consider the completeness of Hoare's logic with a first-order assertion language applied ...
In systems verification we are often concerned with multiple, inter-dependent properties that a pro-...
Abstract We introduce a generic framework for proof carrying code, developed and mechanically verifi...
We show that propositional Hoare logic is subsumed by the type calculus of typed Kleene algebra augm...
Starting from Hoare correctness formulae {P} S {Q} which define first-order predicates S by their pr...
We explore conservative refinements of specifications. These form a quite appropriate framework for...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...