Laure Gonnord
Laure Gonnord
University of Lyon - LIP
E-mail confirmado em ens-lyon.fr - Página inicial
TítuloCitado porAno
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
1592010
Combining widening and acceleration in linear relation analysis
L Gonnord, N Halbwachs
International Static Analysis Symposium, 144-160, 2006
1052006
Using bounded model checking to focus fixpoint iterations
D Monniaux, L Gonnord
International Static Analysis Symposium, 369-385, 2011
412011
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
322006
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
302010
Validation of memory accesses through symbolic analyses
H Nazaré, I Maffra, W Santos, L Barbosa, L Gonnord, FM Quintão Pereira
ACM SIGPLAN Notices 49 (10), 791-809, 2014
292014
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
292007
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
232011
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
202011
Cell morphing: From array programs to array-free horn clauses
D Monniaux, L Gonnord
International Static Analysis Symposium, 361-382, 2016
192016
Abstract acceleration in linear relation analysis
L Gonnord, P Schrammel
Science of Computer Programming 93, 125-153, 2014
192014
Synthesis of ranking functions using extremal counterexamples
L Gonnord, D Monniaux, G Radanne
ACM SIGPLAN Notices 50 (6), 608-618, 2015
162015
Enhancing the compilation of synchronous dataflow programs with a combined numerical-boolean abstraction
P Feautrier, A Gamatié, L Gonnord
132013
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
122016
From discrete duration calculus to symbolic automata
L Gonnord, N Halbwachs, P Raymond
Electronic Notes in Theoretical Computer Science 153 (4), 3-18, 2006
122006
Pointer disambiguation via strict inequalities
M Maalej, V Paisante, P Ramos, L Gonnord, FMQ Pereira
Proceedings of the 2017 International Symposium on Code Generation and …, 2017
112017
Rank: A Tool to Check Program Termination and Computational Complexity.
C Alias, A Darte, P Feautrier, L Gonnord
ICST Workshops, 238, 2013
62013
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
62009
The ASPIC tool: Accelerated symbolic polyhedral invariant computation
L Gonnord
62009
Real-world loops are easy to predict: a case study
RE Rodrigues, P Alves, F Pereira, L Gonnord
52014
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20