This paper addresses the problem of proving a given invariance property phi of a loop in a numeric program, by inferring automatically a stronger inductive invariant psi. The algorithm we present is based on both abstract interpretation and constraint solving. As in abstract interpretation, it computes the effect of a loop using a numeric abstract domain. As in constraint satisfaction, it works from ``above'' -- interactively splitting and tightening a collection of abstract elements until an inductive invariant is found. Our experiments show that the algorithm can find non-linear inductive invariants that cannot normally be obtained using intervals (or octagons), even when classic techniques for increasing abstract-interpretation precision...
Checking whether a given formula is an invariant at a given program location (especially, inside a l...
One of the obstacles in automatic program proving is to obtain suit-able loop invariants. The invari...
International audienceWe describe a system to prove properties of programs. The key feature of this ...
International audienceIn this talk, we suggest the idea of using algorithms inspired by Constraint P...
Abstract—Loop invariants play a major role in program verifi-cation. Though various techniques have ...
International audienceWe propose a “formula slicing” method for finding inductive invariants. It is ...
Abstract. Most of the properties established during program verification are either invariants or de...
International audienceWe propose to extend an existing framework combining abstract interpretation a...
Abstract. We present a constraint-based algorithm for the synthesis of invariants expressed in the c...
The problem of synthesizing adequate inductive invariants to prove a program correct lies at the he...
Abstract. We present a constraint-based algorithm for the synthesis of invariants expressed in the c...
This paper describes a sound technique that combines the precision of theorem proving with the loop-...
International audienceBy combining algorithmic learning, decision procedures, and predicate abstract...
Abstract. Most of the properties established during program verification are either invariants or de...
Abstract. We describe the design and implementation of an automatic invariant generator for imperati...
Checking whether a given formula is an invariant at a given program location (especially, inside a l...
One of the obstacles in automatic program proving is to obtain suit-able loop invariants. The invari...
International audienceWe describe a system to prove properties of programs. The key feature of this ...
International audienceIn this talk, we suggest the idea of using algorithms inspired by Constraint P...
Abstract—Loop invariants play a major role in program verifi-cation. Though various techniques have ...
International audienceWe propose a “formula slicing” method for finding inductive invariants. It is ...
Abstract. Most of the properties established during program verification are either invariants or de...
International audienceWe propose to extend an existing framework combining abstract interpretation a...
Abstract. We present a constraint-based algorithm for the synthesis of invariants expressed in the c...
The problem of synthesizing adequate inductive invariants to prove a program correct lies at the he...
Abstract. We present a constraint-based algorithm for the synthesis of invariants expressed in the c...
This paper describes a sound technique that combines the precision of theorem proving with the loop-...
International audienceBy combining algorithmic learning, decision procedures, and predicate abstract...
Abstract. Most of the properties established during program verification are either invariants or de...
Abstract. We describe the design and implementation of an automatic invariant generator for imperati...
Checking whether a given formula is an invariant at a given program location (especially, inside a l...
One of the obstacles in automatic program proving is to obtain suit-able loop invariants. The invari...
International audienceWe describe a system to prove properties of programs. The key feature of this ...