Search results for "Florent Jacquemard"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Adel Bouhoula, Florent Jacquemard	Sufficient completeness verification for conditional and constrained TRS.	J. Applied Logic	2012	DBLP DOI BibTeX RDF
1	Florent Jacquemard, Francis Klay, Camille Vacher	Rigid tree automata and applications.	Inf. Comput.	2011	DBLP DOI BibTeX RDF
1	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	DBLP DOI BibTeX RDF
1	Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai	Controlled Term Rewriting.	FroCos	2011	DBLP DOI BibTeX RDF
1	Florent Jacquemard, Michaël Rusinowitch	Rewrite-based verification of XML updates.	PPDP	2010	DBLP DOI BibTeX RDF	hedge automata, static typechecking, xml access control policies, xml updates, term rewriting
1	Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher	The Emptiness Problem for Tree Automata with Global Constraints.	LICS	2010	DBLP DOI BibTeX RDF	Symbolic Constraint Solving, Tree Automata, Monadic Second Order Logic, XML Processing
1	Adria Gascón, Guillem Godoy, Florent Jacquemard	Closure of Tree Automata Languages under Innermost Rewriting.	Electr. Notes Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
1	Florent Jacquemard, Michaël Rusinowitch	Rewrite based Verification of XML Updates	CoRR	2009	DBLP BibTeX RDF
1	Florent Jacquemard, Francis Klay, Camille Vacher	Rigid Tree Automata.	LATA	2009	DBLP DOI BibTeX RDF
1	Guillem Godoy, Florent Jacquemard	Unique Normalization for Shallow TRS.	RTA	2009	DBLP DOI BibTeX RDF
1	Nihel Ben Youssef, Adel Bouhoula, Florent Jacquemard	Automatic verification of conformance of firewall configurations to security policies.	ISCC	2009	DBLP DOI BibTeX RDF
1	Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron	Tree automata with equality constraints modulo equational theories.	J. Log. Algebr. Program.	2008	DBLP DOI BibTeX RDF
1	Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin	Visibly Tree Automata with Memory and Constraints.	Logical Methods in Computer Science	2008	DBLP DOI BibTeX RDF
1	Adel Bouhoula, Florent Jacquemard	Automated Induction for Complex Data Structures	CoRR	2008	DBLP BibTeX RDF
1	Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin	Visibly Tree Automata with Memory and Constraints	CoRR	2008	DBLP BibTeX RDF
1	Adel Bouhoula, Florent Jacquemard	Automated Induction with Constrained Tree Automata.	IJCAR	2008	DBLP DOI BibTeX RDF
1	Florent Jacquemard, Michaël Rusinowitch	Closure of Hedge-Automata Languages by Hedge Rewriting.	RTA	2008	DBLP DOI BibTeX RDF
1	Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin	Tree Automata with Memory, Visibility and Structural Constraints.	FoSSaCS	2007	DBLP DOI BibTeX RDF
1	Stéphanie Delaune, Florent Jacquemard	Decision Procedures for the Security of Protocols with Probabilistic Encryption against Offline Dictionary Attacks.	J. Autom. Reasoning	2006	DBLP DOI BibTeX RDF	verification, formal methods, cryptographic protocols, dictionary attacks, probabilistic encryption
1	Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron	Tree Automata with Equality Constraints Modulo Equational Theories.	IJCAR	2006	DBLP DOI BibTeX RDF
1	Olivier Michel, Florent Jacquemard	An Analysis of a Public Key Protocol with Membranes.	Applications of Membrane Computing	2006	DBLP DOI BibTeX RDF
1	Ichiro Mitsuhashi, Michio Oyamaguchi, Florent Jacquemard	The Confluence Problem for Flat TRSs.	AISC	2006	DBLP DOI BibTeX RDF	Flat, Term rewriting system, Confluence, Decision problem
1	Stéphanie Delaune, Florent Jacquemard	A Theory of Dictionary Attacks and its Complexity.	CSFW	2004	DBLP DOI BibTeX RDF
1	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	DBLP DOI BibTeX RDF	formal methods, security protocols, constraint solving
1	Florent Jacquemard	Reachability and confluence are undecidable for flat term rewriting systems.	Inf. Process. Lett.	2003	DBLP DOI BibTeX RDF
1	Hubert Comon, Florent Jacquemard	Ground reducibility is EXPTIME-complete.	Inf. Comput.	2003	DBLP DOI BibTeX RDF
1	Harald Ganzinger, Florent Jacquemard, Margus Veanes	Rigid Reachability, The Non-Symmetric Form of Rigid E-Unification.	Int. J. Found. Comput. Sci.	2000	DBLP BibTeX RDF
1	Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron	Compiling and Verifying Security Protocols.	LPAR	2000	DBLP DOI BibTeX RDF
1	Véronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes	Decidable Fragments of Simultaneous Rigid Reachability.	ICALP	1999	DBLP DOI BibTeX RDF
1	Harald Ganzinger, Florent Jacquemard, Margus Veanes	Rigid Reachability.	ASIAN	1998	DBLP DOI BibTeX RDF
1	Florent Jacquemard, Christoph Meyer, Christoph Weidenbach	Unification in Extension of Shallow Equational Theories.	RTA	1998	DBLP DOI BibTeX RDF
1	Hubert Comon, Florent Jacquemard	Ground Reducibility is EXPTIME-Complete.	LICS	1997	DBLP DOI BibTeX RDF
1	Florent Jacquemard	Decidable Approximations of Term Rewriting Systems.	RTA	1996	DBLP DOI BibTeX RDF
1	Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard	Pumping, Cleaning and Symbolic Constraints Solving.	ICALP	1994	DBLP DOI BibTeX RDF
1	Hubert Comon, Florent Jacquemard	Ground Reducibility and Automata with Disequality Constraints.	STACS	1994	DBLP DOI BibTeX RDF

Publications of "Florent Jacquemard" ( http://dblp.L3S.de/Authors/Florent_Jacquemard )