Add to ORKGWe develop foundations for proving properties relating two programs. Our formalization is based on a suitably adapted notion of program invariant for a single program. First, we give an abstract formulation of the theory of program invariants based on the notion of assertion function: a function that assigns assertions to program points. Then, we develop this abstract notion further so that it can be used to prove properties between two programs. We describe an application of the theory to proving program properties in translation validation
Proof-producing program analysis augments the invariants inferred by an abstract interpreter with th...
The invariant based programming is a technique of constructing correct programs by first identifying...
AbstractIn this paper we define a new verification method based on an assertion language able to exp...
We develop foundations for proving properties relating two programs. Our formalization is based on a...
There are a few different methods for formally proving that a program agrees with its specifica-tion...
Proof rules for program verification rely on auxiliary assertions. We propose a (sound and relativel...
Abstract—Program invariants are statements or assertions that are widely used in program analysis an...
Abstract. Two programs are mutually equivalent if they both diverge or they end up in similar states...
Abstract. Two programs or fragments of program are mutually equiv-alent i ↵ either they both diverge...
Invariant assertions play an important role in the analysis and documentation of while loops of impe...
AbstractWhereas the analysis of loops in imperative programs is, justifiably, dominated by the conce...
International audienceRelational properties describe multiple runs of one or more programs. They ch...
We present an approach to program reasoning which inserts between a program and its verification con...
Program algebras abstract the essential properties of programming languages in the form of algebraic...
We present a general framework for combining program verification and program analysis. This framewo...
Proof-producing program analysis augments the invariants inferred by an abstract interpreter with th...
The invariant based programming is a technique of constructing correct programs by first identifying...
AbstractIn this paper we define a new verification method based on an assertion language able to exp...
We develop foundations for proving properties relating two programs. Our formalization is based on a...
There are a few different methods for formally proving that a program agrees with its specifica-tion...
Proof rules for program verification rely on auxiliary assertions. We propose a (sound and relativel...
Abstract—Program invariants are statements or assertions that are widely used in program analysis an...
Abstract. Two programs are mutually equivalent if they both diverge or they end up in similar states...
Abstract. Two programs or fragments of program are mutually equiv-alent i ↵ either they both diverge...
Invariant assertions play an important role in the analysis and documentation of while loops of impe...
AbstractWhereas the analysis of loops in imperative programs is, justifiably, dominated by the conce...
International audienceRelational properties describe multiple runs of one or more programs. They ch...
We present an approach to program reasoning which inserts between a program and its verification con...
Program algebras abstract the essential properties of programming languages in the form of algebraic...
We present a general framework for combining program verification and program analysis. This framewo...
Proof-producing program analysis augments the invariants inferred by an abstract interpreter with th...
The invariant based programming is a technique of constructing correct programs by first identifying...
AbstractIn this paper we define a new verification method based on an assertion language able to exp...