Jérôme Leroux

	2012
39		Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun: Model Checking Vector Addition Systems with one zero-test CoRR abs/1205.4458: (2012)
	2011
38		Sébastien Bardin, Philippe Herrmann, Jérôme Leroux, Olivier Ly, Renaud Tabary, Aymeric Vincent: The BINCOA Framework for Binary Code Analysis. CAV 2011: 165-170
37		Jérôme Leroux: Vector Addition System Reversible Reachability Problem. CONCUR 2011: 327-341
36		Jérôme Leroux: Vector Addition System Reachability Problem: A Short Self-contained Proof. LATA 2011: 41-64
35		Jérôme Leroux: Vector addition system reachability problem: a short self-contained proof. POPL 2011: 307-316
	2010
34		Alexander Heußner, Jérôme Leroux, Anca Muscholl, Grégoire Sutre: Reachability Analysis of Communicating Pushdown Systems. FOSSACS 2010: 267-281
33		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
32		Daniel Kroening, Jérôme Leroux, Philipp Rümmer: Interpolating Quantifier-Free Presburger Arithmetic. LPAR (Yogyakarta) 2010: 489-503
31		Jérôme Leroux: The General Vector Addition System Reachability Problem by Presburger Inductive Invariants Logical Methods in Computer Science 6(3): (2010)
	2009
30		Bernard Boigelot, Julien Brusten, Jérôme Leroux: A Generalization of Semenov's Theorem to Automata over Real Numbers. CADE 2009: 469-484
29		Thomas Gawlitza, Jérôme Leroux, Jan Reineke, Helmut Seidl, Grégoire Sutre, Reinhard Wilhelm: Polynomial Precise Interval Analysis Revisited. Efficient Algorithms 2009: 422-437
28		Jérôme Leroux: The General Vector Addition System Reachability Problem by Presburger Inductive Invariants. LICS 2009: 4-13
27		Jérôme Leroux, Gérald Point: TaPAS: The Talence Presburger Arithmetic Suite. TACAS 2009: 182-185
	2008
26		Jérôme Leroux: Convex Hull of Arithmetic Automata. SAS 2008: 47-61
25		Nicolas Caniart, Emmanuel Fleury, Jérôme Leroux, Marc Zeitoun: Accelerating Interpolation-Based Model-Checking. TACAS 2008: 428-442
24		Florent Bouchy, Alain Finkel, Jérôme Leroux: Decomposition of Decidable First-Order Logics over Integers and Reals. TIME 2008: 147-155
23		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		Florent Bouchy, Alain Finkel, Jérôme Leroux: Decomposition of Decidable First-Order Logics over Integers and Reals CoRR abs/0812.1967: (2008)
21		Jérôme Leroux, Grégoire Sutre: Accelerated Data-Flow Analysis CoRR abs/0812.2011: (2008)
20		Jérôme Leroux: Convex Hull of Arithmetic Automata CoRR abs/0812.2014: (2008)
19		Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci: FAST: acceleration from theory to practice. STTT 10(5): 401-424 (2008)
18		Jérôme Leroux: Structural Presburger digit vector automata. Theor. Comput. Sci. 409(3): 549-556 (2008)
	2007
17		Jérôme Leroux, Grégoire Sutre: Acceleration in Convex Data-Flow Analysis. FSTTCS 2007: 520-531
16		Jérôme Leroux, Grégoire Sutre: Accelerated Data-Flow Analysis. SAS 2007: 184-199
	2006
15		Sébastien Bardin, Jérôme Leroux, Gérald Point: FAST Extended Release. CAV 2006: 63-66
14		Jérôme Leroux, Grégoire Sutre: Flat counter automata almost everywhere!. Software Verification: Infinite-State Model Checking and Static Program Analysis 2006
13		Jérôme Leroux: Least Significant Digit First Presburger Automata CoRR abs/cs/0612037: (2006)
	2005
12		Sébastien Bardin, Alain Finkel, Jérôme Leroux, Ph. Schnoebelen: Flat Acceleration in Symbolic Model Checking. ATVA 2005: 474-488
11		Jérôme Leroux, Grégoire Sutre: Flat Counter Automata Almost Everywhere! ATVA 2005: 489-503
10		Jérôme Leroux: A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams. LICS 2005: 147-156
9		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		Jérôme Leroux: Disjunctive Invariants for Numerical Systems. ATVA 2004: 93-107
7		Alain Finkel, Jérôme Leroux: Image Computation in Infinite State Model Checking. CAV 2004: 361-371
6		Jérôme Leroux, Grégoire Sutre: On Flatness for 2-Dimensional Vector Addition Systems with States. CONCUR 2004: 402-416
5		Alain Finkel, Jérôme Leroux: Polynomial Time Image Computation with Interval-Definable Counters Systems. SPIN 2004: 182-197
4		Sébastien Bardin, Alain Finkel, Jérôme Leroux: FASTer Acceleration of Counter Automata in Practice. TACAS 2004: 576-590
3		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		Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci: FAST: Fast Acceleration of Symbolikc Transition Systems. CAV 2003: 118-121
	2002
1		Alain Finkel, Jérôme Leroux: How to Compose Presburger-Accelerations: Applications to Broadcast Protocols. FSTTCS 2002: 145-156

Coauthor Index

1	Sébastien Bardin	[2] [4] [12] [15] [19] [38]
2	Bernard Boigelot	[30]
3	Rémi Bonnet	[33] [39]
4	Florent Bouchy	[22] [24]
5	Julien Brusten	[30]
6	Nicolas Caniart	[25]
7	Alain Finkel	[1] [2] [4] [5] [7] [9] [12] [19] [22] [23] [24] [33] [39]
8	Emmanuel Fleury	[25]
9	Thomas Gawlitza (Thomas Martin Gawlitza)	[29]
10	Philippe Herrmann	[38]
11	Alexander Heußner	[34]
12	Daniel Kroening (Daniel Kröning)	[32]
13	Olivier Ly	[38]
14	Anca Muscholl	[34]
15	Laure Petrucci (Laure Petrucci-Dauchy)	[2] [19]
16	Gérald Point	[15] [27]
17	Jan Reineke	[29]
18	Philipp Rümmer	[32]
19	Ph. Schnoebelen (Philippe Schnoebelen)	[12]
20	Helmut Seidl	[29]
21	Grégoire Sutre	[6] [11] [14] [16] [17] [21] [29] [34]
22	Renaud Tabary	[38]
23	Aymeric Vincent	[38]
24	Reinhard Wilhelm	[29]
25	Marc Zeitoun	[25] [33] [39]

Colors in the list of coauthors

Last update Mon Jun 4 20:40:43 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page