28 citations · 42 across the 4 of their papers we have counts for
Showing cs.PLShow all
3 papers · 1 filter
cs.PL2008
Automatic Modular Abstractions for Linear Constraints
David Monniaux
We propose a method for automatically generating abstract transformers for static analysis by abstract interpretation. The method focuses on linear constraints on programs operatin…
cs.PL2007★ 28 cited
An Abstract Monte-Carlo Method for the Analysis of Probabilistic Programs
David Monniaux
We introduce a new method, combination of random testing and abstract interpretation, for the analysis of programs featuring both probabilistic and non-probabilistic nondeterminism…
cs.PL2007★ 14 cited
The parallel implementation of the Astrée static analyzer
David Monniaux
The Astrée static analyzer is a specialized tool that can prove the absence of runtime errors, including arithmetic overflows, in large critical programs. Keeping analysis times re…