Jerome Leroux
Jerome Leroux
CNRS researcher, LaBRI, France
Email verificata su labri.fr
Titolo
Citata da
Citata da
Anno
How to compose Presburger-accelerations: Applications to broadcast protocols
A Finkel, J Leroux
International Conference on Foundations of Software Technology andá…, 2002
1982002
Fast: Fast acceleration of symbolic transition systems
S Bardin, A Finkel, J Leroux, L Petrucci
International Conference on Computer Aided Verification, 118-121, 2003
1492003
Flat counter automata almost everywhere!
J Leroux, G Sutre
International Symposium on Automated Technology for Verification andá…, 2005
1182005
Flat acceleration in symbolic model checking
S Bardin, A Finkel, J Leroux, P Schnoebelen
International symposium on automated technology for verification andá…, 2005
982005
Vector addition system reachability problem: a short self-contained proof
J Leroux
International Conference on Language and Automata Theory and Applications, 41-64, 2011
932011
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
882009
Demystifying reachability in vector addition systems
J Leroux, S Schmitz
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 56-67, 2015
832015
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
802008
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
672005
FASTer acceleration of counter automata in practice
S Bardin, A Finkel, J Leroux
International Conference on Tools and Algorithms for the Construction andá…, 2004
672004
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
652011
Vector addition systems reachability problem (a simpler solution)
J Leroux
642012
Reachability analysis of communicating pushdown systems
A Heu▀ner, J Leroux, A Muscholl, G Sutre
International Conference on Foundations of Software Science andá…, 2010
632010
Reachability analysis of communicating pushdown systems
A Heu▀ner, J Leroux, A Muscholl, G Sutre
International Conference on Foundations of Software Science andá…, 2010
632010
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
542019
On flatness for 2-dimensional vector addition systems with states
J Leroux, G Sutre
International Conference on Concurrency Theory, 402-416, 2004
542004
FAST extended release
S Bardin, J Leroux, G Point
International Conference on Computer Aided Verification, 63-66, 2006
522006
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
362017
Presburger vector addition systems
J Leroux
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 23-32, 2013
332013
Il sistema al momento non pu˛ eseguire l'operazione. Riprova pi¨ tardi.
Articoli 1–20