Searching for authors named "Florent Jacquemard" – sorted by Relevance.
-
Reachability and Confluence Are Undecidable for Flat Term Rewriting Systems
- Florent Jacquemard Reachability and confluence are undecidable for flat term rewriting systems
- Cited by 7 (1 self) – Add To MetaCart
-
Rigid Reachability The Non-Symmetric Form Of Rigid E-Unification
- ur Informatik Im Stadtwald, 66123 Saarbrucken, Germany and FLORENT JACQUEMARD LORIA and INRIA 615 rue du
- Add To MetaCart
-
A Theory of Dictionary Attacks and its Complexity
- 94235 Cachan Cedex, France stephanie.delaune@(email omitted); Florent Jacquemard INRIA, Research Unit
- Cited by 9 (1 self) – Add To MetaCart
-
Ground Reducibility and Automata with Disequality Constraints
- Ground Reducibility and Automata with Disequality Constraints Hubert Comon and Florent Jacquemard
- Cited by 7 (3 self) – Add To MetaCart
-
Ground reducibility is EXPTIME-complete
- Ground Reducibility is EXPTIME-complete Hubert Comon 1 and Florent Jacquemard 2 1 CNRS and LSV
- Cited by 9 (4 self) – Add To MetaCart
-
Constrained Tree Grammars to Pilot . . .
- Communications 2083 Cite El Ghazala, TUNISIE bouhoula@(email omitted); Florent Jacquemard INRIA Futurs and LSV / CNRS
- Add To MetaCart
-
Compiling and Verifying Security Protocols
- Compiling and Verifying Security Protocols Florent Jacquemard 1 , Michael Rusinowitch 1
- Cited by 43 (4 self) – Add To MetaCart
-
Three variations on the analysis of the Needham-Schroeder Public-Key Protocol with MGS
- -Schroeder Public-Key Protocol with MGS Olivier Michel & Florent Jacquemard & Jean-Louis Giavitto email(s) : michel
- Cited by 1 (0 self) – Add To MetaCart
-
The Confluence Problem for Flat TRSs
- florent.jacquemard@(email omitted); Abstract. We prove that the properties of reachability, joinability
- Cited by 2 (0 self) – Add To MetaCart
-
Unification in Extensions of Shallow Equational Theories
- Unification in Extensions of Shallow Equational Theories Florent Jacquemard ? , Christoph Meyer
- Cited by 8 (0 self) – Add To MetaCart

