Abstract. 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 specifica-tions in a type system for foundational proof-carrying code. By annotat-ing programs with proof hints, proof checking of Hoare triples becomes decidable and as efficient as type checking.
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 explore conservative refinements of specifications. These form a quite appropriate framework for...
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....
AbstractWe consider the completeness of Hoare's logic with a first-order assertion language applied ...
This paper presents a new theoretical result concerning Hoare Logic. It is shown here that the verif...
International audienceWe present a Hoare logic for a call-by-value programming language equipped wit...
Enabling Hoare-style reasoning for low-level code is attractive since it opens the way to regain str...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
We show that propositional Hoare logic is subsumed by the type calculus of typed Kleene algebra augm...
We consider the completeness of Hoare’s logic with a first-order assertion language applied to whil...
AbstractWe explore conservative refinements of specifications. These form a quite appropriate framew...
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 explore conservative refinements of specifications. These form a quite appropriate framework for...
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....
AbstractWe consider the completeness of Hoare's logic with a first-order assertion language applied ...
This paper presents a new theoretical result concerning Hoare Logic. It is shown here that the verif...
International audienceWe present a Hoare logic for a call-by-value programming language equipped wit...
Enabling Hoare-style reasoning for low-level code is attractive since it opens the way to regain str...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
We show that propositional Hoare logic is subsumed by the type calculus of typed Kleene algebra augm...
We consider the completeness of Hoare’s logic with a first-order assertion language applied to whil...
AbstractWe explore conservative refinements of specifications. These form a quite appropriate framew...
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 explore conservative refinements of specifications. These form a quite appropriate framework for...