From Discrete Duration Calculus to Symbolic Automata. - Laure Gonnord; Nicolas Halbwachs; Pascal Raymond (SLAP@ETAPS, 2004)

Combining Widening and Acceleration in Linear Relation Analysis. - Laure Gonnord; Nicolas Halbwachs (SAS, 2006)

Some ways to reduce the space dimension in polyhedra computations. - Nicolas Halbwachs; David Merchat; Laure Gonnord (Formal Methods Syst. Des., 2006)

Accélération abstraite pour l'amélioration de la précision en Analyse des Relations Linéaires. (Abstract Acceleration to improve precision in Linear Relation Analysis). - Laure Gonnord (2007)

Runtime resource assurance and adaptation with Qinna framework: A case study. - Laure Gonnord; Jean-Philippe Babau (IMCSIT, 2008)

Quantity of resource properties expression and runtime assurance for embedded systems. - Laure Gonnord; Jean-Philippe Babau (AICCSA, 2009)

Qinna: a component-based framework for runtime safe resource adaptation of embedded systems. - Laure Gonnord; Jean-Philippe Babau (Scalable Comput. Pract. Exp., 2009)

Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs. - Christophe Alias; Alain Darte; Paul Feautrier; Laure Gonnord (SAS, 2010)

Accelerated Invariant Generation for C Programs with Aspic and C2fsm. - Paul Feautrier; Laure Gonnord (TAPAS@SAS, 2010)

A Generic Tool for Tracing Executions Back to a DSML's Operational Semantics. - Benoît Combemale; Laure Gonnord; Vlad Rusu (ECMFA, 2011)

Static analysis of synchronous programs in signal for efficient design of multi-clocked embedded systems. - Abdoulaye Gamatié; Laure Gonnord (LCTES, 2011)

Using Bounded Model Checking to Focus Fixpoint Iterations. - David Monniaux; Laure Gonnord (SAS, 2011)

Rank: A Tool to Check Program Termination and Computational Complexity. - Christophe Alias; Alain Darte; Paul Feautrier; Laure Gonnord (ICST Workshops, 2013)

Validation of memory accesses through symbolic analyses. - Henrique Nazaré; Izabela Maffra; Willer Santos; Leonardo Barbosa e Oliveira; Laure Gonnord; Fernando Magno Quintão Pereira (OOPSLA, 2014)

Abstract acceleration in linear relation analysis. - Laure Gonnord; Peter Schrammel (Sci. Comput. Program., 2014)

Synthesis of ranking functions using extremal counterexamples. - Laure Gonnord; David Monniaux; Gabriel Radanne (PLDI, 2015)

An encoding of array verification problems into array-free Horn clauses. - David Monniaux; Laure Gonnord (CoRR, 2015)

Symbolic range analysis of pointers. - Vitor Paisante; Maroua Maalej; Leonardo Barbosa e Oliveira; Laure Gonnord; Fernando Magno Quintão Pereira (CGO, 2016)

Cell Morphing: From Array Programs to Array-Free Horn Clauses. - David Monniaux; Laure Gonnord (SAS, 2016)

Contributions to program analysis: expressivity and scalability. ( Contributions aux analyses de programmes, expressivité, passage à l'échelle). - Laure Gonnord (2017)

Pointer disambiguation via strict inequalities. - Maroua Maalej; Vitor Paisante; Pedro Ramos; Laure Gonnord; Fernando Magno Quintão Pereira (CGO, 2017)

Practicing domain-specific languages: from code to models. - Laure Gonnord; Sébastien Mosser 001 (MoDELS (Companion), 2018)

Polyhedral Dataflow Programming: A Case Study. - Romain Fontaine; Laure Gonnord; Lionel Morel (SBAC-PAD, 2018)

Combining range and inequality information for pointer disambiguation. - Maroua Maalej; Vitor Paisante; Fernando Magno Quintão Pereira; Laure Gonnord (Sci. Comput. Program., 2018)

Static Analysis of Binary Code with Memory Indirections Using Polyhedra. - Clément Ballabriga; Julien Forget; Laure Gonnord; Giuseppe Lipari; Jordy Ruiz (VMCAI, 2019)

Proving array properties using data abstraction. - Julien Braine; Laure Gonnord (NSAD@SAS, 2020)

Compiling pattern matching to in-place modifications. - Paul Iannetta; Laure Gonnord; Gabriel Radanne (GPCE, 2021)

Data Abstraction: A General Framework to Handle Program Verification of Data Structures. - Julien Braine; Laure Gonnord; David Monniaux (SAS, 2021)

Analysing Parallel Complexity of Term Rewriting. - Thaïs Baudon; Carsten Fuhs; Laure Gonnord (LOPSTR, 2022)

A Survey on Parallelism and Determinism. - Laure Gonnord; Ludovic Henrio; Lionel Morel; Gabriel Radanne (ACM Comput. Surv., 2023)

Bit-Stealing Made Legal: Compilation for Custom Memory Representations of Algebraic Data Types. - Thaïs Baudon; Gabriel Radanne; Laure Gonnord (Proc. ACM Program. Lang., 2023)

From Low-Level Fault Modeling (of a Pipeline Attack) to a Proven Hardening Scheme. - Sébastien Michelland; Christophe Deleuze; Laure Gonnord (CC, 2024)

On Complexity Bounds and Confluence of Parallel Term Rewriting. - Thaïs Baudon; Carsten Fuhs; Laure Gonnord (Fundam. Informaticae, 2024)

Abstract Interpreters: A Monadic Approach to Modular Verification. - Sébastien Michelland; Yannick Zakowski; Laure Gonnord (Proc. ACM Program. Lang., 2024)

Proof Assistants for Teaching: a Survey. - Frédéric Tran Minh; Laure Gonnord; Julien Narboux (ThEdu@CADE, 2024)