BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Canada
1 × Cyprus
1 × Denmark
1 × Hungary
1 × United Kingdom
2 × Japan
3 × Spain
8 × USA
Collaborated with:
∅ G.Sutre S.Bardin A.Finkel G.Point S.Schmitz P.Totzke M.Praveen V.Penelle B.Boigelot J.Brusten A.Heußner A.Muscholl N.Caniart E.Fleury M.Zeitoun L.Petrucci P.Herrmann O.Ly R.Tabary A.Vincent
Talks about:
system (10) vector (8) addit (8) reachabl (5) problem (5) presburg (4) acceler (4) pushdown (3) automata (3) analysi (3)

Person: Jérôme Leroux

DBLP DBLP: Leroux:J=eacute=r=ocirc=me

Contributed to:

ICALP (2) 20152015
LICS 20152015
CSL-LICS 20142014
LICS 20132013
CAV 20112011
LATA 20112011
POPL 20112011
FOSSACS 20102010
CADE 20092009
LICS 20092009
TACAS 20092009
SAS 20082008
TACAS 20082008
SAS 20072007
CAV 20062006
LICS 20052005
CAV 20042004
TACAS 20042004
CAV 20032003

Wrote 20 papers:

ICALP-v2-2015-LerouxST #automaton #on the #problem
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension (JL, GS, PT), pp. 324–336.
LICS-2015-LerouxS #reachability
Demystifying Reachability in Vector Addition Systems (JL, SS), pp. 56–67.
LICS-CSL-2014-LerouxPS #automaton #bound
Hyper-Ackermannian bounds for pushdown vector addition systems (JL, MP, GS), p. 10.
LICS-2013-Leroux
Presburger Vector Addition Systems (JL), pp. 23–32.
LICS-2013-LerouxPS #on the #problem
On the Context-Freeness Problem for Vector Addition Systems (JL, VP, GS), pp. 43–52.
CAV-2011-BardinHLLTV #analysis #framework
The BINCOA Framework for Binary Code Analysis (SB, PH, JL, OL, RT, AV), pp. 165–170.
LATA-2011-Leroux #problem #proving #reachability #self
Vector Addition System Reachability Problem: A Short Self-contained Proof (JL), pp. 41–64.
POPL-2011-Leroux #problem #proving #reachability #self
Vector addition system reachability problem: a short self-contained proof (JL), pp. 307–316.
FoSSaCS-2010-HeussnerLMS #analysis #automaton #communication #reachability
Reachability Analysis of Communicating Pushdown Systems (AH, JL, AM, GS), pp. 267–281.
CADE-2009-BoigelotBL #automaton #theorem
A Generalization of Semenov’s Theorem to Automata over Real Numbers (BB, JB, JL), pp. 469–484.
LICS-2009-Leroux #induction #invariant #problem #reachability
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants (JL), pp. 4–13.
TACAS-2009-LerouxP #named
TaPAS: The Talence Presburger Arithmetic Suite (JL, GP), pp. 182–185.
SAS-2008-Leroux #automaton
Convex Hull of Arithmetic Automata (JL), pp. 47–61.
TACAS-2008-CaniartFLZ #model checking
Accelerating Interpolation-Based Model-Checking (NC, EF, JL, MZ), pp. 428–442.
SAS-2007-LerouxS #analysis #data flow
Accelerated Data-Flow Analysis (JL, GS), pp. 184–199.
CAV-2006-BardinLP #performance
FAST Extended Release (SB, JL, GP), pp. 63–66.
LICS-2005-Leroux #diagrams #polynomial #synthesis
A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams (JL), pp. 147–156.
CAV-2004-FinkelL #image #infinity #model checking
Image Computation in Infinite State Model Checking (AF, JL), pp. 361–371.
TACAS-2004-BardinFL #automaton #performance
FASTer Acceleration of Counter Automata in Practice (SB, AF, JL), pp. 576–590.
CAV-2003-BardinFLP #named #performance
FAST: Fast Acceleration of Symbolikc Transition Systems (SB, AF, JL, LP), pp. 118–121.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.