M. Abadi and C. Fournet, Mobile values, new names, and secure communication, 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.104-115, 2001.
DOI : 10.1145/373243.360213
URL : https://hal.archives-ouvertes.fr/hal-01423924

L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder, Basic Paramodulation, Information and Computation, vol.121, issue.2, pp.172-192, 1995.
DOI : 10.1006/inco.1995.1131
URL : http://doi.org/10.1006/inco.1995.1131

B. Bogaert and S. Tison, Equality and disequality constraints on direct subterms in tree automata, 9th Symp. on Theoretical Aspects of Computer Science, STACS, pp.161-171, 1992.
DOI : 10.1007/3-540-55210-3_181

J. A. Bull and D. J. Otway, The authentication protocol, Defence Research Agency, 1997.

A. Caron, H. Comon, J. Coquidé, M. Dauchet, and F. Jacquemard, Pumping, cleaning and symbolic constraints solving, 21st Int. Coll. on Automata, Languages and Programming, ICALP, pp.436-449, 1994.
DOI : 10.1007/3-540-58201-0_88
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.4958

H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez et al., Tree Automata Techniques and Applications, 1997.

M. Dauchet, A. Caron, and J. Coquidé, Automata for Reduction Properties Solving, Journal of Symbolic Computation, vol.20, issue.2, pp.215-233, 1995.
DOI : 10.1006/jsco.1995.1048

N. Dershowitz and J. Jouannaud, Rewrite systems, chapter Handbook of Theoretical Computer Science, pp.243-320, 1990.

P. Devienne, J. Talbot, and S. Tison, Set-based analysis for logic programming and tree automata, Static Analysis, 4th International Symposium, SAS, volume 1302 of Lecture Notes in Computer Science, pp.127-140, 1997.

T. Frühwirth, E. Shapiro, M. Vardi, and E. Yardeni, Logic programs as types for logic programs, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.300-309, 1991.
DOI : 10.1109/LICS.1991.151654

T. Genet and F. Klay, Rewriting for Cryptographic Protocol Verification, Proc. of 17th Int. Conf. on Automated Deduction, 2000.
DOI : 10.1007/10721959_21
URL : https://hal.archives-ouvertes.fr/inria-00072731

J. Goubault-larrecq, Deciding by resolution, Information Processing Letters, vol.95, issue.3, pp.401-408, 2005.
DOI : 10.1016/j.ipl.2005.04.007

F. Jacquemard, C. Meyer, and C. Weidenbach, Unification in extensions of shallow equational theories, 9th Int. Conf. on Rewriting Techniques and Applications, RTA, pp.76-90, 1998.
DOI : 10.1007/BFb0052362
URL : https://hal.archives-ouvertes.fr/inria-00098740

R. Küsters and T. Wilke, Automata-Based Analysis of Recursive Cryptographic Protocols, 21st Annual Symp. on Theoretical Aspects of Computer Science, STACS, pp.382-393, 2004.
DOI : 10.1007/978-3-540-24749-4_34

F. Nielson, H. R. Nielson, and H. Seidl, Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi, Static Analysis, 9th Int. Symp., SAS, pp.20-35, 2002.
DOI : 10.1007/3-540-45789-5_5

R. Nieuwenhuis and A. Rubio, Paramodulation-Based Theorem Proving, chapter Handbook of Automated Reasoning, Volume I, Chapter 7, 2001.

H. Ohsaki and T. Takai, Decidability and Closure Properties of Equational Tree Languages, 13th Int. Conf. on Rewriting Techniques and Applications, RTA, pp.114-128, 2002.
DOI : 10.1007/3-540-45610-4_9

A. Riazanov and A. Voronkov, Splitting Without Backtracking, Proc. of the 17th Int. Joint Conf. on Artificial Intelligence, IJCAI, pp.611-617, 2001.

H. Seki, T. Takai, Y. Fujinaka, and Y. Kaji, Layered Transducing Term Rewriting System and Its Recognizability Preserving Property, Int. Conf. on Rewriting Techniques and Applications, RTA, pp.98-113, 2002.
DOI : 10.1007/3-540-45610-4_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.4888

S. Tison, Tree automata and term rewrite systems Invited tutorial at the 11th Int, Conf. on Rewriting Techniques and Applications, RTA, 2000.

T. Truderung, Selecting Theories and Recursive Protocols, Lecture Notes in Computer Science, vol.3653, pp.217-232, 2005.
DOI : 10.1007/11539452_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.488.1561

K. N. Verma, Two-Way Equational Tree Automata, ENS Cachan, 2003.