M. Abadi and V. Cortier, Deciding knowledge in security protocols under equational theories, Theoretical Computer Science, vol.367, issue.1-2, pp.2-32, 2006.
DOI : 10.1016/j.tcs.2006.08.032
URL : https://hal.archives-ouvertes.fr/inria-00000554

R. Amadio, D. Lugiez, and V. Vanackère, On the symbolic reduction of processes with cryptographic functions, Theoretical Computer Science, vol.290, issue.1, pp.695-740, 2003.
DOI : 10.1016/S0304-3975(02)00090-7
URL : https://hal.archives-ouvertes.fr/inria-00072478

S. Anantharaman, P. Narendran, and M. Rusinowitch, Unification Modulo ACUI Plus Distributivity Axioms, Journal of Automated Reasoning, vol.3, issue.1?2, pp.1-28, 2004.
DOI : 10.1007/s10817-004-2279-7
URL : https://hal.archives-ouvertes.fr/inria-00099990

A. Armando and L. Compagna, SATMC: A SAT-Based Model Checker for Security Protocols, Proc. of JELIA 2004, pp.730-733, 2004.
DOI : 10.1007/978-3-540-30227-8_68

M. Baudet, Deciding security of protocols against off-line guessing attacks, Proceedings of the 12th ACM conference on Computer and communications security , CCS '05, pp.16-25, 2005.
DOI : 10.1145/1102120.1102125

R. V. Book, M. Jantzen, and C. , Monadic Thue systems, Theoretical Computer Science, vol.19, issue.3, pp.231-251, 1982.
DOI : 10.1016/0304-3975(82)90036-6
URL : http://doi.org/10.1016/0304-3975(82)90036-6

R. V. Book and F. Otto, The Verifiability of Two-Party Protocols, EUROCRYPT, pp.254-260, 1985.
DOI : 10.1007/3-540-39805-8_30

R. V. Book and F. Otto, String-Rewriting Systems, 1993.
DOI : 10.1007/978-1-4613-9771-7

Y. Chevalier and L. Vigneron, A tool for lazy verification of security protocols, Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001), 2001.
DOI : 10.1109/ASE.2001.989832
URL : https://hal.archives-ouvertes.fr/inria-00107545

H. Comon-lundh and S. Delaune, The Finite Variant Property: How to Get Rid of Some Algebraic Properties, Proc. of RTA'05 (Jürgen Giesl, pp.294-307, 2005.
DOI : 10.1007/978-3-540-32033-3_22

H. Comon-lundh and R. Treinen, Easy Intruder Deductions. Verification: Theory and Practice In Lecture Notes in Computer Science 2772, pp.225-242, 2003.
DOI : 10.1007/978-3-540-39910-0_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.3113

J. Coquidé, M. Dauchet, R. Gilleron, and S. Vágvölgyi, Bottom-up tree pushdown automata: classification and connection with rewrite systems, Theoretical Computer Science, vol.127, issue.1, pp.69-98, 1994.
DOI : 10.1016/0304-3975(94)90101-5

S. Delaune and F. Jacquemard, A decision procedure for the verification of security protocols with explicit destructors, Proceedings of the 11th ACM conference on Computer and communications security , CCS '04, pp.278-287, 2004.
DOI : 10.1145/1030083.1030121
URL : https://hal.archives-ouvertes.fr/inria-00579012

D. Dolev and A. C. Yao, On the security of public key protocols, IEEE Transactions on Information Theory, vol.29, issue.2, pp.198-207, 1983.
DOI : 10.1109/TIT.1983.1056650

N. A. Durgin, P. D. Lincoln, J. G. Mitchell, and A. Scedrov, Multiset rewriting and the complexity of bounded security protocols, Journal of Computer Security, vol.12, issue.2, pp.677-722, 2004.
DOI : 10.3233/JCS-2004-12203

R. Gilleron and S. Tison, Regular tree languages and rewrite systems, In Fundamenta Informaticae, vol.24, pp.157-176, 1995.
URL : https://hal.archives-ouvertes.fr/inria-00538882

G. P. Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems, Journal of the ACM, vol.27, issue.4, pp.797-821, 1980.
DOI : 10.1145/322217.322230

M. Minsky, Computation: Finite and Infinite Machines, 1972.

P. Narendran, F. Pfenning, and R. Statman, Abstract, The Journal of Symbolic Logic, vol.32, issue.02, pp.636-647, 1997.
DOI : 10.1007/BF01084396

M. Nesi and G. Rucci, Formalizing and Analyzing the Needham-Schroeder Symmetric-Key Protocol by Rewriting, Electronic Notes in Theoretical Computer Science, vol.135, issue.1, pp.95-114, 2005.
DOI : 10.1016/j.entcs.2005.06.002

M. Rusinowitch and M. Turuani, Protocol insecurity with a finite number of sessions and composed keys is NP-complete, Theoretical Computer Science, vol.299, issue.1-3, pp.1-3451, 2003.
DOI : 10.1016/S0304-3975(02)00490-5

C. Weidenbach, Towards an automatic analysis of security protocols, Proc. of 16th International Conference on Automated Deduction, CADE-16 , LNAI 1632, pp.378-382, 1999.