Jérôme Leroux

According to our database1, Jérôme Leroux
  • authored at least 72 papers between 2002 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Verification of population protocols.
Acta Inf., 2017

Backward coverability with pruning for lossy channel systems.
Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, 2017

Linear combinations of unordered data vectors.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Preface.
Fundam. Inform., 2016

Linear Combinations of Unordered Data Vectors.
CoRR, 2016

Occam's Razor Applied to the Petri Net Coverability Problem.
CoRR, 2016

Guiding Craig interpolation with domain-specific abstractions.
Acta Inf., 2016

Ideal Decompositions for Vector Addition Systems (Invited Talk).
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Occam's Razor Applied to the Petri Net Coverability Problem.
Proceedings of the Reachability Problems - 10th International Workshop, 2016

Model Checking Population Protocols.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Coverability Trees for Petri Nets with Unordered Data.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015
Recent and simple algorithms for Petri nets.
Software and System Modeling, 2015

On Boundedness Problems for Pushdown Vector Addition Systems.
CoRR, 2015

On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension.
CoRR, 2015

Reachability in Vector Addition Systems Demystified.
CoRR, 2015

Structurally Cyclic Petri Nets.
Logical Methods in Computer Science, 2015

On Boundedness Problems for Pushdown Vector Addition Systems.
Proceedings of the Reachability Problems - 9th International Workshop, 2015

Demystifying Reachability in Vector Addition Systems.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Verification of Population Protocols.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
Neue, einfache Algorithmen für Petrinetze.
Informatik Spektrum, 2014

On Functions Weakly Computable by Petri Nets and Vector Addition Systems.
Proceedings of the Reachability Problems - 8th International Workshop, 2014

Hyper-Ackermannian bounds for pushdown vector addition systems.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems.
Proceedings of the Automated Technology for Verification and Analysis, 2014

2013
Vector Addition System Reversible Reachability Problem
Logical Methods in Computer Science, 2013

On the Context-Freeness Problem for Vector Addition Systems.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Presburger Vector Addition Systems.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

Acceleration For Presburger Petri Nets.
Proceedings of the First International Workshop on Verification and Program Transformation, 2013

Acceleration for Petri Nets.
Proceedings of the Automated Technology for Verification and Analysis, 2013

2012
Reachability Analysis of Communicating Pushdown Systems
Logical Methods in Computer Science, 2012

Model Checking Vector Addition Systems with one zero-test
Logical Methods in Computer Science, 2012

Vector Addition Systems Reachability Problem (A Simpler Solution).
Proceedings of the Turing-100, 2012

2011
Vector addition system reachability problem: a short self-contained proof.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

Vector Addition System Reachability Problem: A Short Self-contained Proof.
Proceedings of the Language and Automata Theory and Applications, 2011

Vector Addition System Reversible Reachability Problem.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

The BINCOA Framework for Binary Code Analysis.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2010
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
Logical Methods in Computer Science, 2010

Interpolating Quantifier-Free Presburger Arithmetic.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Place-Boundedness for Vector Addition Systems with one zero-test.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Reachability Analysis of Communicating Pushdown Systems.
Proceedings of the Foundations of Software Science and Computational Structures, 2010

2009
TaPAS: The Talence Presburger Arithmetic Suite.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2009

The General Vector Addition System Reachability Problem by Presburger Inductive Invariants.
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

A Generalization of Semenov's Theorem to Automata over Real Numbers.
Proceedings of the Automated Deduction, 2009

Polynomial Precise Interval Analysis Revisited.
Proceedings of the Efficient Algorithms, 2009

2008
Structural Presburger digit vector automata.
Theor. Comput. Sci., 2008

FAST: acceleration from theory to practice.
STTT, 2008

Convex Hull of Arithmetic Automata
CoRR, 2008

Accelerated Data-Flow Analysis
CoRR, 2008

Decomposition of Decidable First-Order Logics over Integers and Reals
CoRR, 2008

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

Decomposition of Decidable First-Order Logics over Integers and Reals.
Proceedings of the 15th International Symposium on Temporal Representation and Reasoning, 2008

Accelerating Interpolation-Based Model-Checking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

Convex Hull of Arithmetic Automata.
Proceedings of the Static Analysis, 15th International Symposium, 2008

2007
Accelerated Data-Flow Analysis.
Proceedings of the Static Analysis, 14th International Symposium, 2007

Acceleration in Convex Data-Flow Analysis.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006
Least Significant Digit First Presburger Automata
CoRR, 2006

Flat counter automata almost everywhere!.
Proceedings of the Software Verification: Infinite-State Model Checking and Static Program Analysis, 19.02., 2006

FAST Extended Release.
Proceedings of the Computer Aided Verification, 18th International Conference, 2006

2005
The convex hull of a regular set of integer vectors is polyhedral and effectively computable.
Inf. Process. Lett., 2005

A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

Flat Counter Automata Almost Everywhere!
Proceedings of the Automated Technology for Verification and Analysis, 2005

Flat Acceleration in Symbolic Model Checking.
Proceedings of the Automated Technology for Verification and Analysis, 2005

2004
The Affine Hull of a Binary Automaton is Computable in Polynomial Time.
Electr. Notes Theor. Comput. Sci., 2004

FASTer Acceleration of Counter Automata in Practice.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

Polynomial Time Image Computation with Interval-Definable Counters Systems.
Proceedings of the Model Checking Software, 2004

On Flatness for 2-Dimensional Vector Addition Systems with States.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

Image Computation in Infinite State Model Checking.
Proceedings of the Computer Aided Verification, 16th International Conference, 2004

Disjunctive Invariants for Numerical Systems.
Proceedings of the Automated Technology for Verification and Analysis: Second International Conference, 2004

2003
FAST: Fast Acceleration of Symbolikc Transition Systems.
Proceedings of the Computer Aided Verification, 15th International Conference, 2003

2002
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols.
Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002


  Loading...