328 citations · 732 across the 43 of their papers we have counts for
47 papers
The existence of polyhedral invariants is undecidable for linear systems
David Monniaux
The existence of polyhedral inductive invariants suitable for proving that a given control location is unreachable is undecidable for programs using only linear arithmetic over Z o…
Completeness in static analysis by abstract interpretation, a personal point of view
David Monniaux
Static analysis by abstract interpretation is generally designed to be "sound", that is, it should not claim to establish properties that do not hold-in other words, not provide "f…
BAXMC: a CEGAR approach to Max#SAT
Thomas Vigouroux, Cristian Ene, David Monniaux +2
Max#SAT is an important problem with multiple applications in security and program synthesis that is proven hard to solve. It is defined as: given a parameterized quantifier-free p…
Formally verified 32- and 64-bit integer division using double-precision floating-point arithmetic
David Monniaux, Alice Pain
Some recent processors are not equipped with an integer division unit. Compilers then implement division by a call to a special function supplied by the processor designers, which…
NP = PP and other remarks about maximized counting
David Monniaux
We consider the following decision problem DMAX#SAT, and generalizations thereof: given a quantifier-free propositional formula , where $\mathbf{x},\mathb…
The complexity gap in the static analysis of cache accesses grows if procedure calls are added
David Monniaux
The static analysis of cache accesses consists in correctly predicting which accesses are hits or misses. While there exist good exact and approximate analyses for caches implement…