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

B. Blanchet, Automatic proof of strong secrecy for security protocols, IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004, pp.86-100, 2004.
DOI : 10.1109/SECPRI.2004.1301317

L. Bozga, Y. Lakhnech, and M. Périn, HERMES: An Automatic Tool for Verification of Secrecy in Security Protocols, Proc. of the 15th Computer-Aided Verification conf. (CAV'03) 2725 of Spinger LNCS, 2003.
DOI : 10.1007/978-3-540-45069-6_23

A. Bouhoula, Automated Theorem Proving by Test Set Induction, Journal of Symbolic Computation, vol.23, issue.1, pp.47-77, 1997.
DOI : 10.1006/jsco.1996.0076

URL : https://hal.archives-ouvertes.fr/inria-00074196

A. Bouhoula and F. Jacquemard, Automated induction for complex data structures, 2005.

A. Bouhoula and F. Jacquemard, Tree Automata, Implicit Induction and Explicit Destructors for Security Protocol Verification, 2007.

A. Bouhoula and M. Rusinowitch, Implicit induction in conditional theories, Journal of Automated Reasoning, vol.31, issue.2, 1995.
DOI : 10.1007/BF00881856

URL : https://hal.archives-ouvertes.fr/inria-00074627

A. Bundy and G. Steel, Verifying Regular Trace Properties of Security Protocols with Explicit Destructors and Implicit Induction 8 Attacking group protocols by refuting incorrect inductive conjectures, Journal of Automated Reasoning, vol.36, pp.1-2

H. Comon and V. Cortier, Security properties: two agents are sufficient, Science of Computer Programming, vol.50, issue.1-3, pp.51-71, 2004.
DOI : 10.1016/j.scico.2003.12.002

URL : https://hal.archives-ouvertes.fr/inria-00099981

H. Comon-lundh, Handbook of Automated Reasoning, chapter Inductionless Induction, 2001.

V. Cortier, J. Millen, and H. Rueß, Proving secrecy is easy enough, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001., pp.97-110, 2001.
DOI : 10.1109/CSFW.2001.930139

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

C. Lynch and C. Meadows, On the Relative Soundness of the Free Algebra Model for Public Key Encryption, Electronic Notes in Theoretical Computer Science, vol.125, issue.1, pp.43-54, 2005.
DOI : 10.1016/j.entcs.2004.05.018

L. C. Paulson, The inductive approach to verifying cryptographic protocols, Journal of Computer Security, vol.6, issue.1-2, pp.85-128, 1998.
DOI : 10.3233/JCS-1998-61-205