Search the dblp DataBase

Publications of Author

1. Ichiro Mitsuhashi, Michio Oyamaguchi, Florent Jacquemard
   The Confluence Problem for Flat TRSs. [Citation Graph (0, 0)][DBLP]
   AISC, 2006, pp:68-81 [Conf]
   
2. Harald Ganzinger, Florent Jacquemard, Margus Veanes
   Rigid Reachability. [Citation Graph (0, 0)][DBLP]
   ASIAN, 1998, pp:4-21 [Conf]
   
3. Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron
   Tree Automata with Equality Constraints Modulo Equational Theories. [Citation Graph (0, 0)][DBLP]
   IJCAR, 2006, pp:557-571 [Conf]
   
4. Stéphanie Delaune, Florent Jacquemard
   A decision procedure for the verification of security protocols with explicit destructors. [Citation Graph (0, 0)][DBLP]
   ACM Conference on Computer and Communications Security, 2004, pp:278-287 [Conf]
   
5. Stéphanie Delaune, Florent Jacquemard
   A Theory of Dictionary Attacks and its Complexity. [Citation Graph (0, 0)][DBLP]
   CSFW, 2004, pp:2-15 [Conf]
   
6. Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard
   Pumping, Cleaning and Symbolic Constraints Solving. [Citation Graph (0, 0)][DBLP]
   ICALP, 1994, pp:436-449 [Conf]
   
7. Véronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes
   Decidable Fragments of Simultaneous Rigid Reachability. [Citation Graph (0, 0)][DBLP]
   ICALP, 1999, pp:250-260 [Conf]
   
8. Hubert Comon, Florent Jacquemard
   Ground Reducibility is EXPTIME-Complete. [Citation Graph (0, 0)][DBLP]
   LICS, 1997, pp:26-34 [Conf]
   
9. Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron
   Compiling and Verifying Security Protocols. [Citation Graph (0, 0)][DBLP]
   LPAR, 2000, pp:131-160 [Conf]
   
10. Florent Jacquemard
    Decidable Approximations of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1996, pp:362-376 [Conf]
    
11. Florent Jacquemard, Christoph Meyer, Christoph Weidenbach
    Unification in Extension of Shallow Equational Theories. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:76-90 [Conf]
    
12. Hubert Comon, Florent Jacquemard
    Ground Reducibility and Automata with Disequality Constraints. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:151-162 [Conf]
    
13. Hubert Comon, Florent Jacquemard
    Ground reducibility is EXPTIME-complete. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:187, n:1, pp:123-153 [Journal]
    
14. Harald Ganzinger, Florent Jacquemard, Margus Veanes
    Rigid Reachability, The Non-Symmetric Form of Rigid E-Unification. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2000, v:11, n:1, pp:3-27 [Journal]
    
15. Florent Jacquemard
    Reachability and confluence are undecidable for flat term rewriting systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:5, pp:265-270 [Journal]
    
16. Stéphanie Delaune, Florent Jacquemard
    Decision Procedures for the Security of Protocols with Probabilistic Encryption against Offline Dictionary Attacks. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2006, v:36, n:1-2, pp:85-124 [Journal]
    
17. Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin
    Tree Automata with Memory, Visibility and Structural Constraints. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2007, pp:168-182 [Conf]
    
18. 
    Automated Induction with Constrained Tree Automata. [Citation Graph (, )][DBLP]
    
    
19. 
    Automatic verification of conformance of firewall configurations to security policies. [Citation Graph (, )][DBLP]
    
    
20. 
    The Emptiness Problem for Tree Automata with Global Constraints. [Citation Graph (, )][DBLP]
    
    
21. 
    Rewrite-based verification of XML updates. [Citation Graph (, )][DBLP]
    
    
22. 
    Closure of Hedge-Automata Languages by Hedge Rewriting. [Citation Graph (, )][DBLP]
    
    
23. 
    Unique Normalization for Shallow TRS. [Citation Graph (, )][DBLP]
    
    
24. 
    Rigid Tree Automata. [Citation Graph (, )][DBLP]
    
    
25. 
    Visibly Tree Automata with Memory and Constraints [Citation Graph (, )][DBLP]
    
    
26. 
    Automated Induction for Complex Data Structures [Citation Graph (, )][DBLP]
    
    
27. 
    Rewrite based Verification of XML Updates [Citation Graph (, )][DBLP]
    
    
28. 
    Closure of Tree Automata Languages under Innermost Rewriting. [Citation Graph (, )][DBLP]