Jérôme Leroux

ORCID

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 59

Top Venues

Publications

Thibault Hilaire, David Ilcinkas, Jérôme Leroux
A State-of-the-Art Karp-Miller Algorithm Certified in Coq. TACAS (1) (2024)
Petr Jancar, Jérôme Leroux
On the Home-Space Problem for Petri Nets. Taming the Infinities of Concurrency (2024)
Jérôme Leroux
Ackermannian Completion of Separators. FoSSaCS (1) (2024)
Dmitry Chistikov, Jérôme Leroux, Henry Sinclair-Banks, Nicolas Waldburger
Invariants for One-Counter Automata with Disequality Tests. CONCUR (2024)
Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski
New Lower Bounds for Reachability in Vector Addition Systems. CoRR (2023)
Philipp Czerner, Javier Esparza, Jérôme Leroux
Lower bounds on the state complexity of population protocols. Distributed Comput. 36 (3) (2023)
Petr Jancar, Jérôme Leroux
The Semilinear Home-Space Problem Is Ackermann-Complete for Petri Nets. CONCUR (2023)
Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski
New Lower Bounds for Reachability in Vector Addition Systems. FSTTCS (2023)
Jérôme Leroux
Compiling Petri Net Mutual Reachability in Presburger. CoRR (2022)
Jérôme Leroux
State Complexity of Protocols with Leaders. PODC (2022)
Petr Jancar, Jérôme Leroux
Semilinear Home-space is Decidable for Petri Nets. CoRR (2022)
Jérôme Leroux
The Reachability Problem for Petri Nets is Not Primitive Recursive. FOCS (2022)
Jérôme Leroux
Flat Petri Nets (Invited Talk). Petri Nets (2021)
Jérôme Leroux
State Complexity of Counting Population Protocols With Leaders. CoRR (2021)
Jérôme Leroux
The Reachability Problem for Petri Nets is Not Primitive Recursive. CoRR (2021)
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
The Reachability Problem for Petri Nets Is Not Elementary. J. ACM 68 (1) (2021)
Matthias Englert, Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Juliusz Straszynski
A lower bound for the coverability problem in acyclic pushdown VAS. Inf. Process. Lett. 167 (2021)
Jérôme Leroux
The Reachability Problem for Petri Nets is Not Primitive Recursive. FOCS (2021)
Ashwani Anand, Nathanaël Fijalkow, Aliénor Goubault-Larrecq, Jérôme Leroux, Pierre Ohlmann
New Algorithms for Combinations of Objectives using Separating Automata. GandALF (2021)
Antonín Kucera, Jérôme Leroux, Dominik Velan
Efficient Analysis of VASS Termination Complexity. LICS (2020)
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
Reachability in fixed dimension vector addition systems with states. CoRR (2020)
Jérôme Leroux, Grégoire Sutre
Reachability in Two-Dimensional Vector Addition Systems with States: One Test Is for Free. CONCUR (2020)
Jérôme Leroux
When Reachability Meets Grzegorczyk. LICS (2020)
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
Reachability in Fixed Dimension Vector Addition Systems with States. CONCUR (2020)
Jérôme Leroux, Grégoire Sutre
Reachability in Two-Dimensional Vector Addition Systems with States: One Test is for Free. CoRR (2020)
Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. Log. Methods Comput. Sci. 15 (4) (2019)
Jérôme Leroux, Sylvain Schmitz
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension. CoRR (2019)
Jérôme Leroux
Petri Net Reachability Problem (Invited Talk). MFCS (2019)
Petr Jancar, Jérôme Leroux, Grégoire Sutre
Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States. Fundam. Informaticae 169 (1-2) (2019)
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
The reachability problem for Petri nets is not elementary. STOC (2019)
Jérôme Leroux
Distance Between Mutually Reachable Petri Net Configurations. FSTTCS (2019)
Jérôme Leroux, Sylvain Schmitz
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension. LICS (2019)
Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. CoRR (2019)
Alain Finkel, Jérôme Leroux, Grégoire Sutre
Reachability for Two-Counter Machines with One Test and One Reset. FSTTCS (2018)
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract). CoRR (2018)
Petr Jancar, Jérôme Leroux, Grégoire Sutre
Co-finiteness and Co-emptiness of Reachability Sets in Vector Addition Systems with States. Petri Nets (2018)
Thomas Geffroy, Jérôme Leroux, Grégoire Sutre
Occam's Razor applied to the Petri net coverability problem. Theor. Comput. Sci. 750 (2018)
Jérôme Leroux
Polynomial Vector Addition Systems With States. ICALP (2018)
Diego Figueira, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki, Grégoire Sutre
Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One. ICALP (2017)
Thomas Geffroy, Jérôme Leroux, Grégoire Sutre
Backward coverability with pruning for lossy channel systems. SPIN (2017)
Piotr Hofman, Jérôme Leroux, Patrick Totzke
Linear combinations of unordered data vectors. LICS (2017)
Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar
Verification of population protocols. Acta Informatica 54 (2) (2017)
Jérôme Leroux, Sylvain Schmitz
Ideal Decompositions for Vector Addition Systems (Invited Talk). STACS (2016)
Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke
Coverability Trees for Petri Nets with Unordered Data. FoSSaCS (2016)
Thomas Geffroy, Jérôme Leroux, Grégoire Sutre
Occam's Razor Applied to the Petri Net Coverability Problem. RP (2016)
Parosh Aziz Abdulla, Stéphane Demri, Alain Finkel, Jérôme Leroux, Igor Potapov
Preface. Fundam. Informaticae 143 (3-4) (2016)
Jérôme Leroux, Philipp Rümmer, Pavle Subotic
Guiding Craig interpolation with domain-specific abstractions. Acta Informatica 53 (4) (2016)
Thomas Geffroy, Jérôme Leroux, Grégoire Sutre
Occam's Razor Applied to the Petri Net Coverability Problem. CoRR (2016)
Piotr Hofman, Jérôme Leroux, Patrick Totzke
Linear Combinations of Unordered Data Vectors. CoRR (2016)
Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar
Model Checking Population Protocols. FSTTCS (2016)
Jérôme Leroux, Grégoire Sutre, Patrick Totzke
On Boundedness Problems for Pushdown Vector Addition Systems. CoRR (2015)
Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar
Verification of Population Protocols. CONCUR (2015)
Alain Finkel, Jérôme Leroux
Recent and simple algorithms for Petri nets. Softw. Syst. Model. 14 (2) (2015)
Jérôme Leroux, Sylvain Schmitz
Demystifying Reachability in Vector Addition Systems. LICS (2015)
Jérôme Leroux, Sylvain Schmitz
Reachability in Vector Addition Systems Demystified. CoRR (2015)
Jérôme Leroux, Grégoire Sutre, Patrick Totzke
On Boundedness Problems for Pushdown Vector Addition Systems. RP (2015)
Jérôme Leroux, Grégoire Sutre, Patrick Totzke
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension. ICALP (2) (2015)
Frank Drewes, Jérôme Leroux
Structurally Cyclic Petri Nets. Log. Methods Comput. Sci. 11 (4) (2015)
Jérôme Leroux, Grégoire Sutre, Patrick Totzke
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension. CoRR (2015)
Jérôme Leroux, Philippe Schnoebelen
On Functions Weakly Computable by Petri Nets and Vector Addition Systems. RP (2014)
Jérôme Leroux, Vincent Penelle, Grégoire Sutre
The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems. ATVA (2014)
Alain Finkel, Jérôme Leroux
Neue, einfache Algorithmen für Petrinetze. Inform. Spektrum 37 (3) (2014)
Jérôme Leroux, M. Praveen, Grégoire Sutre
Hyper-Ackermannian bounds for pushdown vector addition systems. CSL-LICS (2014)
Jérôme Leroux, M. Praveen, Grégoire Sutre
A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness. CONCUR (2013)
Jérôme Leroux, Vincent Penelle, Grégoire Sutre
On the Context-Freeness Problem for Vector Addition Systems. LICS (2013)
Jérôme Leroux
Acceleration For Presburger Petri Nets. VPT@CAV (2013)
Jérôme Leroux
Acceleration for Petri Nets. ATVA (2013)
Jérôme Leroux
Presburger Vector Addition Systems. LICS (2013)
Jérôme Leroux
Vector Addition System Reversible Reachability Problem Log. Methods Comput. Sci. 9 (1) (2013)
Alexander Heußner, Jérôme Leroux, Anca Muscholl, Grégoire Sutre
Reachability Analysis of Communicating Pushdown Systems Log. Methods Comput. Sci. 8 (3) (2012)
Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun
Model Checking Vector Addition Systems with one zero-test Log. Methods Comput. Sci. 8 (2) (2012)
Jérôme Leroux
Vector Addition Systems Reachability Problem (A Simpler Solution). Turing-100 (2012)
Jérôme Leroux
Vector Addition System Reachability Problem: A Short Self-contained Proof. LATA (2011)
Sébastien Bardin, Philippe Herrmann, Jérôme Leroux, Olivier Ly, Renaud Tabary, Aymeric Vincent
The BINCOA Framework for Binary Code Analysis. CAV (2011)
Jérôme Leroux
Vector addition system reachability problem: a short self-contained proof. POPL (2011)
Jérôme Leroux
Vector Addition System Reversible Reachability Problem. CONCUR (2011)
Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun
Place-Boundedness for Vector Addition Systems with one zero-test. FSTTCS (2010)
Alexander Heußner, Jérôme Leroux, Anca Muscholl, Grégoire Sutre
Reachability Analysis of Communicating Pushdown Systems. FoSSaCS (2010)
Jérôme Leroux
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants Log. Methods Comput. Sci. 6 (3) (2010)
Daniel Kroening, Jérôme Leroux, Philipp Rümmer
Interpolating Quantifier-Free Presburger Arithmetic. LPAR (Yogyakarta) (2010)
Thomas Gawlitza, Jérôme Leroux, Jan Reineke, Helmut Seidl, Grégoire Sutre, Reinhard Wilhelm
Polynomial Precise Interval Analysis Revisited. Efficient Algorithms (2009)
Bernard Boigelot, Julien Brusten, Jérôme Leroux
A Generalization of Semenov's Theorem to Automata over Real Numbers. CADE (2009)
Jérôme Leroux, Gérald Point
TaPAS: The Talence Presburger Arithmetic Suite. TACAS (2009)
Jérôme Leroux
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants. LICS (2009)
Alain Finkel, Jérôme Leroux
The convex hull of a regular set of integer vectors is polyhedral and effectively computable CoRR (2008)
Florent Bouchy, Alain Finkel, Jérôme Leroux
Decomposition of Decidable First-Order Logics over Integers and Reals. TIME (2008)
Jérôme Leroux
Structural Presburger digit vector automata. Theor. Comput. Sci. 409 (3) (2008)
Florent Bouchy, Alain Finkel, Jérôme Leroux
Decomposition of Decidable First-Order Logics over Integers and Reals CoRR (2008)
Nicolas Caniart, Emmanuel Fleury, Jérôme Leroux, Marc Zeitoun
Accelerating Interpolation-Based Model-Checking. TACAS (2008)
Jérôme Leroux
Convex Hull of Arithmetic Automata CoRR (2008)
Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci
FAST: acceleration from theory to practice. Int. J. Softw. Tools Technol. Transf. 10 (5) (2008)
Jérôme Leroux
Convex Hull of Arithmetic Automata. SAS (2008)
Jérôme Leroux, Grégoire Sutre
Accelerated Data-Flow Analysis CoRR (2008)
Jérôme Leroux, Grégoire Sutre
Accelerated Data-Flow Analysis. SAS (2007)
Jérôme Leroux, Grégoire Sutre
Acceleration in Convex Data-Flow Analysis. FSTTCS (2007)
Jérôme Leroux, Grégoire Sutre
Flat counter automata almost everywhere!. Software Verification: Infinite-State Model Checking and Static Program Analysis (2006)
Sébastien Bardin, Jérôme Leroux, Gérald Point
FAST Extended Release. CAV (2006)
Jérôme Leroux
Least Significant Digit First Presburger Automata CoRR (2006)
Jérôme Leroux
A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams. LICS (2005)
Sébastien Bardin, Alain Finkel, Jérôme Leroux, Philippe Schnoebelen
Flat Acceleration in Symbolic Model Checking. ATVA (2005)

Jérôme Leroux.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jérôme Leroux