M. Abadi and C. Fournet, Mobile values, new names, and secure communication, POPL, pp.104-115, 2001.
URL : https://hal.archives-ouvertes.fr/hal-01423924

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

M. Boreale, D. Nicola, and R. , A symbolic semantics for the pi-calculus (extended abstract), CONCUR '94: Proceedings of the Concurrency Theory, pp.299-314, 1994.

J. Borgström, A Complete Symbolic Bisimilarity for an Extended Spi Calculus, Electronic Notes in Theoretical Computer Science, vol.242, issue.3, 2009.
DOI : 10.1016/j.entcs.2009.07.078

V. Cheval, H. Comon-lundh, and S. Delaune, A decision procedure for proving observational equivalence, Preliminary Proceedings of the 7th International Workshop on Security Issues in Coordination Models, Languages and Systems (SecCo'09), 2009.

J. Clark and J. Jacob, A survey of authentication protocol literature, 1997.

H. Comon-lundh and V. Cortier, Computational soundness of observational equivalence, Proceedings of the 15th ACM conference on Computer and communications security, CCS '08, pp.109-118, 2008.
DOI : 10.1145/1455770.1455786
URL : https://hal.archives-ouvertes.fr/inria-00323199

V. Cortier and S. Delaune, A Method for Proving Observational Equivalence, 2009 22nd IEEE Computer Security Foundations Symposium, pp.266-276, 2009.
DOI : 10.1109/CSF.2009.9
URL : https://hal.archives-ouvertes.fr/inria-00426622

S. Delaune, S. Kremer, and M. D. Ryan, Symbolic bisimulation for the applied pi calculus, FSTTCS, pp.133-145, 2007.
DOI : 10.1007/978-3-540-77050-3_11
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.2029

M. Hennessy, A proof system for communicating processes with value-passing (extended abstract), Proceedings of the Ninth Conference on Foundations of Software Technology and Theoretical Computer Science, pp.325-339, 1989.
DOI : 10.1007/3-540-52048-1_54

M. Hennessy and H. Lin, Symbolic bisimulations, Theoretical Computer Science, vol.138, issue.2, pp.353-389, 1995.
DOI : 10.1016/0304-3975(94)00172-F
URL : http://doi.org/10.1016/0304-3975(94)00172-f

M. Hennessy and H. Lin, Proof systems for message-passing process algebras, Formal Aspects of Computing, vol.1, issue.1, pp.379-407, 1996.
DOI : 10.1007/BF01213531
URL : http://basics.sjtu.edu.cn/~yuehg/concur/proof systems for message-passing process algebras 93.pdf

M. Johansson, B. Victor, and J. Parrow, A Fully Abstract Symbolic Semantics for Psi-Calculi, Electronic Proceedings in Theoretical Computer Science, vol.18, 2009.
DOI : 10.4204/EPTCS.18.2

H. Lin, Complete inference systems for weak bisimulation equivalences in the ??-calculus, Information and Computation, vol.180, issue.1, pp.1-29, 2003.
DOI : 10.1016/S0890-5401(02)00014-7

J. Liu and H. Lin, A complete symbolic bisimulation for full applied pi calculus, SOFSEM '10: Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science, pp.552-563, 2010.

J. Parrow and D. Sangiorgi, Algebraic Theories for Name-Passing Calculi, Information and Computation, vol.120, issue.2, pp.174-197, 1994.
DOI : 10.1006/inco.1995.1108