Jerome Leroux
Jerome Leroux
CNRS researcher, LaBRI, France
Verified email at labri.fr
Title
Cited by
Cited by
Year
How to compose Presburger-accelerations: Applications to broadcast protocols
A Finkel, J Leroux
International Conference on Foundations of Software Technology and …, 2002
2032002
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
1232005
Flat acceleration in symbolic model checking
S Bardin, A Finkel, J Leroux, P Schnoebelen
International symposium on automated technology for verification and …, 2005
1042005
The general vector addition system reachability problem by Presburger inductive invariants
J Leroux
2009 24th Annual IEEE Symposium on Logic In Computer Science, 4-13, 2009
1002009
Vector addition system reachability problem: a short self-contained proof
J Leroux
International Conference on Language and Automata Theory and Applications, 41-64, 2011
992011
Demystifying reachability in vector addition systems
J Leroux, S Schmitz
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 56-67, 2015
912015
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
832008
The reachability problem for Petri nets is not elementary
W Czerwiński, S Lasota, R Lazić, J Leroux, F Mazowiecki
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
802019
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
722011
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
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
692005
Vector addition systems reachability problem (a simpler solution)
J Leroux
EPiC 10, 214-228, 2012
672012
On flatness for 2-dimensional vector addition systems with states
J Leroux, G Sutre
International Conference on Concurrency Theory, 402-416, 2004
592004
FAST extended release
S Bardin, J Leroux, G Point
International Conference on Computer Aided Verification, 63-66, 2006
552006
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
472003
Verification of population protocols
J Esparza, P Ganty, J Leroux, R Majumdar
Acta Informatica 54 (2), 191-215, 2017
392017
Reachability analysis of communicating pushdown systems
A Heußner, J Leroux, A Muscholl, G Sutre
International Conference on Foundations of Software Science and …, 2010
392010
Reachability analysis of communicating pushdown systems
A Heußner, J Leroux, A Muscholl, G Sutre
International Conference on Foundations of Software Science and …, 2010
392010
Presburger vector addition systems
J Leroux
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 23-32, 2013
382013
The system can't perform the operation now. Try again later.
Articles 1–20