International audienceA logical framework is presented for defining semantics of programs that satisfy Hoare postulates. The two families of logical systems are given: modal systems and relational systems. In the modal systems semantics of Hoare-style programming languages is provided in terms of relations and sets, and in relational systems in terms of relations only. Proof theory for the given logics is presented
Matching logic has been recently proposed as an alternative program verification approach. Unlike ...
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...
Generalized Hoare Logic is a formal logical system for deriving invariance properties of programs. ...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
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...
This paper contains a model and a proof of soundness for a range of program logics based on separati...
Relational Hoare logics extend the applicability of modular, deductive verification to encompass imp...
We show how some classical static analyses for imperative programs, and the optimizing transformatio...
Abstract. We investigate the completeness of Hoare Logic on the propositional level. In particular, ...
Abstract – This paper presents a new approach to formalizing the general rules of the Hoare logic. O...
International audienceWe present a Hoare logic for a call-by-value programming language equipped wit...
This report presents a sound and complete Hoare logic for a sequential object-oriented language with...
This survey discusses the interplay among unquantified re- lational logics, propositional modal logi...
Matching logic has been recently proposed as an alternative program verification approach. Unlike ...
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...
Generalized Hoare Logic is a formal logical system for deriving invariance properties of programs. ...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
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...
This paper contains a model and a proof of soundness for a range of program logics based on separati...
Relational Hoare logics extend the applicability of modular, deductive verification to encompass imp...
We show how some classical static analyses for imperative programs, and the optimizing transformatio...
Abstract. We investigate the completeness of Hoare Logic on the propositional level. In particular, ...
Abstract – This paper presents a new approach to formalizing the general rules of the Hoare logic. O...
International audienceWe present a Hoare logic for a call-by-value programming language equipped wit...
This report presents a sound and complete Hoare logic for a sequential object-oriented language with...
This survey discusses the interplay among unquantified re- lational logics, propositional modal logi...
Matching logic has been recently proposed as an alternative program verification approach. Unlike ...
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...
DOI
Add to ORKG