Follow
Florent Jacquemard
Title
Cited by
Cited by
Year
Tree Automata Techniques and Applications
H Comon, M Dauchet, R Gilleron, C L\"oding, F Jacquemard, D Lugiez, ...
Available on: \url{http://tata.gforge.inria.fr}, 2007
1876*2007
Compiling and verifying security protocols
F Jacquemard, M Rusinowitch, L Vigneron
International Conference on Logic for Programming Artificial Intelligence …, 2000
1562000
Decidable approximations of term rewriting systems
F Jacquemard
International Conference on Rewriting Techniques and Applications, 362-376, 1996
1471996
A theory of dictionary attacks and its complexity
S Delaune, F Jacquemard
Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004., 2-15, 2004
532004
Pumping, cleaning and symbolic constraints solving
AC Caron, H Comon, JL Coquidé, M Dauchet, F Jacquemard
International Colloquium on Automata, Languages, and Programming, 436-449, 1994
521994
A decision procedure for the verification of security protocols with explicit destructors
S Delaune, F Jacquemard
Proceedings of the 11th ACM conference on Computer and communications …, 2004
482004
Ground reducibility is EXPTIME-complete
H Comon, F Jacquemard
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, 26-34, 1997
471997
Unification in extensions of shallow equational theories
F Jacquemard, C Meyer, C Weidenbach
International Conference on Rewriting Techniques and Applications, 76-90, 1998
441998
Automatic verification of conformance of firewall configurations to security policies
NB Youssef, A Bouhoula, F Jacquemard
2009 ieee symposium on computers and communications, 526-531, 2009
412009
Ground reducibility is EXPTIME-complete
H Comon, F Jacquemard
Information and Computation 187 (1), 123-153, 2003
382003
Rigid tree automata
F Jacquemard, F Klay, C Vacher
International Conference on Language and Automata Theory and Applications …, 2009
372009
Rigid tree automata and applications
F Jacquemard, F Klay, C Vacher
Information and Computation 209 (3), 486-512, 2011
352011
The emptiness problem for tree automata with global constraints
L Barguñó, C Creus, G Godoy, F Jacquemard, C Vacher
2010 25th Annual IEEE Symposium on Logic in Computer Science, 263-272, 2010
312010
Correct automatic accompaniment despite machine listening or human errors in Antescofo
A Cont, J Echeveste, JL Giavitto, F Jacquemard
ICMC 2012-International Computer Music Conference, 2012
292012
Tree automata with equality constraints modulo equational theories
F Jacquemard, M Rusinowitch, L Vigneron
International Joint Conference on Automated Reasoning, 557-571, 2006
282006
Ground reducibility and automata with disequality constraints
H Comon, F Jacquemard
Annual Symposium on Theoretical Aspects of Computer Science, 149-162, 1994
281994
Automated induction with constrained tree automata
A Bouhoula, F Jacquemard
International Joint Conference on Automated Reasoning, 539-554, 2008
262008
ASAP: a dataset of aligned scores and performances for piano transcription
F Foscarin, A Mcleod, P Rigaux, F Jacquemard, M Sakai
International Society for Music Information Retrieval Conference, 534-541, 2020
252020
The confluence problem for flat TRSs
I Mitsuhashi, M Oyamaguch, F Jacquemard
International Conference on Artificial Intelligence and Symbolic Computation …, 2006
242006
Reachability and confluence are undecidable for flat term rewriting systems
F Jacquemard
Information processing letters 87 (5), 265-270, 2003
242003
The system can't perform the operation now. Try again later.
Articles 1–20