David Monniaux

发表

An Efficient Parametric Linear Programming Solver and Application to Polyhedral Projection

Hang Yu, David Monniaux, 2019, SAS.

A static analyzer for large safety-critical software

Patrick Cousot, Antoine Miné, Xavier Rival, 2003, PLDI '03.

Abstraction of Expectation Functions Using Gaussian Distributions

David Monniaux, 2003, VMCAI.

Compositional Analysis of Floating-Point Linear Numerical Filters

David Monniaux, 2005, CAV.

Combining Forward and Backward Abstract Interpretation of Horn Clauses pdf

David Monniaux, Alexey Bakhirkin, 2017, SAS.

Design and Implementation of a Special-Purpose Static Program Analyzer for Safety-Critical Real-Time Embedded Software

Patrick Cousot, Antoine Miné, Xavier Rival, 2002, The Essence of Computation.

Ascertaining Uncertainty for Efficient Exact Cache Analysis

Jan Reineke, David Monniaux, Valentin Touzeau, 2017, CAV.

Synthesis of ranking functions using extremal counterexamples

Laure Gonnord, David Monniaux, Gabriel Radanne, 2015, PLDI.

On the Generation of Positivstellensatz Witnesses in Degenerate Cases

Pierre Corbineau, David Monniaux, D. Monniaux, 2011, ITP.

Abstract interpretation of programs as Markov decision processes

David Monniaux, 2005, Sci. Comput. Program..

Optimal Abstraction on Real-Valued Programs

David Monniaux, 2007, SAS.

Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs

David Monniaux, Thomas Gawlitza, D. Monniaux, 2012, Log. Methods Comput. Sci..

Certified Compiler Backends for VLIW Processors Highly Modular Postpass-Scheduling in the CompCert Certified Compiler

David Monniaux, Cyril Six, Sylvain Boulme, 2019 .

Polyhedra to the rescue of array interpolants

David Monniaux, Francesco Alberti, 2015, SAC.

Scaling up logico-numerical strategy iteration (extended version) pdf

Peter Schrammel, David Monniaux, D. Monniaux, 2014, ArXiv.

Improving Strategies via SMT Solving pdf

David Monniaux, Thomas Gawlitza, D. Monniaux, 2011, ESOP.

Decision procedures for the analysis of cryptographic protocols by logics of belief

David Monniaux, 1999, Proceedings of the 12th IEEE Computer Security Foundations Workshop.

Abstract Interpretation of Probabilistic Semantics

David Monniaux, D. Monniaux, 2000, SAS.

On the decidability of the existence of polyhedral invariants in transition systems

David Monniaux, 2018, Acta Informatica.

Verifying Programs with Arrays and Lists

Laure Gonnord, David Monniaux, Julien Braine, 2016 .

PAGAI: A Path Sensitive Static Analyser pdf

David Monniaux, Matthieu Moy, Julien Henry, 2012, Electron. Notes Theor. Comput. Sci..

A task-based approach to parallel parametric linear programming solving, and application to polyhedral computations pdf

Camille Coti, David Monniaux, Hang Yu, 2020, ArXiv.

On using floating-point computations to help an exact linear arithmetic decision procedure

David Monniaux, D. Monniaux, 2009, CAV.

Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming

David Monniaux, Michaël Périn, Alexandre Maréchal, 2017, SAS.

Abstracting cryptographic protocols with tree automata

David Monniaux, D. Monniaux, 1999, Sci. Comput. Program..

The ASTREÉ Analyzer

Patrick Cousot, Antoine Miné, Xavier Rival, 2005, ESOP.

The pitfalls of verifying floating-point computations pdf

David Monniaux, D. Monniaux, 2007, TOPL.

Using Bounded Model Checking to Focus Fixpoint Iterations pdf

Laure Gonnord, David Monniaux, 2011, SAS.

Analyse statique : de la théorie à la pratique ; analyse statique de code embarqué de grande taille, génération de domaines abstraits. (Static analysis: from theory to practice ; Static analysis of large-scale embedded code, generation of abstract domains)

David Monniaux, David Monniaux, 2009 .

Modular Abstractions of Reactive Nodes Using Disjunctive Invariants pdf

David Monniaux, Martin Bodin, 2011, APLAS.

How to compute worst-case execution time by optimization modulo theory and a clever encoding of program semantics pdf

David Monniaux, Mihail Asavoae, Julien Henry, 2014, LCTES '14.

Quantifier Elimination by Lazy Model Enumeration

David Monniaux, D. Monniaux, 2010, CAV.

Design and Implementation of a Special-Purpose Static Program Analyzer for Safety-Critical Real-Time Embedded Software, invited chapter

Patrick Cousot, Antoine Miné, Xavier Rival, 2002 .

The Parallel Implementation of the Astrée Static Analyzer

David Monniaux, D. Monniaux, 2005, APLAS.

Implementing and Reasoning About Hash-consed Data Structures in Coq

Jacques-Henri Jourdan, David Monniaux, Thomas Braibant, 2013, Journal of Automated Reasoning.

A Quantifier Elimination Algorithm for Linear Real Arithmetic pdf

David Monniaux, 2008, LPAR.

Varieties of Static Analyzers: A Comparison with ASTREE

Patrick Cousot, Antoine Miné, Xavier Rival, 2007, First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07).

Parallel parametric linear programming solving, and application to polyhedral computations pdf

Camille Coti, David Monniaux, Hang Yu, 2019, ICCS.

On computing invariants for predicate abstraction by SAT-solving

David Monniaux, 2009 .

Backwards Abstract Interpretation of Probabilistic Programs

David Monniaux, D. Monniaux, 2001, ESOP.

Extending Constraint-Only Representation of Polyhedra with Boolean Constraints

David Monniaux, Alexey Bakhirkin, D. Monniaux, 2018, SAS.

Applying the Z-transform for the static analysis of floating-point numerical filters pdf

David Monniaux, 2007, ArXiv.

A Survey of Satisfiability Modulo Theory

David Monniaux, D. Monniaux, 2016, CASC.

Program Analysis with Local Policy Iteration pdf

David Monniaux, Philipp Wendler, Egor George Karpenkov, 2016, VMCAI.

Cell Morphing: From Array Programs to Array-Free Horn Clauses

Laure Gonnord, David Monniaux, 2016, SAS.

Coming out of the niche

David Monniaux, 2010 .

Experiments on the feasibility of using a floating-point simplex in an SMT solver

David Monniaux, Diego Caminha Barbosa De Oliveira, D. Monniaux, 2013, PAAR@IJCAR.

New Software and Platforms - Termite

Laure Gonnord, David Monniaux, Gabriel Radanne, 2014 .

Stratified Static Analysis Based on Variable Dependencies pdf

David Monniaux, Julien Le Guen, D. Monniaux, 2011, NSAD@SAS.

An encoding of array verification problems into array-free Horn clauses pdf

Laure Gonnord, David Monniaux, 2015, ArXiv.

Speeding Up Logico-Numerical Strategy Iteration

Peter Schrammel, David Monniaux, D. Monniaux, 2014, SAS.

Formula Slicing: Inductive Invariants from Preconditions

David Monniaux, Egor George Karpenkov, 2016, Haifa Verification Conference.

Anatomy of Alternating Quantifier Satisfiability (Work in progress)

Nikolaj Bjørner, David Monniaux, Anh-Dung Phan, 2012, SMT@IJCAR.

Analysis of probabilistic programs by abstract interpretation. (Analyse de programmes probabilistes par interprétation abstraite)

David Monniaux, 2001 .

A Simple Abstraction of Arrays and Maps by Program Translation pdf

David Monniaux, Francesco Alberti, 2015, SAS.

Implementing Hash-Consed Structures in Coq pdf

Jacques-Henri Jourdan, David Monniaux, Thomas Braibant, 2013, ITP.

Automatic modular abstractions for template numerical constraints

David Monniaux, D. Monniaux, 2009, Log. Methods Comput. Sci..

Combination of Abstractions in the ASTRÉE Static Analyzer

Patrick Cousot, Antoine Miné, Xavier Rival, 2006, ASIAN.

A minimalistic look at widening operators

David Monniaux, D. Monniaux, 2009, High. Order Symb. Comput..

Model Checking of Cache for WCET Analysis Refinement pdf

David Monniaux, Valentin Touzeau, Claire Maïza, 2017, ArXiv.

Static Analysis Based on Variable Dependencies

David Monniaux, Julien Le Guen, 2011 .

Verification, Model Checking, and Abstract Interpretation - 18th International Conference, VMCAI 2017, Paris, France, January 15-17, 2017, Proceedings

Ahmed Bouajjani, David Monniaux, D. Monniaux, 2017, VNCAI.

Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra

David Monniaux, Michaël Périn, Alexis Fouilhé, 2013, SAS.

An abstract Monte-Carlo method for the analysis of probabilistic programs

David Monniaux, 2001, POPL '01.

Fast and exact analysis for LRU caches

Jan Reineke, David Monniaux, Valentin Touzeau, 2018, Proc. ACM Program. Lang..

The Verified Polyhedron Library: an Overview

David Monniaux, Sylvain Boulmé, Hang Yu, 2018, 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC).

Succinct Representations for Abstract Interpretation pdf

David Monniaux, Matthieu Moy, Julien Henry, 2012, ArXiv.

Polyhedral Approximation of Multivariate Polynomials Using Handelman's Theorem

David Monniaux, Michaël Périn, Alexis Fouilhé, 2016, VMCAI.

The ASTR ´ EE Analyzer

Patrick Cousot, Xavier Rival, David Monniaux, 2005 .

Automatic modular abstractions for linear constraints

David Monniaux, D. Monniaux, 2008, POPL '09.

Succinct Representations for Abstract Interpretation - Combined Analysis Algorithms and Experimental Evaluation

David Monniaux, Matthieu Moy, Julien Henry, 2012, SAS.

Computer Aided Verification

Jan Reineke, David Monniaux, Valentin Touzeau, 2017, Lecture Notes in Computer Science.

Abstracting cryptographic protocols with tree automata

David Monniaux, 2003, Sci. Comput. Program..

Analyse de programmes probabilistes par interprétation abstraite

David Monniaux, D. Monniaux, 2001 .

On the Complexity of Cache Analysis for Different Replacement Policies pdf

David Monniaux, Valentin Touzeau, Valentin Touzeau, 2018, J. ACM.

New Results - Termination of C Programs

Laure Gonnord, David Monniaux, Gabriel Radanne, 2015 .

An Abstract Analysis of the Probabilistic Termination of Programs

David Monniaux, 2001, SAS.

Verification of device drivers and intelligent controllers: a case study

David Monniaux, D. Monniaux, 2007, EMSOFT '07.

Certified and efficient instruction scheduling: application to interlocked VLIW processors

David Monniaux, Sylvain Boulmé, Cyril Six, 2020, Proc. ACM Program. Lang..

Abstract interpretation of programs as Markov decision processes

David Monniaux, D. Monniaux, 2003, Sci. Comput. Program..

Data Abstraction: A General Framework to Handle Program Verification of Data Structures

Laure Gonnord, David Monniaux, Julien Braine, 2021, SAS.

The Trusted Computing Base of the CompCert Verified Compiler

David Monniaux, Sylvain Boulm'e, 2022 .

Formally verified superblock scheduling

David Monniaux, Sylvain Boulmé, Cyril Six, 2022, CPP.

Simple, light, yet formally verified, global common subexpression elimination and loop-invariant code motion

David Monniaux, Cyril Six, 2021, LCTES.

Fatal Degeneracy in the Semidefinite Programming Approach to the Decision of Polynomial Inequalities

David Monniaux, D. Monniaux, 2009, 0901.4907.