| 2009 |
|---|
| 25 | EE | Florent Jacquemard,
Francis Klay,
Camille Vacher:
Rigid Tree Automata.
LATA 2009: 446-457 |
| 24 | EE | Adria Gascón,
Guillem Godoy,
Florent Jacquemard:
Closure of Tree Automata Languages under Innermost Rewriting.
Electr. Notes Theor. Comput. Sci. 237: 23-38 (2009) |
| 2008 |
|---|
| 23 | EE | Adel Bouhoula,
Florent Jacquemard:
Automated Induction with Constrained Tree Automata.
IJCAR 2008: 539-554 |
| 22 | EE | Florent Jacquemard,
Michaël Rusinowitch:
Closure of Hedge-Automata Languages by Hedge Rewriting.
RTA 2008: 157-171 |
| 21 | EE | Hubert Comon-Lundh,
Florent Jacquemard,
Nicolas Perrin:
Visibly Tree Automata with Memory and Constraints
CoRR abs/0804.3065: (2008) |
| 20 | EE | Adel Bouhoula,
Florent Jacquemard:
Automated Induction for Complex Data Structures
CoRR abs/0811.4720: (2008) |
| 19 | EE | Florent Jacquemard,
Michaël Rusinowitch,
Laurent Vigneron:
Tree automata with equality constraints modulo equational theories.
J. Log. Algebr. Program. 75(2): 182-208 (2008) |
| 2007 |
|---|
| 18 | EE | Hubert Comon-Lundh,
Florent Jacquemard,
Nicolas Perrin:
Tree Automata with Memory, Visibility and Structural Constraints.
FoSSaCS 2007: 168-182 |
| 2006 |
|---|
| 17 | EE | Ichiro Mitsuhashi,
Michio Oyamaguchi,
Florent Jacquemard:
The Confluence Problem for Flat TRSs.
AISC 2006: 68-81 |
| 16 | EE | Florent Jacquemard,
Michaël Rusinowitch,
Laurent Vigneron:
Tree Automata with Equality Constraints Modulo Equational Theories.
IJCAR 2006: 557-571 |
| 15 | EE | Olivier Michel,
Florent Jacquemard:
An Analysis of a Public Key Protocol with Membranes.
Applications of Membrane Computing 2006: 283-302 |
| 14 | EE | Stéphanie Delaune,
Florent Jacquemard:
Decision Procedures for the Security of Protocols with Probabilistic Encryption against Offline Dictionary Attacks.
J. Autom. Reasoning 36(1-2): 85-124 (2006) |
| 2004 |
|---|
| 13 | EE | Stéphanie Delaune,
Florent Jacquemard:
A decision procedure for the verification of security protocols with explicit destructors.
ACM Conference on Computer and Communications Security 2004: 278-287 |
| 12 | EE | Stéphanie Delaune,
Florent Jacquemard:
A Theory of Dictionary Attacks and its Complexity.
CSFW 2004: 2-15 |
| 2003 |
|---|
| 11 | EE | Hubert Comon,
Florent Jacquemard:
Ground reducibility is EXPTIME-complete.
Inf. Comput. 187(1): 123-153 (2003) |
| 10 | EE | Florent Jacquemard:
Reachability and confluence are undecidable for flat term rewriting systems.
Inf. Process. Lett. 87(5): 265-270 (2003) |
| 2000 |
|---|
| 9 | EE | Florent Jacquemard,
Michaël Rusinowitch,
Laurent Vigneron:
Compiling and Verifying Security Protocols.
LPAR 2000: 131-160 |
| 8 | | Harald Ganzinger,
Florent Jacquemard,
Margus Veanes:
Rigid Reachability, The Non-Symmetric Form of Rigid E-Unification.
Int. J. Found. Comput. Sci. 11(1): 3-27 (2000) |
| 1999 |
|---|
| 7 | EE | Véronique Cortier,
Harald Ganzinger,
Florent Jacquemard,
Margus Veanes:
Decidable Fragments of Simultaneous Rigid Reachability.
ICALP 1999: 250-260 |
| 1998 |
|---|
| 6 | EE | Harald Ganzinger,
Florent Jacquemard,
Margus Veanes:
Rigid Reachability.
ASIAN 1998: 4-21 |
| 5 | EE | Florent Jacquemard,
Christoph Meyer,
Christoph Weidenbach:
Unification in Extension of Shallow Equational Theories.
RTA 1998: 76-90 |
| 1997 |
|---|
| 4 | EE | Hubert Comon,
Florent Jacquemard:
Ground Reducibility is EXPTIME-Complete.
LICS 1997: 26-34 |
| 1996 |
|---|
| 3 | | Florent Jacquemard:
Decidable Approximations of Term Rewriting Systems.
RTA 1996: 362-376 |
| 1994 |
|---|
| 2 | | Anne-Cécile Caron,
Hubert Comon,
Jean-Luc Coquidé,
Max Dauchet,
Florent Jacquemard:
Pumping, Cleaning and Symbolic Constraints Solving.
ICALP 1994: 436-449 |
| 1 | | Hubert Comon,
Florent Jacquemard:
Ground Reducibility and Automata with Disequality Constraints.
STACS 1994: 151-162 |
