Skip to content

Florent Jacquemard

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

18

Venues

13

Active years

1994–2015

Best venue rank

A*

Where they publish

Papers

18 indexed papers, newest first.

YearVenueTitleAuthors
2015CADETerm Rewriting with Prefix Context Constraints and Bottom-Up Strategies.Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai
2015SACModel based testing of an interactive music system.Clment Poncelet Sanchez, Florent Jacquemard
2013EMSOFTA synchronous embedding of Antescofo, a domain-specific language for interactive mixed music.Guillaume Baudart, Florent Jacquemard, Louis Mandel, Marc Pouzet
2013LATARewrite Closure and CF Hedge Automata.Florent Jacquemard, Michal Rusinowitch
2010LICSThe Emptiness Problem for Tree Automata with Global Constraints.Luis Bargu, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher
2010PPDPRewrite-based verification of XML updates.Florent Jacquemard, Michal Rusinowitch
2009ISCCAutomatic verification of conformance of firewall configurations to security policies.Nihel Ben Youssef, Adel Bouhoula, Florent Jacquemard
2009LATARigid Tree Automata.Florent Jacquemard, Francis Klay, Camille Vacher
2008CADEAutomated Induction with Constrained Tree Automata.Adel Bouhoula, Florent Jacquemard
2007FOSSACSTree Automata with Memory, Visibility and Structural Constraints.Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin
2006AISCThe Confluence Problem for Flat TRSs.Ichiro Mitsuhashi, Michio Oyamaguchi, Florent Jacquemard
2006CADETree Automata with Equality Constraints Modulo Equational Theories.Florent Jacquemard, Michal Rusinowitch, Laurent Vigneron
2004CCSA decision procedure for the verification of security protocols with explicit destructors.Stphanie Delaune, Florent Jacquemard
2000LPARCompiling and Verifying Security Protocols.Florent Jacquemard, Michal Rusinowitch, Laurent Vigneron
1999ICALPDecidable Fragments of Simultaneous Rigid Reachability.Vronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes
1997LICSGround Reducibility is EXPTIME-Complete.Hubert Comon, Florent Jacquemard
1994ICALPPumping, Cleaning and Symbolic Constraints Solving.Anne-Ccile Caron, Hubert Comon, Jean-Luc Coquid, Max Dauchet, Florent Jacquemard
1994STACSGround Reducibility and Automata with Disequality Constraints.Hubert Comon, Florent Jacquemard