David Monniaux

David Monniaux est directeur de recherche au CNRS, directeur du laboratoire Verimag (CNRS, Université Grenoble Alpes, Grenoble-INP).

Documents

Affiliations actuelles

1043148
1095810

Identifiants chercheurs

david-monniaux
IdRef : 070681600
0000-0001-7671-6126

Site web

https://www-verimag.imag.fr/~monniaux/

Présentation

Publications

	Pragmatics of Formally Verified Yet Efficient Static Analysis, in particular for Formally Verified Compilers David Monniaux International Journal on Software Tools for Technology Transfer, 2024, 26 (4), pp.463-477. ⟨10.1007/s10009-024-00760-3⟩ Article dans une revue hal-04643135v1
	Formally Verifying Optimizations with Block Simulations Léo Gourdin , Benjamin Bonneau , Sylvain Boulmé , David Monniaux , Alexandre Bérard Proceedings of the ACM on Programming Languages, 2023, 7 (OOPSLA2), pp.59-88. ⟨10.1145/3622799⟩ Article dans une revue hal-04102940v3
	Formally Verified Loop-Invariant Code Motion and Assorted Optimizations David Monniaux , Cyril Six ACM Transactions on Embedded Computing Systems (TECS), 2022, 22 (1), pp.#3 1-27. ⟨10.1145/3529507⟩ Article dans une revue hal-03628646v1
	The complexity gap in the static analysis of cache accesses grows if procedure calls are added David Monniaux Formal Methods in System Design, 2022, 59 (1-3), pp.1-20. ⟨10.1007/s10703-022-00392-w⟩ Article dans une revue hal-03545774v1
	A task-based approach to parallel parametric linear programming solving, and application to polyhedral computations Camille Coti , David Monniaux , Hang Yu Concurrency and Computation: Practice and Experience, 2021, 33 (6), pp.e6050. ⟨10.1002/cpe.6050⟩ Article dans une revue hal-02951016v1
	Certified and efficient instruction scheduling. Application to interlocked VLIW processors. Cyril Six , Sylvain Boulmé , David Monniaux Proceedings of the ACM on Programming Languages, 2020, OOPSLA 2020, pp.129. ⟨10.1145/3428197⟩ Article dans une revue hal-02185883v3
	On the complexity of cache analysis for different replacement policies David Monniaux , Valentin Touzeau Journal of the ACM (JACM), 2019, 66 (6), pp.41. ⟨10.1145/3366018⟩ Article dans une revue hal-01910216v3
	Fast and exact analysis for LRU caches Claire Maïza , Valentin Touzeau , David Monniaux , Jan Reineke Proceedings of the ACM on Programming Languages, 2019, 3 (POPL), pp.#54. ⟨10.1145/3290367⟩ Article dans une revue hal-01908648v2
	On the decidability of the existence of polyhedral invariants in transition systems David Monniaux Acta Informatica, 2019, 56 (4), pp.385-389. ⟨10.1007/s00236-018-0324-y⟩ Article dans une revue hal-01587125v2
	De la surveillance secrète à la prédiction des risques : les dérives du fichage dans le champ de la lutte contre le terrorisme Virginie Gautron , David Monniaux Archives de politique criminelle, 2016, Terrorismes, 38, pp.123-135. ⟨10.3917/apc.038.0123⟩ Article dans une revue hal-01446359v1
	Implementing and reasoning about hash-consed data structures in Coq Thomas Braibant , Jacques-Henri Jourdan , David Monniaux Journal of Automated Reasoning, 2014, 53 (3), pp.271-304. ⟨10.1007/s10817-014-9306-0⟩ Article dans une revue hal-00881085v4
	Initiation à la calculabilité David Monniaux Quadrature, 2012, 86, pp.17-28 Article dans une revue hal-01446372v1
	Stratified Static Analysis Based on Variable Dependencies David Monniaux , Julien Le Guen Electronic Notes in Theoretical Computer Science, 2012, Proceedings of the Third International Workshop on Numerical and Symbolic Abstract Domains, NSAD 2011, 288, pp.61-74. ⟨10.1016/j.entcs.2012.10.008⟩ Article dans une revue hal-00622137v1
	Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs Thomas Martin Gawlitza , David Monniaux Logical Methods in Computer Science, 2012, Volume 8, Issue 3, ⟨10.2168/LMCS-8(3:29)2012⟩ Article dans une revue hal-04597246v1
	Automatic modular abstractions for template numerical constraints David Monniaux Logical Methods in Computer Science, 2010, 6 (3), pp.4. ⟨10.2168/LMCS-6(3:4)2010⟩ Article dans une revue hal-00418992v2
	A minimalistic look at widening operators David Monniaux Higher-Order and Symbolic Computation, 2009, 22 (2), pp.145-154. ⟨10.1007/s10990-009-9046-8⟩ Article dans une revue hal-00363204v3
	The pitfalls of verifying floating-point computations David Monniaux ACM Transactions on Programming Languages and Systems (TOPLAS), 2008, 30 (3), pp.12. ⟨10.1145/1353445.1353446⟩ Article dans une revue hal-00128124v5
	Abstract interpretation of programs as Markov decision processes David Monniaux Science of Computer Programming, 2005, 58, pp.179-205. ⟨10.1016/j.scico.2005.02.008⟩ Article dans une revue hal-00084297v1

	Formally Verified Hardening of C Programs against Hardware Fault Injection Basile Pesin , Sylvain Boulmé , David Monniaux , Marie-Laure Potet 14th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP’25), Jan 2025, Denver (CO), United States. ⟨10.1145/3703595.3705880⟩ Communication dans un congrès hal-04818801v1
	Chamois: agile development of CompCert extensions for optimization and security David Monniaux , Sylvain Boulmé 35es Journées Francophones des Langages Applicatifs (JFLA 2024), Jan 2024, Saint-Jacut-de-la-Mer, France Communication dans un congrès hal-04406465v1
	Memory Simulations, Security and Optimization in a Verified Compiler David Monniaux Certified Programs and Proofs 2024, Brigitte Pientka; Sandrine Blazy; Amin Timany; Dmitriy Traytel, Jan 2024, London, United Kingdom. ⟨10.1145/3636501.3636952⟩ Communication dans un congrès hal-04336347v1
	Data Abstraction, Arrays, Maps, and Completeness, aka "Cell Morphing" David Monniaux 10th Workshop on Horn Clauses for Verification and Synthesis (HCVS), Apr 2023, Paris, France. ⟨10.4204/EPTCS.402⟩ Communication dans un congrès hal-04750127v1
	Testing a Formally Verified Compiler David Monniaux , Léo Gourdin , Sylvain Boulmé , Olivier Lebeltel Tests and Proofs (TAP 2023), Jul 2023, Leicester, United Kingdom. pp.40-48, ⟨10.1007/978-3-031-38828-6_3⟩ Communication dans un congrès hal-04096390v1
	Formally Verified Superblock Scheduling Cyril Six , Léo Gourdin , Sylvain Boulmé , David Monniaux , Justus Fasse Certified Programs and Proofs (CPP ’22), Jan 2022, Philadelphia, United States. pp.40-54, ⟨10.1145/3497775.3503679⟩ Communication dans un congrès hal-03200774v2
	Formally verified 32- and 64-bit integer division using double-precision floating-point arithmetic David Monniaux , Alice Pain 2022 IEEE 29th Symposium on Computer Arithmetic (ARITH), Sep 2022, Lyon, France. pp.128-132, ⟨10.1109/ARITH54963.2022.00032⟩ Communication dans un congrès hal-03722203v1
	BAXMC: a CEGAR approach to Max#SAT Thomas Vigouroux , Cristian Ene , David Monniaux , Laurent Mounier , Marie-Laure Potet FMCAD 2022, Oct 2022, Trente, Italy. ⟨10.34727/2022/isbn.978-3-85448-053-2⟩ Communication dans un congrès hal-03773005v2
	The Trusted Computing Base of the CompCert Verified Compiler David Monniaux , Sylvain Boulmé Programming Languages and Systems (ESOP 2022), Apr 2022, Munich, Germany. pp.204-233, ⟨10.1007/978-3-030-99336-8_8⟩ Communication dans un congrès hal-03541595v2
	Data Abstraction: A General Framework to Handle Program Verification of Data Structures Julien Braine , Laure Gonnord , David Monniaux SAS 2021 - 28th Static Analysis Symposium, Oct 2021, Chicago, United States. pp.215-235, ⟨10.1007/978-3-030-88806-0_11⟩ Communication dans un congrès hal-03321868v1
	Simple, Light, Yet Formally Verified, Global Common Subexpression Elimination and Loop-Invariant Code Motion David Monniaux , Cyril Six Languages, Compilers, Tools and Theory of Embedded Systems (LCTES), ACM, Jun 2021, online, Canada. pp.85-96, ⟨10.1145/3461648.3463850⟩ Communication dans un congrès hal-03212087v1
	Computing over convex polyhedra using VPL David Monniaux 6th International Workshop on Symbolic-Numeric Methods for Reasoning about CPS and IoT (SNR), Aug 2020, Vienna (virtual), Austria Communication dans un congrès hal-04750244v1
	An Efficient Parametric Linear Programming Solver and Application to Polyhedral Projection Hang Yu , David Monniaux Static Analysis (SAS 2019), Oct 2019, Porto, Portugal. pp.203-224, ⟨10.1007/978-3-030-32304-2_11⟩ Communication dans un congrès hal-02362102v1
	Parallel parametric linear programming solving, and application to polyhedral computations Camille Coti , David Monniaux , Hang Yu International conference on computational science, Jun 2019, Faro, Portugal. pp.566-572, ⟨10.1007/978-3-030-22750-0_52⟩ Communication dans un congrès hal-02097321v1
	The Verified Polyhedron Library: an overview Sylvain Boulmé , Alexandre Maréchal , David Monniaux , Michaël Périn , Hang Yu 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), Universitatea de Vest din Timișoara, Sep 2018, Timișoara, Romania. pp.9-17, ⟨10.1109/SYNASC.2018.00014⟩ Communication dans un congrès hal-02100006v1
	Extending Constraint-Only Representation of Polyhedra with Boolean Constraints Alexey Bakhirkin , David Monniaux 25th Static Analysis Symposium (SAS 2018), Aug 2018, Freiburg im Breisgau, Germany. pp.127-145, ⟨10.1007/978-3-319-99725-4_10⟩ Communication dans un congrès hal-01841837v2
	Combining Forward and Backward Abstract Interpretation of Horn Clauses Alexey Bakhirkin , David Monniaux 24th International Static Analysis Symposium (SAS), Francesco Ranzato; Patrick Cousot, Aug 2017, New York City, United States. ⟨10.1007/978-3-319-66706-5_2⟩ Communication dans un congrès hal-01551447v2
	Ascertaining Uncertainty for Efficient Exact Cache Analysis Claire Maïza , Valentin Touzeau , David Monniaux , Jan Reineke Computer Aided Verification - 29th International Conference, Rupak Majumdar; Viktor Kuncak, Jul 2017, Heidelberg, France. pp.20 - 40, ⟨10.1007/978-3-319-63390-9_2⟩ Communication dans un congrès hal-01592048v2
	Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming Alexandre Maréchal , David Monniaux , Michaël Périn Static Analysis Symposium (SAS), Francesco Ranzato, Aug 2017, New York, United States Communication dans un congrès hal-01555998v1
	Cell morphing: from array programs to array-free Horn clauses David Monniaux , Laure Gonnord 23rd Static Analysis Symposium (SAS 2016), Sep 2016, Edimbourg, United Kingdom. pp.361-382, ⟨10.1007/978-3-662-53413-7_18⟩ Communication dans un congrès hal-01206882v3
	Model Checking of Cache for WCET Analysis Refinement Valentin Touzeau , Claire Maïza , David Monniaux 10th Junior Researcher Workshop on Real-Time Computing, Oct 2016, Brest, France Communication dans un congrès hal-01447930v2
	A Survey of Satisfiability Modulo Theory David Monniaux Computer Algebra in Scientific Computing, Sep 2016, Bucharest, Romania. ⟨10.1007/978-3-319-45641-6_26⟩ Communication dans un congrès hal-01332051v1
	Program Analysis with Local Policy Iteration Egor George Karpenkov , David Monniaux , Wendler Philipp Verification, Model Checking, and Abstract Interpretation (VMCAI), Jan 2016, Saint Petersburg, Florida, United States. pp.127-146, ⟨10.1007/978-3-662-49122-5_6⟩ Communication dans un congrès hal-01255314v1
	Polyhedral Approximation of Multivariate Polynomials using Handelman's Theorem Alexandre Maréchal , Alexis Fouilhé , Tim King , David Monniaux , Michaël Périn International Conference on Verification, Model Checking, and Abstract Interpretation 2016, Barbara Jobstmann; Rustan Leino, Jan 2016, St. Petersburg, United States. ⟨10.1007/978-3-662-49122-5_8⟩ Communication dans un congrès hal-01223362v1
	Formula Slicing: Inductive Invariants from Preconditions Egor George Karpenkov , David Monniaux 12th International Haifa Verification Conference (HVC), Nov 2016, Haifa, Israel. pp.169-185, ⟨10.1007/978-3-319-49052-6_11⟩ Communication dans un congrès hal-01446354v1
	A simple abstraction of arrays and maps by program translation David Monniaux , Francesco Alberti 22nd International Static Analysis Symposium (SAS), Sep 2015, Saint-Malo, France. pp.217-234, ⟨10.1007/978-3-662-48288-9_13⟩ Communication dans un congrès hal-01162795v1
	Polyhedra to the rescue of array interpolants Francesco Alberti , David Monniaux ACM/SIGAPP Symposium On Applied Computing, Apr 2015, Salamanca, Spain. pp.1745-1750, ⟨10.1145/2695664.2695784⟩ Communication dans un congrès hal-01178600v1
	Synthesis of ranking functions using extremal counterexamples Laure Gonnord , David Monniaux , Gabriel Radanne Programming Languages, Design and Implementation, Jun 2015, Portland, Oregon, United States. ⟨10.1145/2737924.2737976⟩ Communication dans un congrès hal-01144622v1
	How to Compute Worst-Case Execution Time by Optimization Modulo Theory and a Clever Encoding of Program Semantics Julien Henry , Mihail Asavoae , David Monniaux , Claire Maïza ACM SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems 2014, Jun 2014, Edimbourg, United Kingdom. pp.1-10 Communication dans un congrès hal-00998138v1
	Speeding Up Logico-Numerical Strategy Iteration David Monniaux , Peter Schrammel Static analysis, Sep 2014, Munich, Germany. pp.253-267, ⟨10.1007/978-3-319-10936-7_16⟩ Communication dans un congrès hal-04597249v1
	Implementing hash-consed structures in Coq Thomas Braibant , Jacques-Henri Jourdan , David Monniaux Interactive Theorem Proving, 4th international conference, Jul 2013, Rennes, France. pp.477-483, ⟨10.1007/978-3-642-39634-2_36⟩ Communication dans un congrès hal-00816672v1
	Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra Alexis Fouilhé , David Monniaux , Michaël Périn 20th static analysis symposium (SAS), Jun 2013, Seattle, Washington, United States. pp.345-365, ⟨10.1007/978-3-642-38856-9_19⟩ Communication dans un congrès hal-00806990v1
	Experiments on the feasibility of using a floating-point simplex in an SMT solver Diego Caminha Barbosa de Oliveira , David Monniaux PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning, Jun 2012, Manchester, United Kingdom. pp.19-28, ⟨10.29007/j7x4⟩ Communication dans un congrès hal-04597240v1
	Anatomy of Alternating Quantifier Satisfiability (Work in progress) Anh-Dung Phan , Nikolaj Bjørner , David Monniaux 10th International Workshop on Satisfiability Modulo Theories, Jun 2012, Manchester, United Kingdom. pp.6, ⟨10.29007/8cf7⟩ Communication dans un congrès hal-00716323v1
	PAGAI: a path sensitive static analyzer Julien Henry , David Monniaux , Matthieu Moy Tools for Automatic Program AnalysiS (TAPAS 2012), Sep 2012, Deauville, France. pp.3, ⟨10.1016/j.entcs.2012.11.003⟩ Communication dans un congrès hal-00718438v1
	Succinct Representations for Abstract Interpretation Julien Henry , David Monniaux , Matthieu Moy Static analysis symposium (SAS), Sep 2012, Deauville, France. pp.283-299, ⟨10.1007/978-3-642-33125-1_20⟩ Communication dans un congrès hal-00709833v1
	Improving Strategies via SMT Solving Thomas Martin Gawlitza , David Monniaux European symposium on programming (ESOP 2011), Mar 2011, Saarbrücken, Germany. pp.236-255, ⟨10.1007/978-3-642-19718-5_13⟩ Communication dans un congrès hal-00555795v1
	Using Bounded Model Checking to Focus Fixpoint Iterations David Monniaux , Laure Gonnord Static analysis symposium (SAS), Sep 2011, Venezia, Italy. pp.369-385, ⟨10.1007/978-3-642-23702-7_27⟩ Communication dans un congrès hal-00600087v1
	Modular Abstractions of Reactive Nodes using Disjunctive Invariants David Monniaux , Martin Bodin Asian symposium on programming languages and systems (APLAS), Dec 2011, Kenting, Taiwan. pp.19-33, ⟨10.1007/978-3-642-25318-8_5⟩ Communication dans un congrès hal-00620682v1
	On the Generation of Positivstellensatz Witnesses in Degenerate Cases David Monniaux , Pierre Corbineau Interactive Theorem Proving, Aug 2011, Nijmegen, Netherlands. pp.249-264, ⟨10.1007/978-3-642-22863-6_19⟩ Communication dans un congrès hal-00594761v1
	Quantifier elimination by lazy model enumeration David Monniaux CAV 2010, Jul 2010, Edimburgh, United Kingdom. pp.585-599, ⟨10.1007/978-3-642-14295-6_51⟩ Communication dans un congrès hal-00472831v2
	Automatic Modular Abstractions for Linear Constraints David Monniaux POPL 2009, 36th annual ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, Jan 2009, Savannah, Georgia, United States. pp.140-151, ⟨10.1145/1594834.1480899⟩ Communication dans un congrès hal-00336144v1
	On using floating-point computations to help an exact linear arithmetic decision procedure David Monniaux Computer-aided verification (CAV 2009), Jun 2009, Grenoble, France. pp.570-583, ⟨10.1007/978-3-642-02658-4_42⟩ Communication dans un congrès hal-00354112v2
	A Quantifier Elimination Algorithm for Linear Real Arithmetic David Monniaux LPAR ( Logic for Programming, Artificial Intelligence, and Reasoning), Nov 2008, Doha, Qatar. pp.243-257, ⟨10.1007/978-3-540-89439-1_18⟩ Communication dans un congrès hal-00262312v2
	Optimal abstraction on real-valued programs David Monniaux 14th International Static Analysis Symposium (SAS 2007), 2007, Kongens Lyngby, Denmark. pp.104-120, ⟨10.1007/978-3-540-74061-2_7⟩ Communication dans un congrès hal-00148608v1
	Verification of Device Drivers and Intelligent Controllers: a Case Study David Monniaux International Conference On Embedded Software (EMSOFT), Sep 2007, Salzburg, Austria. pp.30 - 36, ⟨10.1145/1289927.1289937⟩ Communication dans un congrès hal-00158869v1
	Varieties of Static Analyzers: A Comparison with ASTRÉE Patrick Cousot , Radhia Cousot , Jerôme Feret , Laurent Mauborgne , Antoine Miné First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07), Jun 2007, Shanghai, China. pp.3-20, ⟨10.1109/TASE.2007.55⟩ Communication dans un congrès hal-00154031v1
	Combination of Abstractions in the ASTRÉE Static Analyzer Patrick Cousot , Radhia Cousot , Jérôme Feret , Laurent Mauborgne , Antoine Miné the 11th Annual Asian Computing Science Conference - ASIAN'06, Okada, Mitsu and Satoh, Ichir, Dec 2006, Tokyo, Japan. pp.272-300, ⟨10.1007/978-3-540-77505-8_23⟩ Communication dans un congrès inria-00528571v1
	The parallel implementation of the Astrée static analyzer David Monniaux 2005, pp.86-96, ⟨10.1007/11575467_7⟩ Communication dans un congrès hal-00128097v1
	Compositional analysis of floating-point linear numerical filters David Monniaux 2005, pp.199, ⟨10.1007/11513988_21⟩ Communication dans un congrès hal-00084291v1
	The ASTRÉE analyzer Patrick Cousot , Radhia Cousot , Jerôme Feret , Laurent Mauborgne , Antoine Miné 2005, pp.21, ⟨10.1007/b107380⟩ Communication dans un congrès hal-00084293v1
	A Static Analyzer for Large Safety-Critical Software Bruno Blanchet , Patrick Cousot , Radhia Cousot , Jerôme Feret , Laurent Mauborgne 2003, pp.196 - 207, ⟨10.1145/781131.781153⟩ Communication dans un congrès hal-00128135v1
	An Abstract Monte-Carlo Method for the Analysis of Probabilistic Programs David Monniaux 2001, pp.93 - 101, ⟨10.1145/360204.360211⟩ Communication dans un congrès hal-00128138v1

	Formally Verified Advanced Optimizations for RISC-V David Monniaux , Sylvain Boulmé , Léo Gourdin RISC-V Summit Europe 2023, Jun 2023, Barcelona, Spain Poster de conférence hal-04748961v1

	Completeness in static analysis by abstract interpretation, a personal point of view David Monniaux Vincenzo Arceri; Agostino Cortesi; Pietro Ferrara; Martina Olliaro. Challenges of Software Verification, 238, Springer Nature Singapore, pp.93-108, 2023, Intelligent Systems Reference Library, 978-981-19-9600-9. ⟨10.1007/978-981-19-9601-6_6⟩ Chapitre d'ouvrage hal-03857312v2
	Il faut se défier de la « pensée magique » David Monniaux Gilles Rouet. Algorithmes et décisions publiques, CNRS Éditions, 2019, 978-2-271-12466-1. ⟨10.4000/books.editionscnrs.46122⟩ Chapitre d'ouvrage hal-02043272v1
	Design and Implementation of a Special-Purpose Static Program Analyzer for Safety-Critical Real-Time Embedded Software Bruno Blanchet , Patrick Cousot , Radhia Cousot , Jérôme Feret , Laurent Mauborgne Mogensen, T. and Schmidt, D.A. and Sudborough, I.H. The Essence of Computation: Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones, 2566, Springer, pp.85-108, 2002, Lecture Notes in Computer Science, ⟨10.1007/3-540-36377-7_5⟩ Chapitre d'ouvrage inria-00528442v1

	Les arcanes des processeurs mis à l'épreuve David Monniaux , Clémentine Maurice 2024 Autre publication scientifique hal-04643335v1

	NP #P = ∃PP and other remarks about maximized counting David Monniaux 2022 Pré-publication, Document de travail hal-03586193v1
	On using sums-of-squares for exact computations without strict feasibility David Monniaux 2010 Pré-publication, Document de travail hal-00487279v1
	On computing invariants for predicate abstraction by SAT-solving David Monniaux 2009 Pré-publication, Document de travail hal-00357118v1
	Fatal Degeneracy in the Semidefinite Programming Approach to the Decision of Polynomial Inequalities David Monniaux 2009 Pré-publication, Document de travail hal-00357358v1
	Applying the Z-transform for the static analysis of floating-point numerical filters David Monniaux 2005 Pré-publication, Document de travail hal-00151251v1

	Data Abstraction: A General Framework to Handle Program Verification of Data Structures Julien Braine , Laure Gonnord , David Monniaux [Research Report] RR-9408, Inria Grenoble Rhône-Alpes; VERIMAG UMR 5104, Université Grenoble Alpes, France; LIP - Laboratoire de l’Informatique du Parallélisme; Université Lyon 1 - Claude Bernard; ENS Lyon. 2021, pp.1-29 Rapport hal-03214475v2
	Verifying Programs with Arrays and Lists Julien Braine , Laure Gonnord , David Monniaux [Internship report] ENS Lyon. 2016 Rapport hal-01337140v1

	Analysis of probabilistic programs by abstract interpretation David Monniaux Software Engineering [cs.SE]. Université Paris Dauphine - Paris IX, 2001. English. ⟨NNT : ⟩ Thèse tel-00084287v1

	Analyse statique : de la théorie à la pratique ; analyse statique de code embarqué de grande taille, génération de domaines abstraits David Monniaux Génie logiciel [cs.SE]. Université Joseph-Fourier - Grenoble I, 2009 HDR tel-00397108v1

	Flavors of abstract interpretation David Monniaux École thématique. European joint conferences on theory and practice of software - Invited tutorial, Luxembourg, Luxembourg. 2024 Cours hal-04750222v1
	Trop d’algorithmes tue l’algorithme ? David Monniaux École d'ingénieur. Vaulx en Velin, France. 2022 Cours hal-04827975v1
	Verified compilation: the case of CompCert David Monniaux Doctoral. En ligne, Russia. 2022 Cours hal-04828059v1
	Formal methods: abstract interpretation & verified compilation David Monniaux Engineering school. Le Kremlin-Bicêtre, France. 2022 Cours hal-04827997v1

	Chamois David Monniaux , Sylvain Boulmé , Léo Gourdin , Alexandre Bérard , Justus Fasse 2024, ⟨swh:1:dir:3d6edc4eb44188275528710f67e46d711a55f3d9;origin=https://hal.archives-ouvertes.fr/hal-04749015;visit=swh:1:snp:a99f137fe7e250d0df845a6370a663212effeacf;anchor=swh:1:rel:40e9091218e645b81affcd664bd6813f95a2b1e3;path=/⟩ Logiciel hal-04749015v1
	BaxMC Thomas Vigouroux , Cristian Ene , David Monniaux , Laurent Mounier , Marie-Laure Potet 2022, ⟨swh:1:dir:c27fbd27ad4d26ff8f1ab8ca911349793f118f27;origin=https://hal.archives-ouvertes.fr/hal-04247158;visit=swh:1:snp:edf305d95bbf42bf523a70c51083e3a8258a8d2b;anchor=swh:1:rel:e1876e56dd5aece8a8665acb4ee643e1989804f5;path=/⟩ Logiciel hal-04247158v1

David Monniaux

Présentation

Publications

Pragmatics of Formally Verified Yet Efficient Static Analysis, in particular for Formally Verified Compilers

Formally Verifying Optimizations with Block Simulations

Formally Verified Loop-Invariant Code Motion and Assorted Optimizations

The complexity gap in the static analysis of cache accesses grows if procedure calls are added

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

Certified and efficient instruction scheduling. Application to interlocked VLIW processors.

On the complexity of cache analysis for different replacement policies

Fast and exact analysis for LRU caches

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

De la surveillance secrète à la prédiction des risques : les dérives du fichage dans le champ de la lutte contre le terrorisme

Implementing and reasoning about hash-consed data structures in Coq

Initiation à la calculabilité

Stratified Static Analysis Based on Variable Dependencies

Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs

Automatic modular abstractions for template numerical constraints

A minimalistic look at widening operators

The pitfalls of verifying floating-point computations

Abstract interpretation of programs as Markov decision processes

Formally Verified Hardening of C Programs against Hardware Fault Injection

Chamois: agile development of CompCert extensions for optimization and security

Memory Simulations, Security and Optimization in a Verified Compiler

Data Abstraction, Arrays, Maps, and Completeness, aka "Cell Morphing"

Testing a Formally Verified Compiler

Formally Verified Superblock Scheduling

Formally verified 32- and 64-bit integer division using double-precision floating-point arithmetic

BAXMC: a CEGAR approach to Max#SAT

The Trusted Computing Base of the CompCert Verified Compiler

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

Simple, Light, Yet Formally Verified, Global Common Subexpression Elimination and Loop-Invariant Code Motion

Computing over convex polyhedra using VPL

An Efficient Parametric Linear Programming Solver and Application to Polyhedral Projection

Parallel parametric linear programming solving, and application to polyhedral computations

The Verified Polyhedron Library: an overview

Extending Constraint-Only Representation of Polyhedra with Boolean Constraints

Combining Forward and Backward Abstract Interpretation of Horn Clauses

Ascertaining Uncertainty for Efficient Exact Cache Analysis

Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming

Cell morphing: from array programs to array-free Horn clauses

Model Checking of Cache for WCET Analysis Refinement

A Survey of Satisfiability Modulo Theory

Program Analysis with Local Policy Iteration

Polyhedral Approximation of Multivariate Polynomials using Handelman's Theorem

Formula Slicing: Inductive Invariants from Preconditions

A simple abstraction of arrays and maps by program translation

Polyhedra to the rescue of array interpolants

Synthesis of ranking functions using extremal counterexamples

How to Compute Worst-Case Execution Time by Optimization Modulo Theory and a Clever Encoding of Program Semantics

Speeding Up Logico-Numerical Strategy Iteration

Implementing hash-consed structures in Coq

Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra

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

Anatomy of Alternating Quantifier Satisfiability (Work in progress)

PAGAI: a path sensitive static analyzer

Succinct Representations for Abstract Interpretation

Improving Strategies via SMT Solving

Using Bounded Model Checking to Focus Fixpoint Iterations

Modular Abstractions of Reactive Nodes using Disjunctive Invariants

On the Generation of Positivstellensatz Witnesses in Degenerate Cases

Quantifier elimination by lazy model enumeration

Automatic Modular Abstractions for Linear Constraints

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

A Quantifier Elimination Algorithm for Linear Real Arithmetic

Optimal abstraction on real-valued programs

Verification of Device Drivers and Intelligent Controllers: a Case Study

Varieties of Static Analyzers: A Comparison with ASTRÉE

Combination of Abstractions in the ASTRÉE Static Analyzer

The parallel implementation of the Astrée static analyzer

Compositional analysis of floating-point linear numerical filters

The ASTRÉE analyzer

A Static Analyzer for Large Safety-Critical Software

An Abstract Monte-Carlo Method for the Analysis of Probabilistic Programs

Formally Verified Advanced Optimizations for RISC-V

Completeness in static analysis by abstract interpretation, a personal point of view

Il faut se défier de la « pensée magique »

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

Les arcanes des processeurs mis à l'épreuve

NP #P = ∃PP and other remarks about maximized counting