A static analyzer for large safety-critical software
- B. Blanchet, P. Cousot, Xavier Rival
- Computer ScienceACM-SIGPLAN Symposium on Programming Language…
- 9 June 2003
We show that abstract interpretation-based static program analysis can be made efficient and precise enough to formally verify a class of properties for a family of large programs with few or no…
The ASTREÉ Analyzer
- P. Cousot, R. Cousot, Xavier Rival
- Computer ScienceEuropean Symposium on Programming
- 4 April 2005
ASTREE is an abstract interpretation-based static program analyzer aiming at proving automatically the absence of run time errors in programs written in the C programming language, producing a correctness proof for complex software without any false alarm in a few hours of computation.
PAGAI: A Path Sensitive Static Analyser
- Julien Henry, D. Monniaux, M. Moy
- Computer ScienceTAPAS@SAS
- 17 July 2012
Combination of Abstractions in the ASTRÉE Static Analyzer
- P. Cousot, R. Cousot, Xavier Rival
- Computer ScienceAsian Computing Science Conference
- 6 December 2006
We describe the structure of the abstract domains in the ASTREE static analyzer, their modular organization into a hierarchical network, their cooperation to over-approximate the conjunction/reduced…
Design and Implementation of a Special-Purpose Static Program Analyzer for Safety-Critical Real-Time Embedded Software
- B. Blanchet, P. Cousot, Xavier Rival
- Computer ScienceThe Essence of Computation
- 2002
We report on a successful preliminary experience in the design and implementation of a special-purpose Abstract Interpretation based static program analyzer for the verification of safety critical…
Abstract Interpretation of Probabilistic Semantics
- D. Monniaux
- Computer ScienceSensors Applications Symposium
- 29 June 2000
This work lifts standard deterministic and nondeterministic semantics of imperative programs to probabilistic semantics, which allows for random external inputs of known or unknown probability and random number generators.
Quantifier Elimination by Lazy Model Enumeration
- D. Monniaux
- Computer ScienceInternational Conference on Computer Aided…
- 15 July 2010
We propose a quantifier elimination scheme based on nested lazy model enumeration through SMT-solving, and projections This scheme may be applied to any logic that fulfills certain conditions; we…
A Quantifier Elimination Algorithm for Linear Real Arithmetic
- D. Monniaux
- Computer ScienceLogic Programming and Automated Reasoning
- 11 March 2008
The quantifier elimination algorithm presented in the paper is compared, on examples arising from program analysis problems and on random examples, to several other implementations, all of which cannot solve some of the examples that the algorithm solves easily.
Abstract interpretation of programs as Markov decision processes
- D. Monniaux
- Computer ScienceScience of Computer Programming
- 11 June 2003
Abstracting cryptographic protocols with tree automata
- D. Monniaux
- Computer Science, MathematicsScience of Computer Programming
- 22 September 1999
...
...