Download as a PDF

5. F. Baader and W. Snyder. Unication theory. In J. A. Robinson and A. Voronkov,
editors, Handbook of Automated Reasoning (in 2 volumes), pages 445{532. Elsevier
and MIT Press, 2001.
6. D. Basin, S. Modersheim, and L. Vigano. OFMC: A symbolic model checker for
security protocols. International Journal of Information Security, 4(3):181{208,
2005.
7. M. Baudet, V. Cortier, and S. Delaune. YAPA: A generic tool for computing
intruder knowledge. In R. Treinen, editor, Proceedings of the 20th International
Conference on Rewriting Techniques and Applications (RTA'09), Lecture Notes in
Computer Science, Braslia, Brazil, June-July 2009. Springer. To appear.
8. B. Blanchet. An Ecient Cryptographic Protocol Verier Based on Prolog Rules.
In 14th IEEE Computer Security Foundations Workshop (CSFW-14), pages 82{96,
Cape Breton, Nova Scotia, Canada, June 2001. IEEE Computer Society.
9. Y. Boichut, P.-C. Heam, O. Kouchnarenko, and F. Oehl. Improvements on the
Genet and Klay technique to automatically verify security protocols. In Proceedings
of Automated Verication of Innite States Systems (AVIS04). ENTCS, 2004.
10. S. Bursuc and H. Comon-Lundh. Protocol security and algebraic properties: decision results for a bounded number of sessions. In R. Treinen, editor, Proceedings
of the 20th International Conference on Rewriting Techniques and Applications
(RTA'09), Lecture Notes in Computer Science, Braslia, Brazil, June-July 2009.
Springer. To appear.
11. Y. Chevalier and M. Rusinowitch. Hierarchical combination of intruder theories.
Inf. Comput., 206(2-4):352{377, 2008.
12. S. Ciob^aca, S. Delaune, and S. Kremer. Computing knowledge in security protocols under convergent equational theories. In R. Schmidt, editor, Proceedings of
the 22nd International Conference on Automated Deduction (CADE'09), Lecture
Notes in Articial Intelligence, Montreal, Canada, Aug. 2009. Springer. To appear.
13. M. Clavel, F. Duran, S. Eker, S. Escobar, P. Lincoln, N. Mart-Oliet, J. Meseguer,
and C. Talcott. Unication and Narrowing in Maude 2.4. In R. Treinen, editor,
Proceedings of the 20th International Conference on Rewriting Techniques and
Applications (RTA'09), Lecture Notes in Computer Science. Springer, June-July
2009. To appear.
14. M. Clavel, F. Duran, S. Eker, J. Meseguer, P. Lincoln, N. Mart-Oliet, and C. Talcott. All About Maude { A High-Performance Logical Framework. Springer LNCS
Vol. 4350, 2007.
15. H. Comon-Lundh and S. Delaune. The nite variant property: How to get rid
of some algebraic properties. In J. Giesl, editor, Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005,
Proceedings, volume 3467 of Lecture Notes in Computer Science, pages 294{307.
Springer, 2005.
16. E. Contejean and C. Marche. The CiME system: tutorial and user's manual.
Manuscript, Universite Paris-Sud, Centre d'Orsay.
17. D. Dolev and A. Yao. On the security of public key protocols. IEEE Transaction
on Information Theory, 29(2):198{208, 1983.
18. N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Multiset rewriting and the
complexity of bounded security. Journal of Computer Security, pages 677{722,
2004.
19. S. Escobar, J. Hendrix, C. Meadows, and J. Meseguer. Die-Hellman cryptographic reasoning in the Maude-NRL protocol analyzer. In Proc. 2nd International
Workshop on Security and Rewriting Techniques (SecReT 2007), 2007.
49