Jerome Leroux
Jerome Leroux
CNRS researcher, LaBRI, France
Verified email at
Cited by
Cited by
How to compose Presburger-accelerations: Applications to broadcast protocols
A Finkel, J Leroux
FST TCS 2002: Foundations of Software Technology and Theoretical Computer …, 2002
Fast: Fast acceleration of symbolic transition systems
S Bardin, A Finkel, J Leroux, L Petrucci
Computer Aided Verification: 15th International Conference, CAV 2003 …, 2003
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
Flat counter automata almost everywhere!
J Leroux, G Sutre
International Symposium on Automated Technology for Verification and …, 2005
Demystifying reachability in vector addition systems
J Leroux, S Schmitz
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 56-67, 2015
Vector addition system reachability problem: a short self-contained proof
J Leroux
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of …, 2011
The general vector addition system reachability problem by Presburger inductive invariants
leroux jerome
Logical Methods in Computer Science 6, 2010
Flat acceleration in symbolic model checking
S Bardin, A Finkel, J Leroux, P Schnoebelen
Automated Technology for Verification and Analysis: Third International …, 2005
FAST: acceleration from theory to practice
S Bardin, A Finkel, J Leroux, L Petrucci
International Journal on Software Tools for Technology Transfer 10, 401-424, 2008
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
The BINCOA framework for binary code analysis
S Bardin, P Herrmann, J Leroux, O Ly, R Tabary, A Vincent
Computer Aided Verification: 23rd International Conference, CAV 2011 …, 2011
Vector addition systems reachability problem (a simpler solution)
J Leroux
EPiC 10, 214-228, 2012
The reachability problem for Petri nets is not primitive recursive
J Leroux
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
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
FASTer acceleration of counter automata in practice
S Bardin, A Finkel, J Leroux
Tools and Algorithms for the Construction and Analysis of Systems: 10th …, 2004
On flatness for 2-dimensional vector addition systems with states
J Leroux, G Sutre
International Conference on Concurrency Theory, 402-416, 2004
Verification of population protocols
J Esparza, P Ganty, J Leroux, R Majumdar
Acta Informatica 54 (2), 191-215, 2017
FAST Extended Release: (Tool Paper)
S Bardin, J Leroux, G Point
Computer Aided Verification: 18th International Conference, CAV 2006 …, 2006
Presburger vector addition systems
J Leroux
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 23-32, 2013
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
The system can't perform the operation now. Try again later.
Articles 1–20