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

M. Arapinis, T. Chothia, E. Ritter, and M. Ryan, Analysing unlinkability and anonymity using the applied pi calculus, 23rd Computer Security Foundations Symposium (CSF'10), pp.107-121, 2010.

A. Armando and L. Compagna, Sat-based model-checking for security protocols analysis, International Journal of Information Security, vol.7, pp.3-32, 2008.

K. Bhargavan, B. Blanchet, and N. Kobeissi, Verified models and reference implementations for the TLS 1.3 standard candidate, IEEE Symposium on Security and Privacy, pp.483-502, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01575920

B. Blanchet, Automatic verification of security protocols: formal model and computational model. Mémoire d'habilitation à diriger des recherches, 2008.

B. Blanchet, Symbolic and computational mechanized verification of the arinc823 avionic protocols, 30th IEEE Computer Security Foundations Symposium (CSF'17), pp.68-82, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01575861

B. Blanchet, M. Abadi, and C. Fournet, Automated Verification of Selected Equivalences for Security Protocols, Journal of Logic and Algebraic Programming, vol.75, issue.1, pp.3-51, 2008.
DOI : 10.1016/j.jlap.2007.06.002

URL : https://doi.org/10.1016/j.jlap.2007.06.002

A. Blum and M. Furst, Fast planning through planning graph analysis, Artificial Intelligence, vol.90, pp.281-300, 1997.
DOI : 10.1016/s0004-3702(96)00047-1

URL : https://doi.org/10.1016/s0004-3702(96)00047-1

R. Chadha, ?. Ciobâc?, and S. Kremer, Automated verification of equivalence properties of cryptographic protocols, 21th European Symposium on Programming (ESOP'12), 2012.
URL : https://hal.archives-ouvertes.fr/inria-00632564

V. Cheval, Apte: an algorithm for proving trace equivalence, Proceedings of the 20th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'14), vol.8413, pp.587-592, 2014.
DOI : 10.1007/978-3-642-54862-8_50

URL : https://link.springer.com/content/pdf/10.1007%2F978-3-642-54862-8_50.pdf

V. Cheval, V. Cortier, and S. Delaune, Deciding equivalencebased properties using constraint solving, Theoretical Computer Science, vol.492, pp.1-39, 2013.
DOI : 10.1016/j.tcs.2013.04.016

URL : https://hal.archives-ouvertes.fr/hal-00881060

V. Cheval, S. Kremer, and I. Rakotonirina, Deepsec: Deciding equivalence properties in security protocols-theory and practice, 39th IEEE Symposium on Security and Privacy (S&P'18), pp.525-542, 2018.
DOI : 10.1109/sp.2018.00033

URL : https://hal.archives-ouvertes.fr/hal-01698177

R. Chrétien, V. Cortier, and S. Delaune, Typing messages for free in security protocols: the case of equivalence properties, Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14), vol.8704, pp.372-386, 2014.

R. Chrétien, V. Cortier, and S. Delaune, Checking trace equivalence: How to get rid of nonces?, Proceedings of the 20th European Symposium