Suivre
Jerome Leroux
Jerome Leroux
CNRS researcher, LaBRI, France
Adresse e-mail validée de labri.fr
Titre
Citée par
Citée par
Année
How to compose Presburger-accelerations: Applications to broadcast protocols
A Finkel, J Leroux
International Conference on Foundations of Software Technology and …, 2002
2102002
Fast: Fast acceleration of symbolic transition systems
S Bardin, A Finkel, J Leroux, L Petrucci
International Conference on Computer Aided Verification, 118-121, 2003
1532003
Flat counter automata almost everywhere!
J Leroux, G Sutre
International Symposium on Automated Technology for Verification and …, 2005
1252005
The reachability problem for Petri nets is not elementary
W Czerwiński, S Lasota, R Lazić, J Leroux, F Mazowiecki
Journal of the ACM (JACM) 68 (1), 1-28, 2020
1192020
Flat acceleration in symbolic model checking
S Bardin, A Finkel, J Leroux, P Schnoebelen
International symposium on automated technology for verification and …, 2005
1072005
The general vector addition system reachability problem by Presburger inductive invariants
leroux jerome
Logical Methods in Computer Science 6, 2010
1062010
Vector addition system reachability problem: a short self-contained proof
J Leroux
International Conference on Language and Automata Theory and Applications, 41-64, 2011
1042011
Demystifying reachability in vector addition systems
J Leroux, S Schmitz
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 56-67, 2015
982015
FAST: acceleration from theory to practice
S Bardin, A Finkel, J Leroux, L Petrucci
International Journal on Software Tools for Technology Transfer 10 (5), 401-424, 2008
882008
The BINCOA framework for binary code analysis
S Bardin, P Herrmann, J Leroux, O Ly, R Tabary, A Vincent
International Conference on Computer Aided Verification, 165-170, 2011
822011
Vector addition systems reachability problem (a simpler solution)
J Leroux
EPiC 10, 214-228, 2012
722012
A polynomial time Presburger criterion and synthesis for number decision diagrams
J Leroux
20th Annual IEEE Symposium on Logic in Computer Science (LICS'05), 147-156, 2005
722005
FASTer acceleration of counter automata in practice
S Bardin, A Finkel, J Leroux
International Conference on Tools and Algorithms for the Construction and …, 2004
702004
On flatness for 2-dimensional vector addition systems with states
J Leroux, G Sutre
International Conference on Concurrency Theory, 402-416, 2004
612004
FAST extended release
S Bardin, J Leroux, G Point
International Conference on Computer Aided Verification, 63-66, 2006
592006
Reachability in vector addition systems is primitive-recursive in fixed dimension
J Leroux, S Schmitz
2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2019
542019
Verification of population protocols
J Esparza, P Ganty, J Leroux, R Majumdar
Acta Informatica 54 (2), 191-215, 2017
512017
Algorithmique de la vérification des systèmes à compteurs: approximation et accélération, implémentation de l'outil FAST
J Leroux
Cachan, Ecole normale supérieure, 2003
482003
Reachability analysis of communicating pushdown systems
A Heußner, J Leroux, A Muscholl, G Sutre
International Conference on Foundations of Software Science and …, 2010
442010
Reachability analysis of communicating pushdown systems
A Heußner, J Leroux, A Muscholl, G Sutre
International Conference on Foundations of Software Science and …, 2010
442010
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20