default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJérôme Leroux
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c69]Petr Jancar
, Jérôme Leroux:
On the Home-Space Problem for Petri Nets. Taming the Infinities of Concurrency 2024: 172-180- [c68]Dmitry Chistikov, Jérôme Leroux, Henry Sinclair-Banks, Nicolas Waldburger:
Invariants for One-Counter Automata with Disequality Tests. CONCUR 2024: 17:1-17:21 - [c67]Jérôme Leroux:
Ackermannian Completion of Separators. FoSSaCS (1) 2024: 3-10 - [c66]Thibault Hilaire, David Ilcinkas, Jérôme Leroux:
A State-of-the-Art Karp-Miller Algorithm Certified in Coq. TACAS (1) 2024: 370-389 - [i22]Dmitry Chistikov, Jérôme Leroux, Henry Sinclair-Banks, Nicolas Waldburger:
Invariants for One-Counter Automata with Disequality Tests. CoRR abs/2408.11908 (2024) - 2023
- [j19]Philipp Czerner, Javier Esparza, Jérôme Leroux:
Lower bounds on the state complexity of population protocols. Distributed Comput. 36(3): 209-218 (2023) - [c65]Petr Jancar, Jérôme Leroux:
The Semilinear Home-Space Problem Is Ackermann-Complete for Petri Nets. CONCUR 2023: 36:1-36:17 - [c64]Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski:
New Lower Bounds for Reachability in Vector Addition Systems. FSTTCS 2023: 35:1-35:22 - [e3]Jérôme Leroux, Sylvain Lombardy, David Peleg:
48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France. LIPIcs 272, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-292-1 [contents] - [i21]Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski:
New Lower Bounds for Reachability in Vector Addition Systems. CoRR abs/2310.09008 (2023) - 2022
- [c63]Jérôme Leroux:
State Complexity of Protocols with Leaders. PODC 2022: 257-264 - [i20]Petr Jancar, Jérôme Leroux:
Semilinear Home-space is Decidable for Petri Nets. CoRR abs/2207.02697 (2022) - [i19]Jérôme Leroux:
Compiling Petri Net Mutual Reachability in Presburger. CoRR abs/2210.09931 (2022) - 2021
- [j18]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: 106079 (2021) - [j17]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): 7:1-7:28 (2021) - [c62]Jérôme Leroux:
Flat Petri Nets (Invited Talk). Petri Nets 2021: 17-30 - [c61]Jérôme Leroux:
The Reachability Problem for Petri Nets is Not Primitive Recursive. FOCS 2021: 1241-1252 - [c60]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: 227-240 - [i18]Jérôme Leroux:
The Reachability Problem for Petri Nets is Not Primitive Recursive. CoRR abs/2104.12695 (2021) - [i17]Jérôme Leroux:
State Complexity of Counting Population Protocols With Leaders. CoRR abs/2109.15171 (2021) - 2020
- [c59]Jérôme Leroux, Grégoire Sutre:
Reachability in Two-Dimensional Vector Addition Systems with States: One Test Is for Free. CONCUR 2020: 37:1-37:17 - [c58]Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
Reachability in Fixed Dimension Vector Addition Systems with States. CONCUR 2020: 48:1-48:21 - [c57]Jérôme Leroux:
When Reachability Meets Grzegorczyk. LICS 2020: 1-6 - [c56]Antonín Kucera, Jérôme Leroux, Dominik Velan:
Efficient Analysis of VASS Termination Complexity. LICS 2020: 676-688 - [i16]Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
Reachability in fixed dimension vector addition systems with states. CoRR abs/2001.04327 (2020) - [i15]Jérôme Leroux, Grégoire Sutre:
Reachability in Two-Dimensional Vector Addition Systems with States: One Test is for Free. CoRR abs/2007.09096 (2020)
2010 – 2019
- 2019
- [j16]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): 123-150 (2019) - [j15]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) - [c55]Jérôme Leroux:
Distance Between Mutually Reachable Petri Net Configurations. FSTTCS 2019: 47:1-47:14 - [c54]Jérôme Leroux, Sylvain Schmitz:
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension. LICS 2019: 1-13 - [c53]Jérôme Leroux:
Petri Net Reachability Problem (Invited Talk). MFCS 2019: 5:1-5:3 - [c52]Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
The reachability problem for Petri nets is not elementary. STOC 2019: 24-33 - [e2]Jérôme Leroux, Jean-François Raskin:
Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2019, Bordeaux, France, 2-3rd September 2019. EPTCS 305, 2019 [contents] - [i14]Jérôme Leroux, Sylvain Schmitz:
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension. CoRR abs/1903.08575 (2019) - [i13]Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre:
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. CoRR abs/1904.04090 (2019) - 2018
- [j14]Thomas Geffroy, Jérôme Leroux, Grégoire Sutre:
Occam's Razor applied to the Petri net coverability problem. Theor. Comput. Sci. 750: 38-52 (2018) - [c51]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: 184-203 - [c50]Alain Finkel, Jérôme Leroux, Grégoire Sutre:
Reachability for Two-Counter Machines with One Test and One Reset. FSTTCS 2018: 31:1-31:14 - [c49]Jérôme Leroux:
Polynomial Vector Addition Systems With States. ICALP 2018: 134:1-134:13 - [i12]Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract). CoRR abs/1809.07115 (2018) - 2017
- [j13]Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar:
Verification of population protocols. Acta Informatica 54(2): 191-215 (2017) - [c48]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: 119:1-119:14 - [c47]Piotr Hofman, Jérôme Leroux, Patrick Totzke:
Linear combinations of unordered data vectors. LICS 2017: 1-11 - [c46]Thomas Geffroy, Jérôme Leroux, Grégoire Sutre:
Backward coverability with pruning for lossy channel systems. SPIN 2017: 132-141 - 2016
- [j12]Jérôme Leroux, Philipp Rümmer, Pavle Subotic:
Guiding Craig interpolation with domain-specific abstractions. Acta Informatica 53(4): 387-424 (2016) - [j11]Parosh Aziz Abdulla, Stéphane Demri, Alain Finkel, Jérôme Leroux, Igor Potapov:
Preface. Fundam. Informaticae 143(3-4): i-ii (2016) - [c45]Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke:
Coverability Trees for Petri Nets with Unordered Data. FoSSaCS 2016: 445-461 - [c44]Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar:
Model Checking Population Protocols. FSTTCS 2016: 27:1-27:14 - [c43]Thomas Geffroy, Jérôme Leroux, Grégoire Sutre:
Occam's Razor Applied to the Petri Net Coverability Problem. RP 2016: 77-89 - [c42]Jérôme Leroux, Sylvain Schmitz:
Ideal Decompositions for Vector Addition Systems (Invited Talk). STACS 2016: 1:1-1:13 - [i11]Thomas Geffroy, Jérôme Leroux, Grégoire Sutre:
Occam's Razor Applied to the Petri Net Coverability Problem. CoRR abs/1607.05956 (2016) - [i10]Piotr Hofman, Jérôme Leroux, Patrick Totzke:
Linear Combinations of Unordered Data Vectors. CoRR abs/1610.01470 (2016) - 2015
- [j10]Frank Drewes, Jérôme Leroux:
Structurally Cyclic Petri Nets. Log. Methods Comput. Sci. 11(4) (2015) - [j9]Alain Finkel, Jérôme Leroux:
Recent and simple algorithms for Petri nets. Softw. Syst. Model. 14(2): 719-725 (2015) - [c41]Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar:
Verification of Population Protocols. CONCUR 2015: 470-482 - [c40]Jérôme Leroux, Grégoire Sutre, Patrick Totzke:
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension. ICALP (2) 2015: 324-336 - [c39]Jérôme Leroux, Sylvain Schmitz:
Demystifying Reachability in Vector Addition Systems. LICS 2015: 56-67 - [c38]Jérôme Leroux, Grégoire Sutre, Patrick Totzke:
On Boundedness Problems for Pushdown Vector Addition Systems. RP 2015: 101-113 - [i9]Jérôme Leroux, Sylvain Schmitz:
Reachability in Vector Addition Systems Demystified. CoRR abs/1503.00745 (2015) - [i8]Jérôme Leroux, Grégoire Sutre, Patrick Totzke:
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension. CoRR abs/1503.04018 (2015) - [i7]Jérôme Leroux, Grégoire Sutre, Patrick Totzke:
On Boundedness Problems for Pushdown Vector Addition Systems. CoRR abs/1507.07362 (2015) - 2014
- [j8]Alain Finkel, Jérôme Leroux:
Neue, einfache Algorithmen für Petrinetze. Inform. Spektrum 37(3): 229-236 (2014) - [c37]Jérôme Leroux, Vincent Penelle, Grégoire Sutre:
The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems. ATVA 2014: 248-263 - [c36]Jérôme Leroux, M. Praveen, Grégoire Sutre:
Hyper-Ackermannian bounds for pushdown vector addition systems. CSL-LICS 2014: 63:1-63:10 - [c35]Jérôme Leroux, Philippe Schnoebelen:
On Functions Weakly Computable by Petri Nets and Vector Addition Systems. RP 2014: 190-202 - 2013
- [j7]Jérôme Leroux:
Vector Addition System Reversible Reachability Problem. Log. Methods Comput. Sci. 9(1) (2013) - [c34]Jérôme Leroux:
Acceleration for Petri Nets. ATVA 2013: 1-4 - [c33]Jérôme Leroux:
Acceleration For Presburger Petri Nets. VPT@CAV 2013: 10-12 - [c32]Jérôme Leroux, M. Praveen, Grégoire Sutre:
A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness. CONCUR 2013: 137-151 - [c31]Jérôme Leroux:
Presburger Vector Addition Systems. LICS 2013: 23-32 - [c30]Jérôme Leroux, Vincent Penelle, Grégoire Sutre:
On the Context-Freeness Problem for Vector Addition Systems. LICS 2013: 43-52 - 2012
- [j6]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) - [j5]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) - [c29]Jérôme Leroux:
Vector Addition Systems Reachability Problem (A Simpler Solution). Turing-100 2012: 214-228 - [e1]Alain Finkel, Jérôme Leroux, Igor Potapov:
Reachability Problems - 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings. Lecture Notes in Computer Science 7550, Springer 2012, ISBN 978-3-642-33511-2 [contents] - 2011
- [c28]Sébastien Bardin, Philippe Herrmann, Jérôme Leroux, Olivier Ly, Renaud Tabary, Aymeric Vincent:
The BINCOA Framework for Binary Code Analysis. CAV 2011: 165-170 - [c27]Jérôme Leroux:
Vector Addition System Reversible Reachability Problem. CONCUR 2011: 327-341 - [c26]Jérôme Leroux:
Vector Addition System Reachability Problem: A Short Self-contained Proof. LATA 2011: 41-64 - [c25]Jérôme Leroux:
Vector addition system reachability problem: a short self-contained proof. POPL 2011: 307-316 - 2010
- [j4]Jérôme Leroux:
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants. Log. Methods Comput. Sci. 6(3) (2010) - [c24]Alexander Heußner, Jérôme Leroux, Anca Muscholl, Grégoire Sutre:
Reachability Analysis of Communicating Pushdown Systems. FoSSaCS 2010: 267-281 - [c23]Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun:
Place-Boundedness for Vector Addition Systems with one zero-test. FSTTCS 2010: 192-203 - [c22]Daniel Kroening, Jérôme Leroux, Philipp Rümmer:
Interpolating Quantifier-Free Presburger Arithmetic. LPAR (Yogyakarta) 2010: 489-503
2000 – 2009
- 2009
- [c21]Thomas Gawlitza, Jérôme Leroux, Jan Reineke, Helmut Seidl, Grégoire Sutre, Reinhard Wilhelm:
Polynomial Precise Interval Analysis Revisited. Efficient Algorithms 2009: 422-437 - [c20]Bernard Boigelot, Julien Brusten, Jérôme Leroux:
A Generalization of Semenov's Theorem to Automata over Real Numbers. CADE 2009: 469-484 - [c19]Jérôme Leroux:
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants. LICS 2009: 4-13 - [c18]Jérôme Leroux, Gérald Point:
TaPAS: The Talence Presburger Arithmetic Suite. TACAS 2009: 182-185 - 2008
- [j3]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): 401-424 (2008) - [j2]Jérôme Leroux:
Structural Presburger digit vector automata. Theor. Comput. Sci. 409(3): 549-556 (2008) - [c17]Jérôme Leroux:
Convex Hull of Arithmetic Automata. SAS 2008: 47-61 - [c16]Nicolas Caniart, Emmanuel Fleury, Jérôme Leroux, Marc Zeitoun:
Accelerating Interpolation-Based Model-Checking. TACAS 2008: 428-442 - [c15]Florent Bouchy, Alain Finkel, Jérôme Leroux:
Decomposition of Decidable First-Order Logics over Integers and Reals. TIME 2008: 147-155 - [i6]Alain Finkel, Jérôme Leroux:
The convex hull of a regular set of integer vectors is polyhedral and effectively computable. CoRR abs/0812.1951 (2008) - [i5]Florent Bouchy, Alain Finkel, Jérôme Leroux:
Decomposition of Decidable First-Order Logics over Integers and Reals. CoRR abs/0812.1967 (2008) - [i4]Jérôme Leroux, Grégoire Sutre:
Accelerated Data-Flow Analysis. CoRR abs/0812.2011 (2008) - [i3]Jérôme Leroux:
Convex Hull of Arithmetic Automata. CoRR abs/0812.2014 (2008) - 2007
- [c14]Jérôme Leroux, Grégoire Sutre:
Acceleration in Convex Data-Flow Analysis. FSTTCS 2007: 520-531 - [c13]Jérôme Leroux, Grégoire Sutre:
Accelerated Data-Flow Analysis. SAS 2007: 184-199 - 2006
- [c12]Sébastien Bardin, Jérôme Leroux, Gérald Point:
FAST Extended Release. CAV 2006: 63-66 - [i2]Jérôme Leroux, Grégoire Sutre:
Flat counter automata almost everywhere!. Software Verification: Infinite-State Model Checking and Static Program Analysis 2006 - [i1]Jérôme Leroux:
Least Significant Digit First Presburger Automata. CoRR abs/cs/0612037 (2006) - 2005
- [j1]Alain Finkel, Jérôme Leroux:
The convex hull of a regular set of integer vectors is polyhedral and effectively computable. Inf. Process. Lett. 96(1): 30-35 (2005) - [c11]Sébastien Bardin, Alain Finkel, Jérôme Leroux, Philippe Schnoebelen:
Flat Acceleration in Symbolic Model Checking. ATVA 2005: 474-488 - [c10]Jérôme Leroux, Grégoire Sutre:
Flat Counter Automata Almost Everywhere! ATVA 2005: 489-503 - [c9]Jérôme Leroux:
A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams. LICS 2005: 147-156 - 2004
- [c8]Jérôme Leroux:
Disjunctive Invariants for Numerical Systems. ATVA 2004: 93-107 - [c7]Alain Finkel, Jérôme Leroux:
Image Computation in Infinite State Model Checking. CAV 2004: 361-371 - [c6]Jérôme Leroux, Grégoire Sutre:
On Flatness for 2-Dimensional Vector Addition Systems with States. CONCUR 2004: 402-416 - [c5]Alain Finkel, Jérôme Leroux:
Polynomial Time Image Computation with Interval-Definable Counters Systems. SPIN 2004: 182-197 - [c4]Sébastien Bardin, Alain Finkel, Jérôme Leroux:
FASTer Acceleration of Counter Automata in Practice. TACAS 2004: 576-590 - 2003
- [c3]Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci:
FAST: Fast Acceleration of Symbolikc Transition Systems. CAV 2003: 118-121 - [c2]Jérôme Leroux:
The Affine Hull of a Binary Automaton is Computable in Polynomial Time. INFINITY 2003: 89-104 - 2002
- [c1]Alain Finkel, Jérôme Leroux:
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols. FSTTCS 2002: 145-156
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 00:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
