Search results for "Jérôme Leroux"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Jérôme Leroux	Vector Addition System Reversible Reachability Problem.	CONCUR	2011	DBLP DOI BibTeX RDF
1	Jérôme Leroux	Vector Addition System Reachability Problem: A Short Self-contained Proof.	LATA	2011	DBLP DOI BibTeX RDF
1	Jérôme Leroux	Vector addition system reachability problem: a short self-contained proof.	POPL	2011	DBLP DOI BibTeX RDF
1	Sébastien Bardin, Philippe Herrmann, Jérôme Leroux, Olivier Ly, Renaud Tabary, Aymeric Vincent	The BINCOA Framework for Binary Code Analysis.	CAV	2011	DBLP DOI BibTeX RDF
1	Jérôme Leroux	The General Vector Addition System Reachability Problem by Presburger Inductive Invariants	Logical Methods in Computer Science	2010	DBLP DOI BibTeX RDF
1	Daniel Kroening, Jérôme Leroux, Philipp Rümmer	Interpolating Quantifier-Free Presburger Arithmetic.	LPAR (Yogyakarta)	2010	DBLP DOI BibTeX RDF
1	Alexander Heußner, Jérôme Leroux, Anca Muscholl, Grégoire Sutre	Reachability Analysis of Communicating Pushdown Systems.	FOSSACS	2010	DBLP DOI BibTeX RDF
1	Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun	Place-Boundedness for Vector Addition Systems with one zero-test.	FSTTCS	2010	DBLP DOI BibTeX RDF
1	Bernard Boigelot, Julien Brusten, Jérôme Leroux	A Generalization of Semenov's Theorem to Automata over Real Numbers.	CADE	2009	DBLP DOI BibTeX RDF
1	Jérôme Leroux, Gérald Point	TaPAS: The Talence Presburger Arithmetic Suite.	TACAS	2009	DBLP DOI BibTeX RDF
1	Thomas Gawlitza, Jérôme Leroux, Jan Reineke, Helmut Seidl, Grégoire Sutre, Reinhard Wilhelm	Polynomial Precise Interval Analysis Revisited.	Efficient Algorithms	2009	DBLP DOI BibTeX RDF
1	Jérôme Leroux	The General Vector Addition System Reachability Problem by Presburger Inductive Invariants.	LICS	2009	DBLP DOI BibTeX RDF
1	Jérôme Leroux	Structural Presburger digit vector automata.	Theor. Comput. Sci.	2008	DBLP DOI BibTeX RDF
1	Florent Bouchy, Alain Finkel, Jérôme Leroux	Decomposition of Decidable First-Order Logics over Integers and Reals	CoRR	2008	DBLP BibTeX RDF
1	Jérôme Leroux	Convex Hull of Arithmetic Automata	CoRR	2008	DBLP BibTeX RDF
1	Jérôme Leroux, Grégoire Sutre	Accelerated Data-Flow Analysis	CoRR	2008	DBLP BibTeX RDF
1	Alain Finkel, Jérôme Leroux	The convex hull of a regular set of integer vectors is polyhedral and effectively computable	CoRR	2008	DBLP BibTeX RDF
1	Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci	FAST: acceleration from theory to practice.	STTT	2008	DBLP DOI BibTeX RDF	Counter systems, Infinite reachability set, Acceleration, Symbolic representation
1	Florent Bouchy, Alain Finkel, Jérôme Leroux	Decomposition of Decidable First-Order Logics over Integers and Reals.	TIME	2008	DBLP DOI BibTeX RDF
1	Nicolas Caniart, Emmanuel Fleury, Jérôme Leroux, Marc Zeitoun	Accelerating Interpolation-Based Model-Checking.	TACAS	2008	DBLP DOI BibTeX RDF
1	Jérôme Leroux	Convex Hull of Arithmetic Automata.	SAS	2008	DBLP DOI BibTeX RDF
1	Jérôme Leroux, Grégoire Sutre	Accelerated Data-Flow Analysis.	SAS	2007	DBLP DOI BibTeX RDF
1	Jérôme Leroux, Grégoire Sutre	Acceleration in Convex Data-Flow Analysis.	FSTTCS	2007	DBLP DOI BibTeX RDF
1	Jérôme Leroux	Least Significant Digit First Presburger Automata	CoRR	2006	DBLP BibTeX RDF
1	Jérôme Leroux, Grégoire Sutre	Flat counter automata almost everywhere!.	Software Verification: Infinite-State Model Checking and Static Program Analysis	2006	DBLP BibTeX RDF
1	Sébastien Bardin, Jérôme Leroux, Gérald Point	FAST Extended Release.	CAV	2006	DBLP DOI BibTeX RDF	counter systems verification, generic Presburger interface, automata with cache computation, acceleration
1	Alain Finkel, Jérôme Leroux	The convex hull of a regular set of integer vectors is polyhedral and effectively computable.	Inf. Process. Lett.	2005	DBLP DOI BibTeX RDF
1	Jérôme Leroux, Grégoire Sutre	Flat Counter Automata Almost Everywhere!	ATVA	2005	DBLP DOI BibTeX RDF
1	Sébastien Bardin, Alain Finkel, Jérôme Leroux, Ph. Schnoebelen	Flat Acceleration in Symbolic Model Checking.	ATVA	2005	DBLP DOI BibTeX RDF	verification of infinite-state systems, acceleration, symbolic model checking
1	Jérôme Leroux	A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams.	LICS	2005	DBLP DOI BibTeX RDF
1	Jérôme Leroux	The Affine Hull of a Binary Automaton is Computable in Polynomial Time.	Electr. Notes Theor. Comput. Sci.	2004	DBLP DOI BibTeX RDF
1	Jérôme Leroux, Grégoire Sutre	On Flatness for 2-Dimensional Vector Addition Systems with States.	CONCUR	2004	DBLP DOI BibTeX RDF
1	Sébastien Bardin, Alain Finkel, Jérôme Leroux	FASTer Acceleration of Counter Automata in Practice.	TACAS	2004	DBLP DOI BibTeX RDF	counter automata, convex translation, TTP protocol, acceleration, reachability set
1	Jérôme Leroux	Disjunctive Invariants for Numerical Systems.	ATVA	2004	DBLP DOI BibTeX RDF
1	Alain Finkel, Jérôme Leroux	Polynomial Time Image Computation with Interval-Definable Counters Systems.	SPIN	2004	DBLP DOI BibTeX RDF
1	Alain Finkel, Jérôme Leroux	Image Computation in Infinite State Model Checking.	CAV	2004	DBLP DOI BibTeX RDF
1	Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci	FAST: Fast Acceleration of Symbolikc Transition Systems.	CAV	2003	DBLP DOI BibTeX RDF
1	Alain Finkel, Jérôme Leroux	How to Compose Presburger-Accelerations: Applications to Broadcast Protocols.	FSTTCS	2002	DBLP DOI BibTeX RDF	Presburger model checking, verification, acceleration, infinite-state systems, reachability set

Publications of "Jérôme Leroux" ( http://dblp.L3S.de/Authors/Jérôme_Leroux )