International audienceA 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. Experime...
International audienceWe describe a system to prove properties of programs. The key feature of this ...
This paper introduces the use of Graphical Loop Invariant as a programming methodology in a CS1 cour...
textLoop invariants have traditionally been used in proofs of correctness (e.g. program verification...
A crucial point in program analysis is the computation of loop invariants. Accurate invariants are r...
10 pagesLoop invariants play a major role in program verification and drastically speed up processes...
International audienceUsing abstract interpretation, invariants are usually obtained by solving iter...
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...
This paper presents Aligators, a tool for the generation of universally quantified array invariants....
This paper presents Aligators, a tool for the generation of universally quantified array invariants....
We describe symbol elimination and consequence finding in the first-order theorem prover Vampire for...
Many groups around the world conduct research on formal methods for software development, and in mos...
AbstractModular static analyzers use procedure abstractions, a.k.a. summarizations, to ensure that t...
Verifiers that can prove programs correct against their full functional specification require, for p...
The criticality of programs constantly reaches new boundaries as they are relied on to take decision...
International audienceWe describe a system to prove properties of programs. The key feature of this ...
This paper introduces the use of Graphical Loop Invariant as a programming methodology in a CS1 cour...
textLoop invariants have traditionally been used in proofs of correctness (e.g. program verification...
A crucial point in program analysis is the computation of loop invariants. Accurate invariants are r...
10 pagesLoop invariants play a major role in program verification and drastically speed up processes...
International audienceUsing abstract interpretation, invariants are usually obtained by solving iter...
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...
This paper presents Aligators, a tool for the generation of universally quantified array invariants....
This paper presents Aligators, a tool for the generation of universally quantified array invariants....
We describe symbol elimination and consequence finding in the first-order theorem prover Vampire for...
Many groups around the world conduct research on formal methods for software development, and in mos...
AbstractModular static analyzers use procedure abstractions, a.k.a. summarizations, to ensure that t...
Verifiers that can prove programs correct against their full functional specification require, for p...
The criticality of programs constantly reaches new boundaries as they are relied on to take decision...
International audienceWe describe a system to prove properties of programs. The key feature of this ...
This paper introduces the use of Graphical Loop Invariant as a programming methodology in a CS1 cour...
textLoop invariants have traditionally been used in proofs of correctness (e.g. program verification...