A crucial point in program analysis is the computation of loop invariants. Accurate invariants are required to prove properties on a program but they are difficult to compute. Extensive research has been carried out but, to the best of our knowledge, no benchmark has ever been developed to compare algorithms and tools. We present ALICe, a toolset to compare automatic computation techniques of affine loop scalar invariants. It comes with a benchmark that we built using 102 test cases which we found in the loop invariant bibliography, and interfaces with three analysis programs, that rely on different techniques: Aspic, ISL and PIPS. Conversion tools are provided to handle format heterogeneity of these programs. Experimental results show the ...
International audienceUsing abstract interpretation, invariants are usually obtained by solving iter...
Checking whether a given formula is an invariant at a given program location (especially, inside a l...
International audienceWe describe a system to prove properties of programs. The key feature of this ...
International audienceA crucial point in program analysis is the computation of loop invariants. Acc...
Acceleration is a technique for summarising loops by computing a closed-form representation of the l...
Abstract—Acceleration is a technique for summarising loops by computing a closed-form representation...
Many groups around the world conduct research on formal methods for software development, and in mos...
textLoop invariants have traditionally been used in proofs of correctness (e.g. program verification...
AbstractUsing abstract interpretation, invariants are usually obtained by solving iteratively a syst...
We present abstract acceleration techniques for computing loop in-variants for numerical programs wi...
Invariants are a standard concept for reasoning about unbounded loops since Floyd-Hoare logic in the...
We present abstract acceleration techniques for computing loop invariants for numerical programs wit...
The inference of linear inequality invariants among variables of a program plays an important role i...
One of the obstacles in automatic program proving is to obtain suit-able loop invariants. The invari...
We describe an iterative algorithm for mechanically deriving loop invariants \u000Afor the purpose o...
International audienceUsing abstract interpretation, invariants are usually obtained by solving iter...
Checking whether a given formula is an invariant at a given program location (especially, inside a l...
International audienceWe describe a system to prove properties of programs. The key feature of this ...
International audienceA crucial point in program analysis is the computation of loop invariants. Acc...
Acceleration is a technique for summarising loops by computing a closed-form representation of the l...
Abstract—Acceleration is a technique for summarising loops by computing a closed-form representation...
Many groups around the world conduct research on formal methods for software development, and in mos...
textLoop invariants have traditionally been used in proofs of correctness (e.g. program verification...
AbstractUsing abstract interpretation, invariants are usually obtained by solving iteratively a syst...
We present abstract acceleration techniques for computing loop in-variants for numerical programs wi...
Invariants are a standard concept for reasoning about unbounded loops since Floyd-Hoare logic in the...
We present abstract acceleration techniques for computing loop invariants for numerical programs wit...
The inference of linear inequality invariants among variables of a program plays an important role i...
One of the obstacles in automatic program proving is to obtain suit-able loop invariants. The invari...
We describe an iterative algorithm for mechanically deriving loop invariants \u000Afor the purpose o...
International audienceUsing abstract interpretation, invariants are usually obtained by solving iter...
Checking whether a given formula is an invariant at a given program location (especially, inside a l...
International audienceWe describe a system to prove properties of programs. The key feature of this ...