default search action
Jérôme Leroux
- > Home > Persons > Jérôme Leroux
Publications
- 2018
- [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 - 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) - 2015
- [j9]Alain Finkel, Jérôme Leroux:
Recent and simple algorithms for Petri nets. Softw. Syst. Model. 14(2): 719-725 (2015) - 2014
- [j8]Alain Finkel, Jérôme Leroux:
Neue, einfache Algorithmen für Petrinetze. Inform. Spektrum 37(3): 229-236 (2014) - 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) - [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] - 2010
- [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 - 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) - [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) - 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 - 2004
- [c7]Alain Finkel, Jérôme Leroux:
Image Computation in Infinite State Model Checking. CAV 2004: 361-371 - [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 - 2002
- [c1]Alain Finkel, Jérôme Leroux:
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols. FSTTCS 2002: 145-156
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 2025-08-22 23:25 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: