 | 2011 |
| 45 |  | David Monniaux,
Martin Bodin:
Modular Abstractions of Reactive Nodes Using Disjunctive Invariants.
APLAS 2011: 19-33 |
| 44 |  | Thomas Martin Gawlitza,
David Monniaux:
Improving Strategies via SMT Solving.
ESOP 2011: 236-255 |
| 43 |  | David Monniaux,
Pierre Corbineau:
On the Generation of Positivstellensatz Witnesses in Degenerate Cases.
ITP 2011: 249-264 |
| 42 |  | David Monniaux,
Laure Gonnord:
Using Bounded Model Checking to Focus Fixpoint Iterations.
SAS 2011: 369-385 |
| 41 |  | Thomas Martin Gawlitza,
David Monniaux:
Improving Strategies via SMT Solving
CoRR abs/1101.2812: (2011) |
| 40 |  | David Monniaux,
Pierre Corbineau:
On the Generation of Positivstellensatz Witnesses in Degenerate Cases
CoRR abs/1105.4421: (2011) |
| 39 |  | David Monniaux,
Laure Gonnord:
Using Bounded Model Checking to Focus Fixpoint Iterations
CoRR abs/1106.2637: (2011) |
| 38 |  | David Monniaux,
Martin Bodin:
Modular Abstractions of Reactive Nodes using Disjunctive Invariants
CoRR abs/1109.1905: (2011) |
| 37 |  | David Monniaux,
Julien Le Guen:
Stratified Static Analysis Based on Variable Dependencies
CoRR abs/1109.2405: (2011) |
| 2010 |
| 36 |  | David Monniaux:
Quantifier Elimination by Lazy Model Enumeration.
CAV 2010: 585-599 |
| 35 |  | David Monniaux:
Automatic Modular Abstractions for Template Numerical Constraints
Logical Methods in Computer Science 6(3): (2010) |
| 2009 |
| 34 |  | David Monniaux:
On Using Floating-Point Computations to Help an Exact Linear Arithmetic Decision Procedure.
CAV 2009: 570-583 |
| 33 |  | David Monniaux:
Automatic modular abstractions for linear constraints.
POPL 2009: 140-151 |
| 32 |  | David Monniaux:
A minimalistic look at widening operators
CoRR abs/0902.3722: (2009) |
| 31 |  | David Monniaux:
On using floating-point computations to help an exact linear arithmetic decision procedure
CoRR abs/0904.3525: (2009) |
| 30 |  | David Monniaux:
Automatic modular abstractions for template numerical constraints
CoRR abs/0909.4013: (2009) |
| 29 |  | David Monniaux:
A minimalistic look at widening operators.
Higher-Order and Symbolic Computation 22(2): 145-154 (2009) |
| 2008 |
| 28 |  | David Monniaux:
A Quantifier Elimination Algorithm for Linear Real Arithmetic.
LPAR 2008: 243-257 |
| 27 |  | David Monniaux:
The pitfalls of verifying floating-point computations.
ACM Trans. Program. Lang. Syst. 30(3): (2008) |
| 26 |  | David Monniaux:
A Quantifier Elimination Algorithm for Linear Real Arithmetic
CoRR abs/0803.1575: (2008) |
| 25 |  | David Monniaux:
Automatic Modular Abstractions for Linear Constraints
CoRR abs/0811.0166: (2008) |
| 2007 |
| 24 |  | David Monniaux:
Verification of device drivers and intelligent controllers: a case study.
EMSOFT 2007: 30-36 |
| 23 |  | David Monniaux:
Optimal Abstraction on Real-Valued Programs.
SAS 2007: 104-120 |
| 22 |  | Patrick Cousot,
Radhia Cousot,
Jérôme Feret,
Antoine Miné,
Laurent Mauborgne,
David Monniaux,
Xavier Rival:
Varieties of Static Analyzers: A Comparison with ASTREE.
TASE 2007: 3-20 |
| 21 |  | David Monniaux:
Applying the Z-transform for the static analysis of floating-point numerical filters
CoRR abs/0706.0252: (2007) |
| 20 |  | David Monniaux:
The parallel implementation of the Astrée static analyzer
CoRR abs/cs/0701191: (2007) |
| 19 |  | David Monniaux:
The pitfalls of verifying floating-point computations
CoRR abs/cs/0701192: (2007) |
| 18 |  | Bruno Blanchet,
Patrick Cousot,
Radhia Cousot,
Jérôme Feret,
Laurent Mauborgne,
Antoine Miné,
David Monniaux,
Xavier Rival:
A Static Analyzer for Large Safety-Critical Software
CoRR abs/cs/0701193: (2007) |
| 17 |  | David Monniaux:
An Abstract Monte-Carlo Method for the Analysis of Probabilistic Programs
CoRR abs/cs/0701195: (2007) |
| 2006 |
| 16 |  | Patrick Cousot,
Radhia Cousot,
Jérôme Feret,
Laurent Mauborgne,
Antoine Miné,
David Monniaux,
Xavier Rival:
Combination of Abstractions in the ASTRÉE Static Analyzer.
ASIAN 2006: 272-300 |
| 2005 |
| 15 |  | David Monniaux:
The Parallel Implementation of the Astrée Static Analyzer.
APLAS 2005: 86-96 |
| 14 |  | David Monniaux:
Compositional Analysis of Floating-Point Linear Numerical Filters.
CAV 2005: 199-212 |
| 13 |  | Patrick Cousot,
Radhia Cousot,
Jérôme Feret,
Laurent Mauborgne,
Antoine Miné,
David Monniaux,
Xavier Rival:
The ASTREÉ Analyzer.
ESOP 2005: 21-30 |
| 12 |  | David Monniaux:
Abstract interpretation of programs as Markov decision processes.
Sci. Comput. Program. 58(1-2): 179-205 (2005) |
| 2003 |
| 11 |  | Bruno Blanchet,
Patrick Cousot,
Radhia Cousot,
Jérôme Feret,
Laurent Mauborgne,
Antoine Miné,
David Monniaux,
Xavier Rival:
A static analyzer for large safety-critical software.
PLDI 2003: 196-207 |
| 10 |  | David Monniaux:
Abstract Interpretation of Programs as Markov Decision Processes.
SAS 2003: 237-254 |
| 9 |  | David Monniaux:
Abstraction of Expectation Functions Using Gaussian Distributions.
VMCAI 2003: 161-173 |
| 8 |  | David Monniaux:
Abstracting cryptographic protocols with tree automata.
Sci. Comput. Program. 47(2-3): 177-202 (2003) |
| 2002 |
| 7 |  | Bruno Blanchet,
Patrick Cousot,
Radhia Cousot,
Jérôme Feret,
Laurent Mauborgne,
Antoine Miné,
David Monniaux,
Xavier Rival:
Design and Implementation of a Special-Purpose Static Program Analyzer for Safety-Critical Real-Time Embedded Software.
The Essence of Computation 2002: 85-108 |
| 2001 |
| 6 |  | David Monniaux:
Backwards Abstract Interpretation of Probabilistic Programs.
ESOP 2001: 367-382 |
| 5 |  | David Monniaux:
An abstract Monte-Carlo method for the analysis of probabilistic programs.
POPL 2001: 93-101 |
| 4 |  | David Monniaux:
An Abstract Analysis of the Probabilistic Termination of Programs.
SAS 2001: 111-126 |
| 2000 |
| 3 |  | David Monniaux:
Abstract Interpretation of Probabilistic Semantics.
SAS 2000: 322-339 |
| 1999 |
| 2 |  | David Monniaux:
Decision Procedures for the Analysis of Cryptographic Protocols by Logics of Belief.
CSFW 1999: 44-54 |
| 1 |  | David Monniaux:
Abstracting Cryptographic Protocols with Tree Automata.
SAS 1999: 149-163 |