dblp.uni-trier.dewww.uni-trier.de

Florent Jacquemard Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
29EENihel Ben Youssef, Adel Bouhoula, Florent Jacquemard: Automatic verification of conformance of firewall configurations to security policies. ISCC 2009: 526-531
28EEFlorent Jacquemard, Francis Klay, Camille Vacher: Rigid Tree Automata. LATA 2009: 446-457
27EEGuillem Godoy, Florent Jacquemard: Unique Normalization for Shallow TRS. RTA 2009: 63-77
26EEFlorent Jacquemard, Michaël Rusinowitch: Rewrite based Verification of XML Updates CoRR abs/0907.5125: (2009)
25EEAdria Gascón, Guillem Godoy, Florent Jacquemard: Closure of Tree Automata Languages under Innermost Rewriting. Electr. Notes Theor. Comput. Sci. 237: 23-38 (2009)
2008
24EEAdel Bouhoula, Florent Jacquemard: Automated Induction with Constrained Tree Automata. IJCAR 2008: 539-554
23EEFlorent Jacquemard, Michaël Rusinowitch: Closure of Hedge-Automata Languages by Hedge Rewriting. RTA 2008: 157-171
22EEHubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin: Visibly Tree Automata with Memory and Constraints CoRR abs/0804.3065: (2008)
21EEAdel Bouhoula, Florent Jacquemard: Automated Induction for Complex Data Structures CoRR abs/0811.4720: (2008)
20EEFlorent Jacquemard, Michaël Rusinowitch, Laurent Vigneron: Tree automata with equality constraints modulo equational theories. J. Log. Algebr. Program. 75(2): 182-208 (2008)
19EEHubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin: Visibly Tree Automata with Memory and Constraints. Logical Methods in Computer Science 4(2): (2008)
2007
18EEHubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin: Tree Automata with Memory, Visibility and Structural Constraints. FoSSaCS 2007: 168-182
2006
17EEIchiro Mitsuhashi, Michio Oyamaguchi, Florent Jacquemard: The Confluence Problem for Flat TRSs. AISC 2006: 68-81
16EEFlorent Jacquemard, Michaël Rusinowitch, Laurent Vigneron: Tree Automata with Equality Constraints Modulo Equational Theories. IJCAR 2006: 557-571
15EEOlivier Michel, Florent Jacquemard: An Analysis of a Public Key Protocol with Membranes. Applications of Membrane Computing 2006: 283-302
14EESté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
13EESté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
12EEStéphanie Delaune, Florent Jacquemard: A Theory of Dictionary Attacks and its Complexity. CSFW 2004: 2-15
2003
11EEHubert Comon, Florent Jacquemard: Ground reducibility is EXPTIME-complete. Inf. Comput. 187(1): 123-153 (2003)
10EEFlorent Jacquemard: Reachability and confluence are undecidable for flat term rewriting systems. Inf. Process. Lett. 87(5): 265-270 (2003)
2000
9EEFlorent 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
7EEVéronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes: Decidable Fragments of Simultaneous Rigid Reachability. ICALP 1999: 250-260
1998
6EEHarald Ganzinger, Florent Jacquemard, Margus Veanes: Rigid Reachability. ASIAN 1998: 4-21
5EEFlorent Jacquemard, Christoph Meyer, Christoph Weidenbach: Unification in Extension of Shallow Equational Theories. RTA 1998: 76-90
1997
4EEHubert Comon, Florent Jacquemard: Ground Reducibility is EXPTIME-Complete. LICS 1997: 26-34
1996
3EEFlorent Jacquemard: Decidable Approximations of Term Rewriting Systems. RTA 1996: 362-376
1994
2EEAnne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard: Pumping, Cleaning and Symbolic Constraints Solving. ICALP 1994: 436-449
1EEHubert Comon, Florent Jacquemard: Ground Reducibility and Automata with Disequality Constraints. STACS 1994: 151-162

Coauthor Index

1Adel Bouhoula [21] [24] [29]
2Anne-Cécile Caron [2]
3Hubert Comon-Lundh (Hubert Comon) [1] [2] [4] [11] [18] [19] [22]
4Jean-Luc Coquidé [2]
5Véronique Cortier [7]
6Max Dauchet [2]
7Stéphanie Delaune [12] [13] [14]
8Harald Ganzinger [6] [7] [8]
9Adria Gascón [25]
10Guillem Godoy [25] [27]
11Christoph M. Kirsch (Christoph Meyer) [5]
12Francis Klay [28]
13Olivier Michel [15]
14Ichiro Mitsuhashi [17]
15Michio Oyamaguchi [17]
16Nicolas Perrin [18] [19] [22]
17Michaël Rusinowitch [9] [16] [20] [23] [26]
18Camille Vacher [28]
19Margus Veanes [6] [7] [8]
20Laurent Vigneron [9] [16] [20]
21Christoph Weidenbach [5]
22Nihel Ben Youssef [29]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)