default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Monniaux
Person information
- affiliation: University of Grenoble, VERIMAG, France
- affiliation: Joseph Fourier University, Grenoble, France
- affiliation (PhD 2001): Paris Dauphine University, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j16]David Monniaux:
Pragmatics of formally verified yet efficient static analysis, in particular, for formally verified compilers. Int. J. Softw. Tools Technol. Transf. 26(4): 463-477 (2024)- [c57]David Monniaux:
Memory Simulations, Security and Optimization in a Verified Compiler. CPP 2024: 103-117 - [e2]Temur Kutsia, Daniel Ventura, David Monniaux, José F. Morales:
Proceedings 18th International Workshop on Logical and Semantic Frameworks, with Applications and 10th Workshop on Horn Clauses for Verification and Synthesis, LSFA/HCVS 2023, and 10th Workshop on Horn Clauses for Verification and SynthesisRome, Italy & Paris, France, 1-2 July, 2023 & 23rd April 2023. EPTCS 402, 2024 [contents] - [i45]David Monniaux:
Pragmatics of Formally Verified Yet Efficient Static Analysis, in particular for Formally Verified Compilers. CoRR abs/2407.08258 (2024) - 2023
- [j15]Léo Gourdin
, Benjamin Bonneau, Sylvain Boulmé, David Monniaux, Alexandre Bérard:
Formally Verifying Optimizations with Block Simulations. Proc. ACM Program. Lang. 7(OOPSLA2): 59-88 (2023) - [j14]David Monniaux, Cyril Six:
Formally Verified Loop-Invariant Code Motion and Assorted Optimizations. ACM Trans. Embed. Comput. Syst. 22(1): 3:1-3:27 (2023) - [c56]David Monniaux, Léo Gourdin, Sylvain Boulmé, Olivier Lebeltel:
Testing a Formally Verified Compiler. TAP 2023: 40-48 - [i44]David Monniaux:
Memory Simulations, Security and Optimization in a Verified Compiler. CoRR abs/2312.08117 (2023) - 2022
- [c55]David Monniaux, Alice Pain:
Formally verified 32- and 64-bit integer division using double-precision floating-point arithmetic. ARITH 2022: 128-132 - [c54]Cyril Six, Léo Gourdin, Sylvain Boulmé, David Monniaux, Justus Fasse, Nicolas Nardino:
Formally verified superblock scheduling. CPP 2022: 40-54 - [c53]David Monniaux, Sylvain Boulmé:
The Trusted Computing Base of the CompCert Verified Compiler. ESOP 2022: 204-233 - [c52]Thomas Vigouroux, Cristian Ene, David Monniaux, Laurent Mounier, Marie-Laure Potet:
BaxMC: a CEGAR approach to Max#SAT. FMCAD 2022: 170-178 - [i43]David Monniaux, Sylvain Boulmé:
The Trusted Computing Base of the CompCert Verified Compiler. CoRR abs/2201.10280 (2022) - [i42]David Monniaux:
The complexity gap in the static analysis of cache accesses grows if procedure calls are added. CoRR abs/2201.13056 (2022) - [i41]David Monniaux:
NP#P = ∃PP and other remarks about maximized counting. CoRR abs/2202.11955 (2022) - [i40]David Monniaux, Alice Pain:
Formally verified 32- and 64-bit integer division using double-precision floating-point arithmetic. CoRR abs/2207.08420 (2022) - [i39]Thomas Vigouroux, Cristian Ene, David Monniaux, Laurent Mounier, Marie-Laure Potet:
BAXMC: a CEGAR approach to Max\#SAT. CoRR abs/2211.00973 (2022) - [i38]David Monniaux:
Completeness in static analysis by abstract interpretation, a personal point of view. CoRR abs/2211.09572 (2022) - 2021
- [j13]Camille Coti, David Monniaux, Hang Yu:
A task-based approach to parallel parametric linear programming solving, and application to polyhedral computations. Concurr. Comput. Pract. Exp. 33(6) (2021) - [j12]David Monniaux:
The complexity gap in the static analysis of cache accesses grows if procedure calls are added. Formal Methods Syst. Des. 59(1): 1-20 (2021) - [c51]David Monniaux, Cyril Six:
Simple, light, yet formally verified, global common subexpression elimination and loop-invariant code motion. LCTES 2021: 85-96 - [c50]Julien Braine, Laure Gonnord, David Monniaux:
Data Abstraction: A General Framework to Handle Program Verification of Data Structures. SAS 2021: 215-235 - [i37]David Monniaux, Cyril Six:
Simple, Light, Yet Formally Verified, Global Common Subexpression Elimination and Loop-Invariant Code Motion. CoRR abs/2105.01344 (2021) - 2020
- [j11]Cyril Six, Sylvain Boulmé, David Monniaux:
Certified and efficient instruction scheduling: application to interlocked VLIW processors. Proc. ACM Program. Lang. 4(OOPSLA): 129:1-129:29 (2020) - [i36]Camille Coti, David Monniaux, Hang Yu:
A task-based approach to parallel parametric linear programming solving, and application to polyhedral computations. CoRR abs/2009.14435 (2020)
2010 – 2019
- 2019
- [j10]David Monniaux:
On the decidability of the existence of polyhedral invariants in transition systems. Acta Informatica 56(4): 385-389 (2019) - [j9]David Monniaux, Valentin Touzeau:
On the Complexity of Cache Analysis for Different Replacement Policies. J. ACM 66(6): 41:1-41:22 (2019) - [j8]Valentin Touzeau, Claire Maïza, David Monniaux, Jan Reineke:
Fast and exact analysis for LRU caches. Proc. ACM Program. Lang. 3(POPL): 54:1-54:29 (2019) - [c49]Camille Coti, David Monniaux, Hang Yu:
Parallel Parametric Linear Programming Solving, and Application to Polyhedral Computations. ICCS (5) 2019: 566-572 - [c48]Hang Yu, David Monniaux:
An Efficient Parametric Linear Programming Solver and Application to Polyhedral Projection. SAS 2019: 203-224 - [i35]Camille Coti, David Monniaux, Hang Yu:
Parallel parametric linear programming solving, and application to polyhedral computations. CoRR abs/1904.06079 (2019) - [i34]Hang Yu, David Monniaux:
An Efficient Parametric Linear Programming Solver and Application to Polyhedral Projection. CoRR abs/1911.09755 (2019) - 2018
- [c47]Alexey Bakhirkin, David Monniaux:
Extending Constraint-Only Representation of Polyhedra with Boolean Constraints. SAS 2018: 127-145 - [c46]Sylvain Boulmé, Alexandre Maréchal, David Monniaux, Michaël Périn, Hang Yu:
The Verified Polyhedron Library: an Overview. SYNASC 2018: 9-17 - [i33]Claire Maïza, Valentin Touzeau, David Monniaux, Jan Reineke:
Fast and exact analysis for LRU caches. CoRR abs/1811.01670 (2018) - [i32]David Monniaux, Valentin Touzeau:
On the complexity of cache analysis for different replacement policies. CoRR abs/1811.01740 (2018) - 2017
- [c45]Valentin Touzeau, Claire Maïza, David Monniaux, Jan Reineke:
Ascertaining Uncertainty for Efficient Exact Cache Analysis. CAV (2) 2017: 22-40 - [c44]Alexey Bakhirkin, David Monniaux:
Combining Forward and Backward Abstract Interpretation of Horn Clauses. SAS 2017: 23-45 - [c43]Alexandre Maréchal, David Monniaux, Michaël Périn:
Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming. SAS 2017: 212-231 - [e1]Ahmed Bouajjani, David Monniaux:
Verification, Model Checking, and Abstract Interpretation - 18th International Conference, VMCAI 2017, Paris, France, January 15-17, 2017, Proceedings. Lecture Notes in Computer Science 10145, Springer 2017, ISBN 978-3-319-52233-3 [contents] - [i31]Valentin Touzeau, Claire Maïza, David Monniaux:
Model Checking of Cache for WCET Analysis Refinement. CoRR abs/1701.08030 (2017) - [i30]Alexey Bakhirkin, David Monniaux:
Combining Forward and Backward Abstract Interpretation of Horn Clauses. CoRR abs/1707.01277 (2017) - [i29]David Monniaux:
On the decidability of the existence of polyhedral invariants in transition systems. CoRR abs/1709.04382 (2017) - [i28]Valentin Touzeau, Claire Maïza, David Monniaux, Jan Reineke:
Ascertaining Uncertainty for Efficient Exact Cache Analysis. CoRR abs/1709.10008 (2017) - 2016
- [c42]David Monniaux:
A Survey of Satisfiability Modulo Theory. CASC 2016: 401-425 - [c41]Egor George Karpenkov, David Monniaux:
Formula Slicing: Inductive Invariants from Preconditions. Haifa Verification Conference 2016: 169-185 - [c40]David Monniaux, Laure Gonnord:
Cell Morphing: From Array Programs to Array-Free Horn Clauses. SAS 2016: 361-382 - [c39]Egor George Karpenkov, David Monniaux, Philipp Wendler:
Program Analysis with Local Policy Iteration. VMCAI 2016: 127-146 - [c38]Alexandre Maréchal, Alexis Fouilhé, Tim King, David Monniaux, Michaël Périn:
Polyhedral Approximation of Multivariate Polynomials Using Handelman's Theorem. VMCAI 2016: 166-184 - [i27]David Monniaux:
A Survey of Satisfiability Modulo Theory. CoRR abs/1606.04786 (2016) - [i26]Egor George Karpenkov, David Monniaux:
Formula Slicing: Inductive Invariants from Preconditions. CoRR abs/1609.09288 (2016) - 2015
- [c37]Laure Gonnord, David Monniaux, Gabriel Radanne:
Synthesis of ranking functions using extremal counterexamples. PLDI 2015: 608-618 - [c36]Francesco Alberti, David Monniaux:
Polyhedra to the rescue of array interpolants. SAC 2015: 1745-1750 - [c35]David Monniaux, Francesco Alberti:
A Simple Abstraction of Arrays and Maps by Program Translation. SAS 2015: 217-234 - [i25]David Monniaux, Francesco Alberti:
A simple abstraction of arrays and maps by program translation. CoRR abs/1506.04161 (2015) - [i24]George Karpenkov, David Monniaux, Philipp Wendler:
Program Analysis with Local Policy Iteration. CoRR abs/1509.03424 (2015) - [i23]David Monniaux, Laure Gonnord:
An encoding of array verification problems into array-free Horn clauses. CoRR abs/1509.09092 (2015) - 2014
- [j7]Thomas Braibant, Jacques-Henri Jourdan, David Monniaux:
Implementing and Reasoning About Hash-consed Data Structures in Coq. J. Autom. Reason. 53(3): 271-304 (2014) - [c34]Julien Henry, Mihail Asavoae, David Monniaux, Claire Maiza:
How to compute worst-case execution time by optimization modulo theory and a clever encoding of program semantics. LCTES 2014: 43-52 - [c33]David Monniaux, Peter Schrammel:
Speeding Up Logico-Numerical Strategy Iteration. SAS 2014: 253-267 - [i22]David Monniaux, Peter Schrammel:
Scaling up logico-numerical strategy iteration (extended version). CoRR abs/1403.2319 (2014) - [i21]Julien Henry, Mihail Asavoae, David Monniaux, Claire Maïza:
How to Compute Worst-Case Execution Time by Optimization Modulo Theory and a Clever Encoding of Program Semantics. CoRR abs/1405.7962 (2014) - 2013
- [c32]Thomas Braibant, Jacques-Henri Jourdan, David Monniaux:
Implementing Hash-Consed Structures in Coq. ITP 2013: 477-483 - [c31]Alexis Fouilhé, David Monniaux, Michaël Périn:
Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra. SAS 2013: 345-365 - [i20]Alexis Fouilhé, David Monniaux, Michaël Périn:
Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra. CoRR abs/1304.0864 (2013) - [i19]Thomas Braibant, Jacques-Henri Jourdan, David Monniaux:
Implementing hash-consed structures in Coq. CoRR abs/1304.6038 (2013) - [i18]Thomas Braibant, Jacques-Henri Jourdan, David Monniaux:
Implementing and reasoning about hash-consed data structures in Coq. CoRR abs/1311.2959 (2013) - 2012
- [j6]Thomas Martin Gawlitza, David Monniaux:
Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs. Log. Methods Comput. Sci. 8(3) (2012) - [c30]Diego Caminha Barbosa De Oliveira, David Monniaux:
Experiments on the feasibility of using a floating-point simplex in an SMT solver. PAAR@IJCAR 2012: 19-28 - [c29]Anh-Dung Phan, Nikolaj S. Bjørner, David Monniaux:
Anatomy of Alternating Quantifier Satisfiability (Work in progress). SMT@IJCAR 2012: 120-130 - [c28]Julien Henry, David Monniaux, Matthieu Moy:
Succinct Representations for Abstract Interpretation - Combined Analysis Algorithms and Experimental Evaluation. SAS 2012: 283-299 - [c27]Julien Henry, David Monniaux, Matthieu Moy:
PAGAI: A Path Sensitive Static Analyser. TAPAS@SAS 2012: 15-25 - [i17]Julien Henry, David Monniaux, Matthieu Moy:
Succinct Representations for Abstract Interpretation. CoRR abs/1206.4234 (2012) - [i16]Julien Henry, David Monniaux, Matthieu Moy:
PAGAI: a path sensitive static analyzer. CoRR abs/1207.3937 (2012) - 2011
- [c26]David Monniaux, Martin Bodin:
Modular Abstractions of Reactive Nodes Using Disjunctive Invariants. APLAS 2011: 19-33 - [c25]Thomas Martin Gawlitza, David Monniaux:
Improving Strategies via SMT Solving. ESOP 2011: 236-255 - [c24]David Monniaux, Pierre Corbineau:
On the Generation of Positivstellensatz Witnesses in Degenerate Cases. ITP 2011: 249-264 - [c23]David Monniaux, Laure Gonnord:
Using Bounded Model Checking to Focus Fixpoint Iterations. SAS 2011: 369-385 - [c22]David Monniaux, Julien Le Guen:
Stratified Static Analysis Based on Variable Dependencies. NSAD@SAS 2011: 61-74 - [i15]Thomas Martin Gawlitza, David Monniaux:
Improving Strategies via SMT Solving. CoRR abs/1101.2812 (2011) - [i14]David Monniaux, Pierre Corbineau:
On the Generation of Positivstellensatz Witnesses in Degenerate Cases. CoRR abs/1105.4421 (2011) - [i13]David Monniaux, Laure Gonnord:
Using Bounded Model Checking to Focus Fixpoint Iterations. CoRR abs/1106.2637 (2011) - [i12]David Monniaux, Martin Bodin:
Modular Abstractions of Reactive Nodes using Disjunctive Invariants. CoRR abs/1109.1905 (2011) - [i11]David Monniaux, Julien Le Guen:
Stratified Static Analysis Based on Variable Dependencies. CoRR abs/1109.2405 (2011) - 2010
- [j5]David Monniaux:
Automatic Modular Abstractions for Template Numerical Constraints. Log. Methods Comput. Sci. 6(3) (2010) - [c21]David Monniaux:
Quantifier Elimination by Lazy Model Enumeration. CAV 2010: 585-599
2000 – 2009
- 2009
- [b2]David Monniaux:
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). Joseph Fourier University, Grenoble, France, 2009 - [j4]David Monniaux:
A minimalistic look at widening operators. High. Order Symb. Comput. 22(2): 145-154 (2009) - [c20]David Monniaux:
On Using Floating-Point Computations to Help an Exact Linear Arithmetic Decision Procedure. CAV 2009: 570-583 - [c19]David Monniaux:
Automatic modular abstractions for linear constraints. POPL 2009: 140-151 - [i10]David Monniaux:
A minimalistic look at widening operators. CoRR abs/0902.3722 (2009) - [i9]David Monniaux:
On using floating-point computations to help an exact linear arithmetic decision procedure. CoRR abs/0904.3525 (2009) - [i8]David Monniaux:
Automatic modular abstractions for template numerical constraints. CoRR abs/0909.4013 (2009) - 2008
- [j3]David Monniaux:
The pitfalls of verifying floating-point computations. ACM Trans. Program. Lang. Syst. 30(3): 12:1-12:41 (2008) - [c18]David Monniaux:
A Quantifier Elimination Algorithm for Linear Real Arithmetic. LPAR 2008: 243-257 - [i7]David Monniaux:
A Quantifier Elimination Algorithm for Linear Real Arithmetic. CoRR abs/0803.1575 (2008) - [i6]David Monniaux:
Automatic Modular Abstractions for Linear Constraints. CoRR abs/0811.0166 (2008) - 2007
- [c17]David Monniaux:
Verification of device drivers and intelligent controllers: a case study. EMSOFT 2007: 30-36 - [c16]David Monniaux:
Optimal Abstraction on Real-Valued Programs. SAS 2007: 104-120 - [c15]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 - [i5]David Monniaux:
Applying the Z-transform for the static analysis of floating-point numerical filters. CoRR abs/0706.0252 (2007) - [i4]David Monniaux:
The parallel implementation of the Astrée static analyzer. CoRR abs/cs/0701191 (2007) - [i3]David Monniaux:
The pitfalls of verifying floating-point computations. CoRR abs/cs/0701192 (2007) - [i2]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) - [i1]David Monniaux:
An Abstract Monte-Carlo Method for the Analysis of Probabilistic Programs. CoRR abs/cs/0701195 (2007) - 2006
- [c14]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
- [j2]David Monniaux:
Abstract interpretation of programs as Markov decision processes. Sci. Comput. Program. 58(1-2): 179-205 (2005) - [c13]David Monniaux:
The Parallel Implementation of the Astrée Static Analyzer. APLAS 2005: 86-96 - [c12]David Monniaux:
Compositional Analysis of Floating-Point Linear Numerical Filters. CAV 2005: 199-212 - [c11]Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné, David Monniaux, Xavier Rival:
The ASTREÉ Analyzer. ESOP 2005: 21-30 - 2003
- [j1]David Monniaux:
Abstracting cryptographic protocols with tree automata. Sci. Comput. Program. 47(2-3): 177-202 (2003) - [c10]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 - [c9]David Monniaux:
Abstract Interpretation of Programs as Markov Decision Processes. SAS 2003: 237-254 - [c8]David Monniaux:
Abstraction of Expectation Functions Using Gaussian Distributions. VMCAI 2003: 161-173 - 2002
- [c7]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
- [b1]David Monniaux:
Analysis of probabilistic programs by abstract interpretation. (Analyse de programmes probabilistes par interprétation abstraite). Paris Dauphine University, France, 2001 - [c6]David Monniaux:
Backwards Abstract Interpretation of Probabilistic Programs. ESOP 2001: 367-382 - [c5]David Monniaux:
An abstract Monte-Carlo method for the analysis of probabilistic programs. POPL 2001: 93-101 - [c4]David Monniaux:
An Abstract Analysis of the Probabilistic Termination of Programs. SAS 2001: 111-126 - 2000
- [c3]David Monniaux:
Abstract Interpretation of Probabilistic Semantics. SAS 2000: 322-339
1990 – 1999
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-12 02:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
