Jérôme Leroux
83
Documents
Publications
- 1
- 2
- 2
- 4
- 5
- 5
- 5
- 4
- 6
- 7
- 4
- 6
- 5
- 4
- 4
- 4
- 5
- 2
- 2
- 5
- 1
|
A State-of-the-Art Karp-Miller Algorithm Certified in Coq30th 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⟩
Conference papers
hal-04601324v1
|
The Semilinear Home-Space Problem Is Ackermann-Complete for Petri Nets34th International Conference on Concurrency Theory, {CONCUR} 2023, Sep 2023, Antwerp, Belgium. pp.36:1--36:17, ⟨10.4230/LIPICS.CONCUR.2023.36⟩
Conference papers
hal-04286925v1
|
|
|
The Reachability Problem for Petri Nets is Not Primitive Recursive2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), Feb 2022, Denver, France. pp.1241-1252, ⟨10.1109/FOCS52979.2021.00121⟩
Conference papers
hal-03863832v1
|
State Complexity of Protocols with LeadersPODC '22: ACM Symposium on Principles of Distributed Computing, 2022, Salerno, Italy. pp.257-264, ⟨10.1145/3519270.3538421⟩
Conference papers
hal-03863775v1
|
|
|
Flat Petri Nets (Invited Talk)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⟩
Conference papers
hal-03436231v1
|
New Algorithms for Combinations of Objectives using Separating AutomataGandALF 2021 : International Symposium on Games, Automata, Logics, and Formal Verification, Sep 2021, Padua, Italy. pp.227-240, ⟨10.4204/EPTCS.346.15⟩
Conference papers
hal-04286737v1
|
|
Reachability in Fixed Dimension Vector Addition Systems with States31st International Conference on Concurrency Theory, {CONCUR} 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference), Sep 2020, Vienna, Austria. pp.48:1--48:21
Conference papers
hal-03052567v1
|
|
|
Efficient Analysis of VASS Termination ComplexityLICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken, Germany. pp.676-688
Conference papers
hal-03052592v1
|
|
When Reachability Meets GrzegorczykLICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken, Germany. pp.1-6
Conference papers
hal-03052576v1
|
Reachability in Two-Dimensional Vector Addition Systems with States: One Test Is for FreeCONCUR 2020 - 31st International Conference on Concurrency Theory, Sep 2020, Vienne, Austria. pp.37:1-37:17, ⟨10.4230/LIPIcs.CONCUR.2020.37⟩
Conference papers
hal-03030982v1
|
|
Petri Net Reachability Problem (Invited Talk)44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), 2019, Aachen, Germany
Conference papers
hal-02390621v1
|
|
The reachability problem for Petri nets is not elementaryProceedings 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⟩
Conference papers
hal-02390629v1
|
|
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed DimensionLICS 2019, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1--13, ⟨10.1109/LICS.2019.8785796⟩
Conference papers
hal-02267524v1
|
|
|
Distance Between Mutually Reachable Petri Net Configurations39th {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2019, December 11-13, 2019, Bombay, India, Nov 2019, Bombay, India
Conference papers
hal-02156549v1
|
|
Polynomial Vector Addition Systems With States45th 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
Conference papers
hal-01711089v1
|
|
Reachability for Two-Counter Machines with One Test and One ResetFSTTCS 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⟩
Conference papers
hal-01848554v2
|
Polynomial Vector Addition Systems With States45th 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⟩
Conference papers
hal-02391837v1
|
|
|
Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with StatesPETRI 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⟩
Conference papers
hal-01792566v1
|
|
Backward coverability with pruning for lossy channel systemsSPIN 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⟩
Conference papers
hal-02391841v1
|
|
Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension OneInternational Colloquium on Automata, Languages, and Programming (ICALP), Jul 2017, Varsovie, Poland. pp.119, ⟨10.4230/LIPIcs.ICALP.2017.119⟩
Conference papers
hal-01688742v1
|
Linear combinations of unordered data vectors2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2017, Reykjavik, France. pp.1-11, ⟨10.1109/LICS.2017.8005065⟩
Conference papers
hal-02391839v1
|
|
Occam's Razor Applied to the Petri Net Coverability ProblemRP 2016 - 10th International Workshop on Reachability Problems, Sep 2016, Aalborg, Denmark. pp.77-89, ⟨10.1007/978-3-319-45994-3_6⟩
Conference papers
hal-02391865v1
|
|
Ideal Decompositions for Vector Addition SystemsSTACS 2016 - 33rd Symposium on Theoretical Aspects of Computer Science, 2016, Orléans, France. pp.1--13, ⟨10.4230/LIPIcs.STACS.2016.1⟩
Conference papers
hal-01275991v1
|
|
|
Coverability Trees for Petri Nets with Unordered DataFoSSaCS, 2016, Eindhoven, Netherlands. pp.445--461, ⟨10.1007/978-3-662-49630-5_26⟩
Conference papers
hal-01252674v1
|
Model Checking Population Protocols36th {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⟩
Conference papers
hal-02391850v1
|
|
On Boundedness Problems for Pushdown Vector Addition SystemsRP 2015 - 9th International Workshop on Reachability Problems, Sep 2015, Varsovie, Poland. pp.101-113, ⟨10.1007/978-3-319-24537-9_10⟩
Conference papers
hal-02391887v1
|
|
|
UAV sensing of coastal cliff topography for rock fall hazard applicationsJournées Aléas Gravitaires JAG 2015, Sep 2015, Caen, France
Conference papers
hal-01180649v1
|
On the Coverability Problem for Pushdown Vector Addition Systems in One DimensionICALP 2015 - 42nd International Colloquium on Automata, Languages, and Programming, Jul 2015, Kyoto, Japan. pp.324-336, ⟨10.1007/978-3-662-47666-6_26⟩
Conference papers
hal-02391883v1
|
|
Demystifying Reachability in Vector Addition SystemsLICS 2015, Jul 2015, Kyoto, Japan. pp.56--67, ⟨10.1109/LICS.2015.16⟩
Conference papers
hal-01168388v1
|
|
Verification of Population Protocols26th International Conference on Concurrency Theory, {CONCUR} 2015, Madrid, Spain, September 1.4, 2015, 2015, Madrid, Spain. ⟨10.4230/LIPIcs.CONCUR.2015.470⟩
Conference papers
hal-02391875v1
|
|
|
On Functions Weakly Computable by Petri Nets and Vector Addition SystemsReachability Problems - 8th International Workshop, {RP} 2014, Sep 2014, Oxford, United Kingdom. pp.190 - 202, ⟨10.1007/978-3-319-11439-2_15⟩
Conference papers
hal-01084971v1
|
|
Hyper-Ackermannian Bounds for Pushdown Vector Addition SystemsCSL-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⟩
Conference papers
hal-00989109v1
|
|
The Context-Freeness Problem Is coNP-Complete for Flat Counter SystemsATVA'14, Nov 2014, Sydney, Australia. pp.248 - 263, ⟨10.1007/978-3-319-11936-6_19⟩
Conference papers
hal-01084819v1
|
|
On the Context-Freeness Problem for Vector Addition SystemsLICS 2013, Jun 2013, New Orleans, LA, United States. pp.43-52, ⟨10.1109/LICS.2013.9⟩
Conference papers
hal-00788744v2
|
|
Acceleration For Presburger Petri NetsVPT@CAV, 2013, Saint Petersbourg, Russia. pp.10-12
Conference papers
hal-00959699v1
|
|
Acceleration for Petri NetsATVA, 2013, Hanoi, Vietnam. pp.1-4, ⟨10.1007/978-3-319-02444-8_1⟩
Conference papers
hal-00959698v1
|
|
Presburger Vector Addition SystemsLICS, Jun 2013, New Orleans, United States. pp.23-32, ⟨10.1109/LICS.2013.7⟩
Conference papers
hal-00780462v2
|
|
A Relational Trace Logic for Vector Addition Systems with Application to Context-FreenessCONCUR 2013 - 24th International Conference on Concurrency Theory, Aug 2013, Buenos Aires, Argentina. pp.137-151, ⟨10.1007/978-3-642-40184-8_11⟩
Conference papers
hal-00851915v1
|
|
Vector Addition Systems Reachability Problem (A Simpler Solution)The Alan Turing Centenary Conference, Jun 2012, Manchester, United Kingdom. pp.214-228
Conference papers
hal-00674970v3
|
|
The BINCOA Framework for Binary Code AnalysisComputer Aided Verification, 2011, United Kingdom. pp.165-170, ⟨10.1007/978-3-642-22110-1_13⟩
Conference papers
hal-01006499v1
|
|
The Vector Addition System Reversible Reachability ProblemCONCUR 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⟩
Conference papers
hal-00599757v1
|
|
Vector Addition System Reachability Problem: A Short Self-contained ProofLanguage 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⟩
Conference papers
hal-00599756v1
|
|
Vector Addition System Reachability Problem (A Short Self-Contained Proof)Principles of Programming Languages, Jan 2011, Austin, TX, United States. pp.307--316, ⟨10.1145/1926385.1926421⟩
Conference papers
hal-00502865v4
|
Reachability Analysis of Communicating Pushdown SystemsFOSSACS 2010, 2010, Cyprus. pp.267-281, ⟨10.1007/978-3-642-12032-9_19⟩
Conference papers
hal-00527648v1
|
|
|
Place-Boundedness for Vector Addition Systems with one zero-testFSTTCS 2010, Dec 2010, India. pp.192--203
Conference papers
hal-00948975v1
|
|
Polynomial Precise Interval Analysis RevisitedEssays 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⟩
Conference papers
hal-00414750v1
|
|
The General Vector Addition System Reachability Problem by Presburger Inductive InvariantsLogic in Computer Science (LICS 2009), Aug 2009, Los Angeles, United States. pp.4-13
Conference papers
hal-00272667v12
|
|
A Generalization of Semenov's Theorem to Automata over Real NumbersAutomated Deduction, 22nd International Conference, CADE 2009, Aug 2009, Montréal, Canada. pp.469-484, ⟨10.1007/978-3-642-02959-2_34⟩
Conference papers
hal-00414753v1
|
|
TaPAS : The Talence Presburger Arithmetic SuiteTACAS, 2009, York, United Kingdom. pp.182-185, ⟨10.1007/978-3-642-00768-2⟩
Conference papers
hal-00368653v1
|
|
Accelerating Interpolation-Based Model-Checking14th 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⟩
Conference papers
hal-00350416v1
|
|
Decomposition of Decidable First-Order Logics over Integers and RealsTemporal Representation and Reasoning, 2008. TIME '08. 15th International Symposium on, 2008, Montreal, QC, Canada. pp.147-155, ⟨10.1109/TIME.2008.22⟩
Conference papers
hal-00345998v1
|
|
Convex Hull of Arithmetic AutomataStatic Analysis, 2008, Valencia, Spain. pp.47-61, ⟨10.1007/978-3-540-69166-2_4⟩
Conference papers
hal-00346001v1
|
|
Acceleration in Convex Data-Flow AnalysisFSTTCS, 2007, New Delhi, India. pp.520-531, ⟨10.1007/978-3-540-77050-3_43⟩
Conference papers
hal-00346295v1
|
|
Accelerated Data-Flow AnalysisStatic Analysis, 2007, Kongens Lyngby, Denmark. pp.184-199, ⟨10.1007/978-3-540-74061-2_12⟩
Conference papers
hal-00346005v1
|
|
FAST Extended ReleaseComputer Aided Verification, CAV'06, Aug 2006, Seattle, WA, United States. pp.63-66
Conference papers
hal-00344195v1
|
|
Flat Counter Automata Almost Everywhere!Third International Symposium, ATVA 2005, 2005, Taipei, Taiwan. pp.489-503, ⟨10.1007/11562948_36⟩
Conference papers
hal-00346310v1
|
|
Flat Acceleration in Symbolic Model CheckingThird International Symposium, ATVA 2005, 2005, Taipei, Taiwan. pp.474-488, ⟨10.1007/11562948_35⟩
Conference papers
hal-00346302v1
|
|
A Polynomial Time Presburger Criterion and Synthesis for Number Decision DiagramsLICS, 2005, France. pp.147 - 156, ⟨10.1109/LICS.2005.2⟩
Conference papers
hal-00346307v1
|
FAST: Fast Acceleration of Symbolic Transition Systems15th international conference on Computer Aided Verification, 2003, United States. pp.118-121
Conference papers
hal-00084185v1
|
Modeling rates of bank erosion in sinuous tidal channel derived from event-based terrestrial lidar surveys in the Mont Saint Michel BayAGU Fall Meeting 2012, Dec 2012, San Francisco, United States. 2012
Conference poster
insu-01113327v1
|
Informatique Mathématique Une photographie en 20202020
Books
hal-03431823v1
|
|
Reachability Problems - 6th International Workshop, RP 2012Spinger, pp.150, 2012, 978-3-642-33511-2. ⟨10.1007/978-3-642-33512-9⟩
Books
hal-00760303v1
|
|
Reachability Analysis of Communicating Pushdown Systems2010
Preprints, Working Papers, ...
hal-00443529v1
|
|
Least Significant Digit First Presburger Automata2006
Preprints, Working Papers, ...
hal-00118748v1
|
|
Structural Presburger-definable Digit Vector Automata[Research Report] PI 1718, 2005
Reports
inria-00000039v1
|