Jérôme Leroux

88
Documents

Publications

1
4
3
1
5
5
5
5
4
6
7
4
6
5
4
4
4
5
2
2
5
1

Publications

On the Home-Space Problem for Petri Nets and its Ackermannian Complexity

Petr Jančar , Jérôme Leroux

Logical Methods in Computer Science, 2024, Volume 20, Issue 4, ⟨10.46298/LMCS-20(4:23)2024⟩

Article dans une revue hal-05407667v1
Deposit thumbnail

Lower bounds on the state complexity of population protocols

Philipp Czerner , Javier Esparza , Jérôme Leroux

Distributed Computing, 2023, 36 (3), pp.209-218. ⟨10.1007/s00446-023-00450-4⟩

Article dans une revue hal-04286895v1
Deposit thumbnail

A lower bound for the coverability problem in acyclic pushdown VAS

Matthias Englert , Piotr Hofman , Sławomir Lasota , Ranko Lazić , Jérôme Leroux et al.

Information Processing Letters, 2021, 167, pp.106079. ⟨10.1016/j.ipl.2020.106079⟩

Article dans une revue hal-03447041v1
Deposit thumbnail

The Reachability Problem for Petri Nets Is Not Elementary

Wojciech Czerwiński , Sławomir Lasota , Ranko Lazić , Jérôme Leroux , Filip Mazowiecki

Journal of the ACM (JACM), 2021, 68 (1), pp.7. ⟨10.1145/3422822⟩

Article dans une revue hal-03436240v1
Deposit thumbnail

Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States

Petr Jančar , Jérôme Leroux , Grégoire Sutre

Fundamenta Informaticae, 2019, 169 (1-2), pp.123-150. ⟨10.3233/FI-2019-1841⟩

Article dans une revue hal-02390597v1
Deposit thumbnail

Occam's Razor applied to the Petri net coverability problem

Thomas Geffroy , Jérôme Leroux , Grégoire Sutre

Theoretical Computer Science, 2018, 750, pp.38-52. ⟨10.1016/j.tcs.2018.04.014⟩

Article dans une revue hal-02390655v1
Deposit thumbnail

Verification of population protocols

Javier Esparza , Pierre Ganty , Jérôme Leroux , Rupak Majumdar

Acta Informatica, 2017, 54 (2), pp.191-215. ⟨10.1007/s00236-016-0272-3⟩

Article dans une revue hal-02391804v1
Deposit thumbnail

Guiding Craig interpolation with domain-specific abstractions

Jérôme Leroux , Philipp Rümmer , Pavle Subotić

Acta Informatica, 2016, 53 (4), pp.387-424. ⟨10.1007/s00236-015-0236-z⟩

Article dans une revue hal-02391810v1

Preface

Parosh Aziz Abdulla , Stephane Demri , Alain Finkel , Jérôme Leroux , Igor Potapov

Fundamenta Informaticae, 2016, 143 (3-4), pp.i-ii. ⟨10.3233/FI-2016-1311⟩

Article dans une revue hal-02391811v1

Recent and simple algorithms for Petri nets

Alain Finkel , Jérôme Leroux

Software and Systems Modeling, 2015, 14 (2), pp.719-725. ⟨10.1007/s10270-014-0426-0⟩

Article dans une revue hal-02391830v1

Structurally Cyclic Petri Nets

Jérôme Leroux , Drewes Frank

Logical Methods in Computer Science, 2015, 11 (4), ⟨10.2168/LMCS-11(4:15)2015⟩

Article dans une revue hal-02391827v1

Neue, einfache Algorithmen für Petrinetze

Alain Finkel , Jérôme Leroux

Informatik-Spektrum, 2014, 37 (3), pp.229-236. ⟨10.1007/s00287-013-0753-5⟩

Article dans une revue hal-01084813v1
Deposit thumbnail

Vector Addition System Reversible Reachability Problem

Jérôme Leroux

Logical Methods in Computer Science, 2013, 9 (1), pp.Electronique. ⟨10.2168/LMCS-9(1:5)2013⟩

Article dans une revue hal-00959696v1
Deposit thumbnail

REACHABILITY ANALYSIS OF COMMUNICATING PUSHDOWN SYSTEMS

Alexander Heussner , Jérôme Leroux , Anca Muscholl , Grégoire Sutre

Logical Methods in Computer Science, 2012, 8 (3:23), pp.1--20. ⟨10.2168/LMCS-8(3:23)2012⟩

Article dans une revue hal-00760287v1
Deposit thumbnail

Model Checking Vector Addition Systems with one zero-test

Rémi Bonnet , Alain Finkel , Jérôme Leroux , Marc Zeitoun

Logical Methods in Computer Science, 2012, 8 (2), pp.11. ⟨10.2168/LMCS-8(2:11)2012⟩

Article dans une revue hal-00722324v1
Deposit thumbnail

Vector Addition System Reachability Problem: A Short Self-Contained Proof

Jérôme Leroux

Logical Methods in Computer Science, 2010, 6 (3), pp.1-25. ⟨10.2168/LMCS-6(3:22)2010⟩

Article dans une revue hal-00645446v1
Deposit thumbnail

FAST: acceleration from theory to practice

Sebastien Bardin , Alain Finkel , Jérôme Leroux , Laure Petrucci

International Journal on Software Tools for Technology Transfer, 2008, 10 (5), pp.401-424. ⟨10.1007/s10009-008-0064-3⟩

Article dans une revue hal-00345968v1
Deposit thumbnail

Structural Presburger digit vector automata

Jérôme Leroux

Theoretical Computer Science, 2008, 409 (3), pp.549-556. ⟨10.1016/j.tcs.2008.09.037⟩

Article dans une revue hal-00345971v1
Deposit thumbnail

The convex hull of a regular set of integer vectors is polyhedral and effectively computable

Alain Finkel , Jérôme Leroux

Information Processing Letters, 2005, 96 (1), pp.30 - 35. ⟨10.1016/j.ipl.2005.04.004⟩

Article dans une revue hal-00345982v1

Structural Liveness of Conservative Petri Nets

Petr Jančar , Jérôme Leroux , Jiří Valůšek

Foundations of Software Science and Computation Structures - 28th International Conference, FoSSaCS 2025, Held as Part of the International Joint Conferences on Theory and Practice of Software, {ETAPS} 2025, Hamilton, ON, Canada, May 3-8, 2025, Proceedings, May 2025, Hamilton, Canada. pp.355-376, ⟨10.1007/978-3-031-90897-2_17⟩

Communication dans un congrès hal-05407681v1
Deposit thumbnail

A State-of-the-Art Karp-Miller Algorithm Certified in Coq

Thibault Hilaire , David Ilcinkas , Jérôme Leroux

30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2024), Apr 2024, Luxembourg, Luxembourg. pp.370 - 389, ⟨10.1007/978-3-031-57246-3_21⟩

Communication dans un congrès hal-04601324v1
Deposit thumbnail

Ackermannian Completion of Separators

Jérôme Leroux

FOSSCAS, Apr 2024, Luxembourg, Luxembourg. pp.3-10, ⟨10.1007/978-3-031-57228-9_1⟩

Communication dans un congrès hal-04783277v1

On the Home-Space Problem for Petri Nets

Petr Jančar , Jérôme Leroux

Taming the Infinities of Concurrency, 2024, Luxembourg -, Luxembourg. pp.172-180, ⟨10.1007/978-3-031-56222-8_10⟩

Communication dans un congrès hal-04783326v1

The Semilinear Home-Space Problem Is Ackermann-Complete for Petri Nets

Petr Jančar , Jérôme Leroux

34th International Conference on Concurrency Theory, {CONCUR} 2023, Sep 2023, Antwerp, Belgium. pp.36:1--36:17, ⟨10.4230/LIPICS.CONCUR.2023.36⟩

Communication dans un congrès hal-04286925v1
Deposit thumbnail

New Lower Bounds for Reachability in Vector Addition Systems

Wojciech Czerwiński , Ismaël Jecker , Sławomir Lasota , Jérôme Leroux , Łukasz Orlikowski

FSTTCS, Dec 2023, Telangana, India. pp.35:1--35:22, ⟨10.4230/LIPICS.FSTTCS.2023.35⟩

Communication dans un congrès hal-04782385v1
Deposit thumbnail

State Complexity of Protocols with Leaders

Jérôme Leroux

PODC '22: ACM Symposium on Principles of Distributed Computing, Jul 2022, Salerno, Italy. pp.257-264, ⟨10.1145/3519270.3538421⟩

Communication dans un congrès hal-03863775v1
Deposit thumbnail

The Reachability Problem for Petri Nets is Not Primitive Recursive

Jérôme Leroux

2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), Feb 2022, Denver, France. pp.1241-1252, ⟨10.1109/FOCS52979.2021.00121⟩

Communication dans un congrès hal-03863832v1
Deposit thumbnail

Flat Petri Nets (Invited Talk)

Jérôme Leroux

Application and Theory of Petri Nets and Concurrency - 42nd International Conference, {PETRI} {NETS} 2021, Jun 2021, Virtual Event, France. ⟨10.1007/978-3-030-76983-3_2⟩

Communication dans un congrès hal-03436231v1

New Algorithms for Combinations of Objectives using Separating Automata

Ashwani Anand , Nathanaël Fijalkow , Aliénor Goubault-Larrecq , Jérôme Leroux , Pierre Ohlmann

GandALF 2021 : International Symposium on Games, Automata, Logics, and Formal Verification, Sep 2021, Padua, Italy. pp.227-240, ⟨10.4204/EPTCS.346.15⟩

Communication dans un congrès hal-04286737v1

Reachability in Two-Dimensional Vector Addition Systems with States: One Test Is for Free

Jérôme Leroux , Grégoire Sutre

CONCUR 2020 - 31st International Conference on Concurrency Theory, Sep 2020, Vienne, Austria. pp.37:1-37:17, ⟨10.4230/LIPIcs.CONCUR.2020.37⟩

Communication dans un congrès hal-03030982v1
Deposit thumbnail

Efficient Analysis of VASS Termination Complexity

Antonín Kučera , Jérôme Leroux , Dominik Velan

LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken, Germany. pp.676-688

Communication dans un congrès hal-03052592v1
Deposit thumbnail

When Reachability Meets Grzegorczyk

Jérôme Leroux

LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken, Germany. pp.1-6

Communication dans un congrès hal-03052576v1

Reachability in Fixed Dimension Vector Addition Systems with States

Wojciech Czerwiński , Slawomir Lasota , Ranko Lazić , Jérôme Leroux , Filip Mazowiecki

31st International Conference on Concurrency Theory, {CONCUR} 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference), Sep 2020, Vienna, Austria. pp.48:1--48:21

Communication dans un congrès hal-03052567v1
Deposit thumbnail

Distance Between Mutually Reachable Petri Net Configurations

Jérôme Leroux

39th {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2019, December 11-13, 2019, Bombay, India, Nov 2019, Bombay, India

Communication dans un congrès hal-02156549v1

Petri Net Reachability Problem (Invited Talk)

Jérôme Leroux

44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), 2019, Aachen, Germany

Communication dans un congrès hal-02390621v1
Deposit thumbnail

Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension

Jérôme Leroux , Sylvain Schmitz

LICS 2019, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1--13, ⟨10.1109/LICS.2019.8785796⟩

Communication dans un congrès hal-02267524v1
Deposit thumbnail

The reachability problem for Petri nets is not elementary

Wojciech Czerwiński , Sławomir Lasota , Ranko Lazić , Jérôme Leroux , Filip Mazowiecki

Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019, Jun 2019, Phoenix, United States. pp.24-33, ⟨10.1145/3313276.3316369⟩

Communication dans un congrès hal-02390629v1
Deposit thumbnail

Polynomial Vector Addition Systems With States

Jérôme Leroux

45th International Colloquium on Automata, Languages, and Programming, {ICALP} 2018, July 9-13, 2018, Prague, Czech Republic, Jul 2018, Prague, Czech Republic. pp.134:1--134:13

Communication dans un congrès hal-01711089v1
Deposit thumbnail

Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States

Petr Jančar , Jérôme Leroux , Grégoire Sutre

PETRI NETS 2018 - 39th International Conference on the Application and Theory of Petri Nets and Concurrency, Jun 2018, Bratislava, Slovakia. pp.184-203, ⟨10.1007/978-3-319-91268-4_10⟩

Communication dans un congrès hal-01792566v1

Polynomial Vector Addition Systems With States

Jérôme Leroux

45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, 2018, Prague, Czech Republic. ⟨10.4230/LIPIcs.ICALP.2018.134⟩

Communication dans un congrès hal-02391837v1
Deposit thumbnail

Reachability for Two-Counter Machines with One Test and One Reset

Alain Finkel , Jérôme Leroux , Grégoire Sutre

FSTTCS 2018 - 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2018, Ahmedabad, India. pp.31:1-31:14, ⟨10.4230/LIPIcs.FSTTCS.2018.31⟩

Communication dans un congrès hal-01848554v2
Deposit thumbnail

Backward coverability with pruning for lossy channel systems

Thomas Geffroy , Jérôme Leroux , Grégoire Sutre

SPIN 2017 - 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, Jul 2017, Santa Barbara, United States. pp.132-141, ⟨10.1145/3092282.3092292⟩

Communication dans un congrès hal-02391841v1

Linear combinations of unordered data vectors

Piotr Hofman , Jérôme Leroux , Patrick Totzke

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2017, Reykjavik, France. pp.1-11, ⟨10.1109/LICS.2017.8005065⟩

Communication dans un congrès hal-02391839v1
Deposit thumbnail

Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One

Diego Figueira , Ranko Lazić , Jérôme Leroux , Filip Mazowiecki , Grégoire Sutre

International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2017, Varsovie, Poland. pp.119, ⟨10.4230/LIPIcs.ICALP.2017.119⟩

Communication dans un congrès hal-01688742v1

Occam's Razor Applied to the Petri Net Coverability Problem

Jérôme Leroux , Grégoire Sutre , Thomas Geffroy

RP 2016 - 10th International Workshop on Reachability Problems, Sep 2016, Aalborg, Denmark. pp.77-89, ⟨10.1007/978-3-319-45994-3_6⟩

Communication dans un congrès hal-02391865v1
Deposit thumbnail

Coverability Trees for Petri Nets with Unordered Data

Piotr Hofman , Sławomir Lasota , Ranko Lazić , Jérôme Leroux , Sylvain Schmitz et al.

FoSSaCS, 2016, Eindhoven, Netherlands. pp.445--461, ⟨10.1007/978-3-662-49630-5_26⟩

Communication dans un congrès hal-01252674v1

Ideal Decompositions for Vector Addition Systems

Jérôme Leroux , Sylvain Schmitz

STACS 2016 - 33rd Symposium on Theoretical Aspects of Computer Science, 2016, Orléans, France. pp.1--13, ⟨10.4230/LIPIcs.STACS.2016.1⟩

Communication dans un congrès hal-01275991v1

Model Checking Population Protocols

Javier Esparza , Pierre Ganty , Jérôme Leroux , Rupak Majumdar

36th {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2016, December 13-15, 2016, Chennai, India, 2016, Chennai, India. ⟨10.4230/LIPIcs.FSTTCS.2016.27⟩

Communication dans un congrès hal-02391850v1
Deposit thumbnail

UAV sensing of coastal cliff topography for rock fall hazard applications

Thomas Dewez , Jérôme Leroux , S Morelli

Journées Aléas Gravitaires JAG 2015, Sep 2015, Caen, France

Communication dans un congrès hal-01180649v1

On Boundedness Problems for Pushdown Vector Addition Systems

Jérôme Leroux , Grégoire Sutre , Patrick Totzke

RP 2015 - 9th International Workshop on Reachability Problems, Sep 2015, Varsovie, Poland. pp.101-113, ⟨10.1007/978-3-319-24537-9_10⟩

Communication dans un congrès hal-02391887v1
Deposit thumbnail

Demystifying Reachability in Vector Addition Systems

Jérôme Leroux , Sylvain Schmitz

LICS 2015, Jul 2015, Kyoto, Japan. pp.56--67, ⟨10.1109/LICS.2015.16⟩

Communication dans un congrès hal-01168388v1
Deposit thumbnail

Verification of Population Protocols

Javier Esparza , Pierre Ganty , Jérôme Leroux , Rupak Majumdar

26th International Conference on Concurrency Theory, {CONCUR} 2015, Sep 2015, Madrid, Spain. pp.470-482, ⟨10.4230/LIPIcs.CONCUR.2015.470⟩

Communication dans un congrès hal-02391875v1

On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension

Jérôme Leroux , Grégoire Sutre , Patrick Totzke

ICALP 2015 - 42nd International Colloquium on Automata, Languages, and Programming, Jul 2015, Kyoto, Japan. pp.324-336, ⟨10.1007/978-3-662-47666-6_26⟩

Communication dans un congrès hal-02391883v1
Deposit thumbnail

On Functions Weakly Computable by Petri Nets and Vector Addition Systems

Jérôme Leroux , Ph Schnoebelen

Reachability Problems - 8th International Workshop, {RP} 2014, Sep 2014, Oxford, United Kingdom. pp.190 - 202, ⟨10.1007/978-3-319-11439-2_15⟩

Communication dans un congrès hal-01084971v1
Deposit thumbnail

Hyper-Ackermannian Bounds for Pushdown Vector Addition Systems

Jérôme Leroux , M. Praveen , Grégoire Sutre

CSL-LICS 2014 - Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2014, Vienna, Austria. pp.Article 63, ⟨10.1145/2603088.2603146⟩

Communication dans un congrès hal-00989109v1
Deposit thumbnail

The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems

Jérôme Leroux , Vincent Penelle , Grégoire Sutre

ATVA'14, Nov 2014, Sydney, Australia. pp.248 - 263, ⟨10.1007/978-3-319-11936-6_19⟩

Communication dans un congrès hal-01084819v1
Deposit thumbnail

Acceleration for Petri Nets

Jérôme Leroux

ATVA, 2013, Hanoi, Vietnam. pp.1-4, ⟨10.1007/978-3-319-02444-8_1⟩

Communication dans un congrès hal-00959698v1
Deposit thumbnail

Acceleration For Presburger Petri Nets

Jérôme Leroux

VPT@CAV, 2013, Saint Petersbourg, Russia. pp.10-12

Communication dans un congrès hal-00959699v1
Deposit thumbnail

On the Context-Freeness Problem for Vector Addition Systems

Jérôme Leroux , Vincent Penelle , Grégoire Sutre

LICS 2013, Jun 2013, New Orleans, LA, United States. pp.43-52, ⟨10.1109/LICS.2013.9⟩

Communication dans un congrès hal-00788744v2
Deposit thumbnail

A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness

Jérôme Leroux , M. Praveen , Grégoire Sutre

CONCUR 2013 - 24th International Conference on Concurrency Theory, Aug 2013, Buenos Aires, Argentina. pp.137-151, ⟨10.1007/978-3-642-40184-8_11⟩

Communication dans un congrès hal-00851915v1
Deposit thumbnail

Presburger Vector Addition Systems

Jérôme Leroux

LICS, Jun 2013, New Orleans, United States. pp.23-32, ⟨10.1109/LICS.2013.7⟩

Communication dans un congrès hal-00780462v2
Deposit thumbnail

Vector Addition Systems Reachability Problem (A Simpler Solution)

Jérôme Leroux

The Alan Turing Centenary Conference, Jun 2012, Manchester, United Kingdom. pp.214-228

Communication dans un congrès hal-00674970v3
Deposit thumbnail

The Vector Addition System Reversible Reachability Problem

Jérôme Leroux

CONCUR 2011 - Concurrency Theory, 22th International Conference, Aachen, Germany, 5-10 September, 2011, Proceedings, Sep 2011, Aachen, Germany. pp.327-341, ⟨10.1007/978-3-642-23217-6_22⟩

Communication dans un congrès hal-00599757v1
Deposit thumbnail

Vector Addition System Reachability Problem: A Short Self-contained Proof

Jérôme Leroux

Language and Automata Theory and Applications - 5th International Conference, LATA 2011, Tarragona, Spain, May 26-31, 2011. Proceedings, May 2011, Taragonne, Spain. pp.41-64, ⟨10.1007/978-3-642-21254-3_3⟩

Communication dans un congrès hal-00599756v1
Deposit thumbnail

The BINCOA Framework for Binary Code Analysis

Sebastien Bardin , Philippe Herrman , Jérôme Leroux , Olivier Ly , Renaud Tabary et al.

Computer Aided Verification, 2011, United Kingdom. pp.165-170, ⟨10.1007/978-3-642-22110-1_13⟩

Communication dans un congrès hal-01006499v1
Deposit thumbnail

Vector Addition System Reachability Problem (A Short Self-Contained Proof)

Jérôme Leroux

Principles of Programming Languages, Jan 2011, Austin, TX, United States. pp.307--316, ⟨10.1145/1926385.1926421⟩

Communication dans un congrès hal-00502865v4

Reachability Analysis of Communicating Pushdown Systems

Alexander Heussner , Jérôme Leroux , Anca Muscholl , Grégoire Sutre

FOSSACS 2010, 2010, Cyprus. pp.267-281, ⟨10.1007/978-3-642-12032-9_19⟩

Communication dans un congrès hal-00527648v1
Deposit thumbnail

Place-Boundedness for Vector Addition Systems with one zero-test

Rémi Bonnet , Alain Finkel , Jérôme Leroux , Marc Zeitoun

FSTTCS 2010, Dec 2010, India. pp.192--203

Communication dans un congrès hal-00948975v1
Deposit thumbnail

A Generalization of Semenov's Theorem to Automata over Real Numbers

Bernard Boigelot , Julien Brusten , Jérôme Leroux

Automated Deduction, 22nd International Conference, CADE 2009, Aug 2009, Montréal, Canada. pp.469-484, ⟨10.1007/978-3-642-02959-2_34⟩

Communication dans un congrès hal-00414753v1
Deposit thumbnail

TaPAS : The Talence Presburger Arithmetic Suite

Jérôme Leroux , Gérald Point

TACAS, 2009, York, United Kingdom. pp.182-185, ⟨10.1007/978-3-642-00768-2⟩

Communication dans un congrès hal-00368653v1
Deposit thumbnail

Polynomial Precise Interval Analysis Revisited

Thomas Gawlitza , Jérôme Leroux , Jan Reineke , Helmut Seidl , Grégoire Sutre et al.

Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, Aug 2009, Saarbrücken, Germany. pp.422-437, ⟨10.1007/978-3-642-03456-5_28⟩

Communication dans un congrès hal-00414750v1
Deposit thumbnail

The General Vector Addition System Reachability Problem by Presburger Inductive Invariants

Jérôme Leroux

Logic in Computer Science (LICS 2009), Aug 2009, Los Angeles, United States. pp.4-13

Communication dans un congrès hal-00272667v12
Deposit thumbnail

Decomposition of Decidable First-Order Logics over Integers and Reals

Florent Bouchy , Alain Finkel , Jérôme Leroux

Temporal Representation and Reasoning, 2008. TIME '08. 15th International Symposium on, 2008, Montreal, QC, Canada. pp.147-155, ⟨10.1109/TIME.2008.22⟩

Communication dans un congrès hal-00345998v1
Deposit thumbnail

Accelerating Interpolation-Based Model-Checking

Nicolas Caniart , Emmanuel Fleury , Jérôme Leroux , Marc Zeitoun

14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'08), 2008, Budapest, Hungary. pp.428-442, ⟨10.1007/978-3-540-78800-3_32⟩

Communication dans un congrès hal-00350416v1
Deposit thumbnail

Convex Hull of Arithmetic Automata

Jérôme Leroux

Static Analysis, 2008, Valencia, Spain. pp.47-61, ⟨10.1007/978-3-540-69166-2_4⟩

Communication dans un congrès hal-00346001v1
Deposit thumbnail

Accelerated Data-Flow Analysis

Jérôme Leroux , Grégoire Sutre

Static Analysis, 2007, Kongens Lyngby, Denmark. pp.184-199, ⟨10.1007/978-3-540-74061-2_12⟩

Communication dans un congrès hal-00346005v1
Deposit thumbnail

Acceleration in Convex Data-Flow Analysis

Jérôme Leroux , Grégoire Sutre

FSTTCS, 2007, New Delhi, India. pp.520-531, ⟨10.1007/978-3-540-77050-3_43⟩

Communication dans un congrès hal-00346295v1
Deposit thumbnail

FAST Extended Release

Sébastien Bardin , Jérôme Leroux , Gérald Point

Computer Aided Verification, CAV'06, Aug 2006, Seattle, WA, United States. pp.63-66

Communication dans un congrès hal-00344195v1
Deposit thumbnail

Flat Counter Automata Almost Everywhere!

Jérôme Leroux , Grégoire Sutre

Third International Symposium, ATVA 2005, 2005, Taipei, Taiwan. pp.489-503, ⟨10.1007/11562948_36⟩

Communication dans un congrès hal-00346310v1
Deposit thumbnail

Flat Acceleration in Symbolic Model Checking

Sébastien Bardin , Alain Finkel , Jérôme Leroux , Philippe Schnoebelen

Third International Symposium, ATVA 2005, 2005, Taipei, Taiwan. pp.474-488, ⟨10.1007/11562948_35⟩

Communication dans un congrès hal-00346302v1
Deposit thumbnail

A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams

Jérôme Leroux

LICS, 2005, France. pp.147 - 156, ⟨10.1109/LICS.2005.2⟩

Communication dans un congrès hal-00346307v1

FAST: Fast Acceleration of Symbolic Transition Systems

Laure Petrucci , Sébastien Bardin , Alain Finkel , Jérôme Leroux

15th international conference on Computer Aided Verification, 2003, United States. pp.118-121

Communication dans un congrès hal-00084185v1
Deposit thumbnail

Structural Presburger-definable Digit Vector Automata

Jérôme Leroux

[Research Report] PI 1718, 2005

Rapport (rapport de recherche) inria-00000039v1