- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j10 |      | Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher: Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories. Logical Methods in Computer Science 9(2) (2013) |
| c23 | | |
| 2012 | ||
| j9 | | Adel Bouhoula, Florent Jacquemard: Sufficient completeness verification for conditional and constrained TRS. J. Applied Logic 10(1): 127-143 (2012) |
| i4 | | Florent Jacquemard, Michaël Rusinowitch: Rewrite Closure and CF Hedge Automata. CoRR abs/1212.5108 (2012) |
| 2011 | ||
| j8 | | Florent Jacquemard, Francis Klay, Camille Vacher: Rigid tree automata and applications. Inf. Comput. 209(3): 486-512 (2011) |
| c22 | | Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai: Controlled Term Rewriting. FroCoS 2011: 179-194 |
| c21 | | Florent Jacquemard, Étienne Lozes, Ralf Treinen, Jules Villard: Multiple Congruence Relations, First-Order Theories on Terms, and the Frames of the Applied Pi-Calculus. TOSCA 2011: 166-185 |
| 2010 | ||
| c20 | | Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher: The Emptiness Problem for Tree Automata with Global Constraints. LICS 2010: 263-272 |
| c19 | | Florent Jacquemard, Michaël Rusinowitch: Rewrite-based verification of XML updates. PPDP 2010: 119-130 |
| 2009 | ||
| j7 | | Adria Gascón, Guillem Godoy, Florent Jacquemard: Closure of Tree Automata Languages under Innermost Rewriting. Electr. Notes Theor. Comput. Sci. 237: 23-38 (2009) |
| c18 | | Nihel Ben Youssef, Adel Bouhoula, Florent Jacquemard: Automatic verification of conformance of firewall configurations to security policies. ISCC 2009: 526-531 |
| c17 | | |
| c16 | | |
| i3 | | Florent Jacquemard, Michaël Rusinowitch: Rewrite based Verification of XML Updates. CoRR abs/0907.5125 (2009) |
| 2008 | ||
| j6 | | Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron: Tree automata with equality constraints modulo equational theories. J. Log. Algebr. Program. 75(2): 182-208 (2008) |
| j5 | | Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin: Visibly Tree Automata with Memory and Constraints. Logical Methods in Computer Science 4(2) (2008) |
| c15 | | Adel Bouhoula, Florent Jacquemard: Automated Induction with Constrained Tree Automata. IJCAR 2008: 539-554 |
| c14 | | Florent Jacquemard, Michaël Rusinowitch: Closure of Hedge-Automata Languages by Hedge Rewriting. RTA 2008: 157-171 |
| i2 | | Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin: Visibly Tree Automata with Memory and Constraints. CoRR abs/0804.3065 (2008) |
| i1 | | Adel Bouhoula, Florent Jacquemard: Automated Induction for Complex Data Structures. CoRR abs/0811.4720 (2008) |
| 2007 | ||
| c13 | | Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin: Tree Automata with Memory, Visibility and Structural Constraints. FoSSaCS 2007: 168-182 |
| 2006 | ||
| j4 | | 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) |
| c12 | | Ichiro Mitsuhashi, Michio Oyamaguchi, Florent Jacquemard: The Confluence Problem for Flat TRSs. AISC 2006: 68-81 |
| c11 | | Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron: Tree Automata with Equality Constraints Modulo Equational Theories. IJCAR 2006: 557-571 |
| p1 | | Olivier Michel, Florent Jacquemard: An Analysis of a Public Key Protocol with Membranes. Applications of Membrane Computing 2006: 283-302 |
| 2004 | ||
| c10 | | 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 |
| c9 | | Stéphanie Delaune, Florent Jacquemard: A Theory of Dictionary Attacks and its Complexity. CSFW 2004: 2-15 |
| 2003 | ||
| j3 | | Hubert Comon, Florent Jacquemard: Ground reducibility is EXPTIME-complete. Inf. Comput. 187(1): 123-153 (2003) |
| j2 | | Florent Jacquemard: Reachability and confluence are undecidable for flat term rewriting systems. Inf. Process. Lett. 87(5): 265-270 (2003) |
| 2000 | ||
| j1 | | 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) |
| c8 | | Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron: Compiling and Verifying Security Protocols. LPAR 2000: 131-160 |
| 1999 | ||
| c7 | | Véronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes: Decidable Fragments of Simultaneous Rigid Reachability. ICALP 1999: 250-260 |
| 1998 | ||
| c6 | | |
| c5 | | Florent Jacquemard, Christoph Meyer, Christoph Weidenbach: Unification in Extension of Shallow Equational Theories. RTA 1998: 76-90 |
| 1997 | ||
| c4 | | |
| 1996 | ||
| c3 | | |
| 1994 | ||
| c2 | | Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard: Pumping, Cleaning and Symbolic Constraints Solving. ICALP 1994: 436-449 |
| c1 | | Hubert Comon, Florent Jacquemard: Ground Reducibility and Automata with Disequality Constraints. STACS 1994: 151-162 |
Colors in the list of coauthors
Last update Tue May 21 07:32:50 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page