| 2009 |
|---|
| 27 | EE | Jérôme Leroux,
Gérald Point:
TaPAS: The Talence Presburger Arithmetic Suite.
TACAS 2009: 182-185 |
| 2008 |
|---|
| 26 | EE | Jérôme Leroux:
Convex Hull of Arithmetic Automata.
SAS 2008: 47-61 |
| 25 | EE | Nicolas Caniart,
Emmanuel Fleury,
Jérôme Leroux,
Marc Zeitoun:
Accelerating Interpolation-Based Model-Checking.
TACAS 2008: 428-442 |
| 24 | EE | Florent Bouchy,
Alain Finkel,
Jérôme Leroux:
Decomposition of Decidable First-Order Logics over Integers and Reals.
TIME 2008: 147-155 |
| 23 | EE | 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) |
| 22 | EE | Florent Bouchy,
Alain Finkel,
Jérôme Leroux:
Decomposition of Decidable First-Order Logics over Integers and Reals
CoRR abs/0812.1967: (2008) |
| 21 | EE | Jérôme Leroux,
Grégoire Sutre:
Accelerated Data-Flow Analysis
CoRR abs/0812.2011: (2008) |
| 20 | EE | Jérôme Leroux:
Convex Hull of Arithmetic Automata
CoRR abs/0812.2014: (2008) |
| 19 | EE | Sébastien Bardin,
Alain Finkel,
Jérôme Leroux,
Laure Petrucci:
FAST: acceleration from theory to practice.
STTT 10(5): 401-424 (2008) |
| 18 | EE | Jérôme Leroux:
Structural Presburger digit vector automata.
Theor. Comput. Sci. 409(3): 549-556 (2008) |
| 2007 |
|---|
| 17 | EE | Jérôme Leroux,
Grégoire Sutre:
Acceleration in Convex Data-Flow Analysis.
FSTTCS 2007: 520-531 |
| 16 | EE | Jérôme Leroux,
Grégoire Sutre:
Accelerated Data-Flow Analysis.
SAS 2007: 184-199 |
| 2006 |
|---|
| 15 | EE | Sébastien Bardin,
Jérôme Leroux,
Gérald Point:
FAST Extended Release.
CAV 2006: 63-66 |
| 14 | EE | Jérôme Leroux,
Grégoire Sutre:
Flat counter automata almost everywhere!.
Software Verification: Infinite-State Model Checking and Static Program Analysis 2006 |
| 13 | EE | Jérôme Leroux:
Least Significant Digit First Presburger Automata
CoRR abs/cs/0612037: (2006) |
| 2005 |
|---|
| 12 | EE | Sébastien Bardin,
Alain Finkel,
Jérôme Leroux,
Ph. Schnoebelen:
Flat Acceleration in Symbolic Model Checking.
ATVA 2005: 474-488 |
| 11 | EE | Jérôme Leroux,
Grégoire Sutre:
Flat Counter Automata Almost Everywhere!
ATVA 2005: 489-503 |
| 10 | EE | Jérôme Leroux:
A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams.
LICS 2005: 147-156 |
| 9 | EE | 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) |
| 2004 |
|---|
| 8 | EE | Jérôme Leroux:
Disjunctive Invariants for Numerical Systems.
ATVA 2004: 93-107 |
| 7 | EE | Alain Finkel,
Jérôme Leroux:
Image Computation in Infinite State Model Checking.
CAV 2004: 361-371 |
| 6 | EE | Jérôme Leroux,
Grégoire Sutre:
On Flatness for 2-Dimensional Vector Addition Systems with States.
CONCUR 2004: 402-416 |
| 5 | EE | Alain Finkel,
Jérôme Leroux:
Polynomial Time Image Computation with Interval-Definable Counters Systems.
SPIN 2004: 182-197 |
| 4 | EE | Sébastien Bardin,
Alain Finkel,
Jérôme Leroux:
FASTer Acceleration of Counter Automata in Practice.
TACAS 2004: 576-590 |
| 3 | EE | Jérôme Leroux:
The Affine Hull of a Binary Automaton is Computable in Polynomial Time.
Electr. Notes Theor. Comput. Sci. 98: 89-104 (2004) |
| 2003 |
|---|
| 2 | EE | Sébastien Bardin,
Alain Finkel,
Jérôme Leroux,
Laure Petrucci:
FAST: Fast Acceleration of Symbolikc Transition Systems.
CAV 2003: 118-121 |
| 2002 |
|---|
| 1 | EE | Alain Finkel,
Jérôme Leroux:
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols.
FSTTCS 2002: 145-156 |
