default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaure Gonnord
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2017
[b2]Laure Gonnord:
Contributions to program analysis: expressivity and scalability. ( Contributions aux analyses de programmes, expressivité, passage à l'échelle). Claude Bernard University Lyon 1, France, 2017- 2007
- [b1]Laure Gonnord:
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). Joseph Fourier University, Grenoble, France, 2007
Journal Articles
- 2024
- [j7]Thaïs Baudon, Carsten Fuhs, Laure Gonnord:
On Complexity Bounds and Confluence of Parallel Term Rewriting. Fundam. Informaticae 192(2): 121-166 (2024) - 2023
- [j6]Laure Gonnord
, Ludovic Henrio, Lionel Morel, Gabriel Radanne:
A Survey on Parallelism and Determinism. ACM Comput. Surv. 55(10): 210:1-210:28 (2023) - [j5]Thaïs Baudon, Gabriel Radanne, Laure Gonnord:
Bit-Stealing Made Legal: Compilation for Custom Memory Representations of Algebraic Data Types. Proc. ACM Program. Lang. 7(ICFP): 813-846 (2023) - 2018
- [j4]Maroua Maalej, Vitor Paisante, Fernando Magno Quintão Pereira, Laure Gonnord:
Combining range and inequality information for pointer disambiguation. Sci. Comput. Program. 152: 161-184 (2018) - 2014
- [j3]Laure Gonnord, Peter Schrammel:
Abstract acceleration in linear relation analysis. Sci. Comput. Program. 93: 125-153 (2014) - 2009
- [j2]Laure Gonnord, Jean-Philippe Babau:
Qinna: a component-based framework for runtime safe resource adaptation of embedded systems. Scalable Comput. Pract. Exp. 10(3) (2009) - 2006
- [j1]Nicolas Halbwachs, David Merchat, Laure Gonnord:
Some ways to reduce the space dimension in polyhedra computations. Formal Methods Syst. Des. 29(1): 79-95 (2006)
Conference and Workshop Papers
- 2024
- [c22]Sébastien Michelland, Christophe Deleuze, Laure Gonnord:
From Low-Level Fault Modeling (of a Pipeline Attack) to a Proven Hardening Scheme. CC 2024: 174-185 - 2022
- [c21]Thaïs Baudon, Carsten Fuhs, Laure Gonnord:
Analysing Parallel Complexity of Term Rewriting. LOPSTR 2022: 3-23 - 2021
- [c20]Paul Iannetta, Laure Gonnord, Gabriel Radanne:
Compiling pattern matching to in-place modifications. GPCE 2021: 123-129 - [c19]Julien Braine, Laure Gonnord, David Monniaux:
Data Abstraction: A General Framework to Handle Program Verification of Data Structures. SAS 2021: 215-235 - 2019
- [c18]Clément Ballabriga, Julien Forget, Laure Gonnord, Giuseppe Lipari, Jordy Ruiz:
Static Analysis of Binary Code with Memory Indirections Using Polyhedra. VMCAI 2019: 114-135 - 2018
- [c17]Laure Gonnord, Sébastien Mosser:
Practicing domain-specific languages: from code to models. MoDELS (Companion) 2018: 106-113 - [c16]Romain Fontaine, Laure Gonnord, Lionel Morel:
Polyhedral Dataflow Programming: A Case Study. SBAC-PAD 2018: 171-179 - 2017
- [c15]Maroua Maalej, Vitor Paisante, Pedro Ramos, Laure Gonnord, Fernando Magno Quintão Pereira:
Pointer disambiguation via strict inequalities. CGO 2017: 134-147 - 2016
- [c14]Vitor Paisante, Maroua Maalej, Leonardo Barbosa e Oliveira, Laure Gonnord, Fernando Magno Quintão Pereira:
Symbolic range analysis of pointers. CGO 2016: 171-181 - [c13]David Monniaux, Laure Gonnord:
Cell Morphing: From Array Programs to Array-Free Horn Clauses. SAS 2016: 361-382 - 2015
- [c12]Laure Gonnord, David Monniaux, Gabriel Radanne:
Synthesis of ranking functions using extremal counterexamples. PLDI 2015: 608-618 - 2014
- [c11]Henrique Nazaré, Izabela Maffra, Willer Santos, Leonardo Barbosa e Oliveira, Laure Gonnord, Fernando Magno Quintão Pereira:
Validation of memory accesses through symbolic analyses. OOPSLA 2014: 791-809 - 2013
- [c10]Christophe Alias, Alain Darte, Paul Feautrier, Laure Gonnord:
Rank: A Tool to Check Program Termination and Computational Complexity. ICST Workshops 2013: 238 - 2011
- [c9]Benoît Combemale, Laure Gonnord, Vlad Rusu:
A Generic Tool for Tracing Executions Back to a DSML's Operational Semantics. ECMFA 2011: 35-51 - [c8]Abdoulaye Gamatié, Laure Gonnord:
Static analysis of synchronous programs in signal for efficient design of multi-clocked embedded systems. LCTES 2011: 71-80 - [c7]David Monniaux, Laure Gonnord:
Using Bounded Model Checking to Focus Fixpoint Iterations. SAS 2011: 369-385 - 2010
- [c6]Christophe Alias, Alain Darte, Paul Feautrier, Laure Gonnord:
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs. SAS 2010: 117-133 - [c5]Paul Feautrier, Laure Gonnord:
Accelerated Invariant Generation for C Programs with Aspic and C2fsm. TAPAS@SAS 2010: 3-13 - 2009
- [c4]Laure Gonnord, Jean-Philippe Babau:
Quantity of resource properties expression and runtime assurance for embedded systems. AICCSA 2009: 428-435 - 2008
- [c3]Laure Gonnord, Jean-Philippe Babau:
Runtime resource assurance and adaptation with Qinna framework: A case study. IMCSIT 2008: 617-624 - 2006
- [c2]Laure Gonnord, Nicolas Halbwachs:
Combining Widening and Acceleration in Linear Relation Analysis. SAS 2006: 144-160 - 2004
- [c1]Laure Gonnord, Nicolas Halbwachs, Pascal Raymond:
From Discrete Duration Calculus to Symbolic Automata. SLAP@ETAPS 2004: 3-18
Editorship
- 2022
- [e3]Laure Gonnord, Laura Titolo:
SOAP '22: 11th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis, San Diego, CA, USA, 14 June 2022. ACM 2022, ISBN 978-1-4503-9274-7 [contents] - 2020
- [e2]Emil Sekerinski, Nelma Moreira, José N. Oliveira, Daniel Ratiu, Riccardo Guidotti, Marie Farrell, Matt Luckcuck, Diego Marmsoler, José Creissac Campos, Troy Astarte, Laure Gonnord, Antonio Cerone, Luis Couto, Brijesh Dongol, Martin Kutrib, Pedro Monteiro, David Delmas:
Formal Methods. FM 2019 International Workshops - Porto, Portugal, October 7-11, 2019, Revised Selected Papers, Part I. Lecture Notes in Computer Science 12232, Springer 2020, ISBN 978-3-030-54993-0 [contents] - [e1]Emil Sekerinski, Nelma Moreira, José N. Oliveira, Daniel Ratiu, Riccardo Guidotti, Marie Farrell, Matt Luckcuck, Diego Marmsoler, José Creissac Campos, Troy Astarte, Laure Gonnord, Antonio Cerone, Luis Couto, Brijesh Dongol, Martin Kutrib, Pedro Monteiro, David Delmas:
Formal Methods. FM 2019 International Workshops - Porto, Portugal, October 7-11, 2019, Revised Selected Papers, Part II. Lecture Notes in Computer Science 12233, Springer 2020, ISBN 978-3-030-54996-1 [contents]
Informal and Other Publications
- 2023
- [i5]Thaïs Baudon, Carsten Fuhs, Laure Gonnord:
On Complexity Bounds and Confluence of Parallel Term Rewriting. CoRR abs/2305.18250 (2023) - 2022
- [i4]Thaïs Baudon, Carsten Fuhs, Laure Gonnord:
Analysing Parallel Complexity of Term Rewriting. CoRR abs/2208.01005 (2022) - [i3]Laure Gonnord, Ludovic Henrio, Lionel Morel, Gabriel Radanne:
A Survey on Parallelism and Determinism. CoRR abs/2210.15202 (2022) - 2015
- [i2]David Monniaux, Laure Gonnord:
An encoding of array verification problems into array-free Horn clauses. CoRR abs/1509.09092 (2015) - 2011
- [i1]David Monniaux, Laure Gonnord:
Using Bounded Model Checking to Focus Fixpoint Iterations. CoRR abs/1106.2637 (2011)
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-10-04 20:58 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:
