R. M. Amadio and W. Charatonik, On Name Generation and Set-Based Analysis in the Dolev-Yao Model, CONCUR 2002, pp.499-514, 2002.
DOI : 10.1007/3-540-45694-5_33

R. M. Amadio, D. Lugiez, and V. Vanackère, On the symbolic reduction of processes with cryptographic functions, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00072478

A. Armando, D. Basin, M. Bouallagui, Y. Chevalier, L. Compagna et al., The AVISS Security Protocol Analysis Tool, CAV 2002, pp.349-353, 2002.
DOI : 10.1007/3-540-45657-0_27

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

Y. Chevalier, R. Küsters, M. Rusinowitch, M. Turuani, and L. Vigneron, Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions
DOI : 10.1007/978-3-540-45220-1_13

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

Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani, An NP decision procedure for protocol insecurity with XOR, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., 2003.
DOI : 10.1109/LICS.2003.1210066

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

Y. Chevalier and L. Vigneron, Automated Unbounded Verification of Security Protocols, CAV 2002, 2002.
DOI : 10.1007/3-540-45657-0_24

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

J. Clark and J. Jacob, A Survey of Authentication Protocol Literature Web Draft Version 1.0 available from http, 1997.

H. Comon-lundh and V. Cortier, New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols, Proc. 14th Int. Conf. Rewriting Techniques and Applications (RTA'2003), 2003.
DOI : 10.1007/3-540-44881-0_12

H. Comon and V. Shmatikov, Is it possible to decide whether a cryptographic protocol is secure or not, Journal of Telecommunications and Information Technology, 2002.

E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov, Complexity and expressive power of logic programming, CCC'97, pp.82-101, 1997.

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

N. A. Durgin, P. D. Lincoln, J. C. Mitchell, and A. Scedrov, Undecidability of bounded security protocols, Workshop on Formal Methods and Security Protocols (FMSP'99), 1999.

S. Even and O. Goldreich, On the Security of Multi-Party Ping-Pong Protocols, FOCS'83, pp.34-39, 1983.

A. Huima, Efficient infinite-state analysis of security protocols, Workshop on Formal Methods and Security Protocols (FMSP'99), 1999.

R. Küsters, On the decidability of cryptographic protocols with open-ended data structures, CONCUR 2002, pp.515-530, 2002.

C. Meadows, Open issues in formal methods for cryptographic protocol analysis, DISCEX 2000, pp.237-250, 2000.

J. K. Millen and V. Shmatikov, Constraint solving for bounded-process cryptographic protocol analysis, Proceedings of the 8th ACM conference on Computer and Communications Security , CCS '01, pp.166-175, 2001.
DOI : 10.1145/501983.502007

M. Rusinowitch and M. Turuani, Protocol insecurity with finite number of sessions is NP-complete, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001., pp.174-190, 2001.
DOI : 10.1109/CSFW.2001.930145

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