BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Australia
1 × Brazil
1 × Czech Republic
1 × Germany
1 × Israel
1 × Japan
1 × Poland
1 × Portugal
1 × United Kingdom
2 × Austria
2 × USA
3 × Spain
Collaborated with:
M.Rusinowitch G.Godoy H.Comon C.Vacher C.P.Sanchez A.Bouhoula Y.Kojima M.Sakai F.Klay H.Comon-Lundh N.Perrin L.Vigneron C.Meyer C.Weidenbach V.Cortier H.Ganzinger M.Veanes L.Barguñó C.Creus A.Caron J.Coquidé M.Dauchet
Talks about:
automata (7) constraint (5) rewrit (5) tree (5) hedg (3) shallow (2) theori (2) system (2) closur (2) rigid (2)

Person: Florent Jacquemard

DBLP DBLP: Jacquemard:Florent

Contributed to:

CADE 20152015
SAC 20152015
LATA 20132013
LICS 20102010
PPDP 20102010
LATA 20092009
RTA 20092009
IJCAR 20082008
RTA 20082008
FoSSaCS 20072007
IJCAR 20062006
ICALP 19991999
RTA 19981998
LICS 19971997
RTA 19961996
ICALP 19941994

Wrote 16 papers:

CADE-2015-JacquemardKS #bottom-up #constraints #term rewriting
Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies (FJ, YK, MS), pp. 137–151.
SAC-2015-SanchezJ #interactive #modelling #music #testing
Model based testing of an interactive music system (CPS, FJ), pp. 1759–1764.
LATA-2013-JacquemardR #automaton #term rewriting
Rewrite Closure and CF Hedge Automata (FJ, MR), pp. 371–382.
LICS-2010-BargunoCGJV #automaton #constraints #problem
The Emptiness Problem for Tree Automata with Global Constraints (LB, CC, GG, FJ, CV), pp. 263–272.
PPDP-2010-JacquemardR #verification #xml
Rewrite-based verification of XML updates (FJ, MR), pp. 119–130.
LATA-2009-JacquemardKV #automaton
Rigid Tree Automata (FJ, FK, CV), pp. 446–457.
RTA-2009-GodoyJ #normalisation
Unique Normalization for Shallow TRS (GG, FJ), pp. 63–77.
IJCAR-2008-BouhoulaJ #automation #automaton #induction
Automated Induction with Constrained Tree Automata (AB, FJ), pp. 539–554.
Closure of Hedge-Automata Languages by Hedge Rewriting (FJ, MR), pp. 157–171.
FoSSaCS-2007-Comon-LundhJP #automaton #constraints #memory management
Tree Automata with Memory, Visibility and Structural Constraints (HCL, FJ, NP), pp. 168–182.
IJCAR-2006-JacquemardRV #automaton #constraints #equation #similarity
Tree Automata with Equality Constraints Modulo Equational Theories (FJ, MR, LV), pp. 557–571.
ICALP-1999-CortierGJV #decidability #reachability
Decidable Fragments of Simultaneous Rigid Reachability (VC, HG, FJ, MV), pp. 250–260.
RTA-1998-JacquemardMW #equation #unification
Unification in Extension of Shallow Equational Theories (FJ, CM, CW), pp. 76–90.
Ground Reducibility is EXPTIME-Complete (HC, FJ), pp. 26–34.
RTA-1996-Jacquemard #approximate #decidability #term rewriting
Decidable Approximations of Term Rewriting Systems (FJ), pp. 362–376.
ICALP-1994-CaronCCDJ #constraints
Pumping, Cleaning and Symbolic Constraints Solving (ACC, HC, JLC, MD, FJ), pp. 436–449.

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.