We present an integrated proof language for guiding the actions of multiple reasoning systems as they work together to prove complex correctness properties of imperative programs. The language operates in the context of a program verification system that uses multiple reasoning systems to discharge generated proof obligations. It is designed to 1) enable developers to resolve key choice points in complex program correctness proofs, thereby enabling automated reasoning systems to successfully prove the desired correctness properties; 2) allow developers to identify key lemmas for the reasoning systems to prove, thereby guiding the reasoning systems to find an effective proof decomposition; 3) enable multiple reasoning systems to work togethe...
This paper explores the relationship between verification of logic programs and imperative programs ...
International audienceA common belief is that formalizing semantics of programming languages require...
We present a program verification framework based on coinduction, which makes it feasible to verif...
In recent years researchers have developed a wide range of powerful automated reasoning systems. We ...
International audienceIn a world where trusting software systems is increasingly important, formal m...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
We argue that the naive use of the imperative style of working witharrays in a declarative setting l...
Previous work on rewriting and reachability logic establishes a vision for a language-agnostic progr...
We present a new approach for constructing and verifying higher-order, imperative programs using the...
We pursue the vision of an ideal language framework, where programming language designers only need ...
Formal methods are not used widely in industrial software development, because the overhead of forma...
Automatically proving that (infinite-state) software programs satisfy a specification is an importan...
Proof assistants are now widely used in the field of pro-gramming languages research to reason forma...
A number of industrial software development standards mandate that safetycritical software component...
Program verification tools use verification condition generators to produce logical formulas whose v...
This paper explores the relationship between verification of logic programs and imperative programs ...
International audienceA common belief is that formalizing semantics of programming languages require...
We present a program verification framework based on coinduction, which makes it feasible to verif...
In recent years researchers have developed a wide range of powerful automated reasoning systems. We ...
International audienceIn a world where trusting software systems is increasingly important, formal m...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
We argue that the naive use of the imperative style of working witharrays in a declarative setting l...
Previous work on rewriting and reachability logic establishes a vision for a language-agnostic progr...
We present a new approach for constructing and verifying higher-order, imperative programs using the...
We pursue the vision of an ideal language framework, where programming language designers only need ...
Formal methods are not used widely in industrial software development, because the overhead of forma...
Automatically proving that (infinite-state) software programs satisfy a specification is an importan...
Proof assistants are now widely used in the field of pro-gramming languages research to reason forma...
A number of industrial software development standards mandate that safetycritical software component...
Program verification tools use verification condition generators to produce logical formulas whose v...
This paper explores the relationship between verification of logic programs and imperative programs ...
International audienceA common belief is that formalizing semantics of programming languages require...
We present a program verification framework based on coinduction, which makes it feasible to verif...