Hoare logic ([7]) is an important tool for formally proving correctness properties of programs. It takes advantage of modularity by treating program fragments in terms of provable specifications. However, heap programs tend to break this type of modular reasoning by permitting pointer aliasing. For instance, the specification that a program reverses one list does not imply that it leaves a second list alone. To achieve this disjointness property, it is necessary to establish disjointness conditions throughout the proof. © 2011 Springer-Verlag
First order logic with transitive closure, and separation logic enable elegant interactive verificat...
Various methods for formal program verification have been around for a long time. Hoare logic is on...
We introduce a new way of reasoning about invariance in terms of footprints in a program logic for o...
We describe an extension of Hoare’s logic for reasoning about programs that alter data structures. W...
Separation logic is an extension of Hoare logic which permits reasoning about low-level imperative p...
Enabling Hoare-style reasoning for low-level code is attractive since it opens the way to regain str...
Hoare logics are proof systems that allow one to formally establish properties of computer programs....
Separation Logic brought an advance to program verification of data structures through its use of (r...
We study problems that comes up when Hoare logic is used to prove programs written in object oriente...
AbstractBuilding on the work of Burstall, this paper develops sound modelling and reasoning methods ...
International audiencePioneering work has been done by Jonkers \cite{jonkers} to define a semantics ...
Investigating soundness and completeness of verification calculi for imperative programming language...
We present a formal system for proving the partial correctness of a single-pass instruction sequence...
Formal reasoning about computer programs can be based directly on the semantics of the programming l...
Program correctness techniques aim to prove the absence of bugs, but can yield false alarms because ...
First order logic with transitive closure, and separation logic enable elegant interactive verificat...
Various methods for formal program verification have been around for a long time. Hoare logic is on...
We introduce a new way of reasoning about invariance in terms of footprints in a program logic for o...
We describe an extension of Hoare’s logic for reasoning about programs that alter data structures. W...
Separation logic is an extension of Hoare logic which permits reasoning about low-level imperative p...
Enabling Hoare-style reasoning for low-level code is attractive since it opens the way to regain str...
Hoare logics are proof systems that allow one to formally establish properties of computer programs....
Separation Logic brought an advance to program verification of data structures through its use of (r...
We study problems that comes up when Hoare logic is used to prove programs written in object oriente...
AbstractBuilding on the work of Burstall, this paper develops sound modelling and reasoning methods ...
International audiencePioneering work has been done by Jonkers \cite{jonkers} to define a semantics ...
Investigating soundness and completeness of verification calculi for imperative programming language...
We present a formal system for proving the partial correctness of a single-pass instruction sequence...
Formal reasoning about computer programs can be based directly on the semantics of the programming l...
Program correctness techniques aim to prove the absence of bugs, but can yield false alarms because ...
First order logic with transitive closure, and separation logic enable elegant interactive verificat...
Various methods for formal program verification have been around for a long time. Hoare logic is on...
We introduce a new way of reasoning about invariance in terms of footprints in a program logic for o...