Follow
Laure Gonnord
Laure Gonnord
University of Lyon - LIP
Verified email at ens-lyon.fr - Homepage
Title
Cited by
Cited by
Year
Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs
C Alias, A Darte, P Feautrier, L Gonnord
International Static Analysis Symposium, 117-133, 2010
2102010
Combining widening and acceleration in linear relation analysis
L Gonnord, N Halbwachs
International Static Analysis Symposium, 144-160, 2006
1212006
Validation of memory accesses through symbolic analyses
H Nazaré, I Maffra, W Santos, L Barbosa, L Gonnord, FM Quintão Pereira
Proceedings of the 2014 ACM International Conference on Object Oriented …, 2014
492014
Using bounded model checking to focus fixpoint iterations
D Monniaux, L Gonnord
International Static Analysis Symposium, 369-385, 2011
442011
Accelerated invariant generation for C programs with Aspic and C2fsm
P Feautrier, L Gonnord
Electronic Notes in Theoretical Computer Science 267 (2), 3-13, 2010
412010
Some ways to reduce the space dimension in polyhedra computations
N Halbwachs, D Merchat, L Gonnord
Formal Methods in System Design 29 (1), 79-95, 2006
412006
Cell morphing: From array programs to array-free horn clauses
D Monniaux, L Gonnord
International Static Analysis Symposium, 361-382, 2016
372016
Accélération abstraite pour l’amélioration de la précision en Analyse des Relations Linéaires
L Gonnord
These de doctorat, Université Joseph Fourier, Grenoble 24, 2007
312007
Abstract acceleration in linear relation analysis
L Gonnord, P Schrammel
Science of Computer Programming 93, 125-153, 2014
292014
Synthesis of ranking functions using extremal counterexamples
L Gonnord, D Monniaux, G Radanne
ACM SIGPLAN Notices 50 (6), 608-618, 2015
282015
A generic tool for tracing executions back to a DSML’s operational semantics
B Combemale, L Gonnord, V Rusu
European Conference on Modelling Foundations and Applications, 35-51, 2011
282011
Static analysis of synchronous programs in signal for efficient design of multi-clocked embedded systems
A Gamatié, L Gonnord
ACM Sigplan Notices 46 (5), 71-80, 2011
222011
Symbolic range analysis of pointers
V Paisante, M Maalej, L Barbosa, L Gonnord, FMQ Pereira
2016 IEEE/ACM International Symposium on Code Generation and Optimization …, 2016
172016
Pointer disambiguation via strict inequalities
M Maalej, V Paisante, P Ramos, L Gonnord, FMQ Pereira
2017 IEEE/ACM International Symposium on Code Generation and Optimization …, 2017
152017
Enhancing the compilation of synchronous dataflow programs with a combined numerical-boolean abstraction
P Feautrier, A Gamatié, L Gonnord
152013
From discrete duration calculus to symbolic automata
L Gonnord, N Halbwachs, P Raymond
Electronic Notes in Theoretical Computer Science 153 (4), 3-18, 2006
142006
Quantity of resource properties expression and runtime assurance for embedded systems
L Gonnord, JP Babau
2009 IEEE/ACS International Conference on Computer Systems and Applications …, 2009
92009
Rank: A Tool to Check Program Termination and Computational Complexity.
C Alias, A Darte, P Feautrier, L Gonnord
ICST Workshops, 238, 2013
82013
Real-world loops are easy to predict: a case study
RE Rodrigues, P Alves, F Pereira, L Gonnord
Workshop on Software Termination (WST'14), 2014
62014
The ASPIC tool: Accelerated symbolic polyhedral invariant computation
L Gonnord
62009
The system can't perform the operation now. Try again later.
Articles 1–20