Symbolic Partial Model Checking for Security Analysis - Computer Network Security - page 134

4. Kindred, D. and Wing, J.M.: Fast, automatic checking of security protocols. In
Second USENIX Workshop on Electronic Commerce , Oakland, California (1996)
41-52
5. Lowe, G.: Breaking and fixing the Needham Schroeder public-key protocol using
FDR. In Proceedings of Tools and Algorithms for the Construction and the Analisys
of Systems , volume 1055 of Lecture Notes in Computer Science . Springer Verlag
(1996) 147-166
6. Marchignoli, D. and Martinelli, F.: Automatic verification of cryptographic proto-
cols through compositional analysis techniques. In Proceedings of the International
Conference on Tools and Algorithms for the Construction and the Analysis of Sys-
tems (TACAS'99) , volume 1579 of Lecture Notes in Computer Science (1999)
7. Martinelli, F.: Encoding several authentication properties as properties of the in-
truder's knowledge. Tech. Rep. IAT-B4-2001-20. Submitted for publication
8. Martinelli, F.: Symbolic semantics and analysis for crypto-ccs with (almost) generic
inference systems. In Proceedings of the 27th international Symposium in Mathe-
matical Foundations of Computer Sciences(MFCS'02) , volume 2420 of LNCS , 519-
531
9. Martinelli, F.: Formal Methods for the Analysis of Open Systems with Applications
to Security Properties . PhD thesis, University of Siena (Dec. 1998)
10. Martinelli, F.: Languages for description and analysis of authentication protocols.
In Proceedings of 6th ICTCS . World Scientific, (1998) 304-315
11. Martinelli, F.: Analysis of security protocols as open systems. Theoretical Computer
Science , 290(1), (2003) 1057-1106
12. Martinelli, F., Petrocchi, M., and Vaccarelli, A.: PaMoChSA: A tool for verification
of security protocols based on partial model checking. Tool Demo at the 1st Inter-
national School on Formal Methods for the Design of Computer, Communication
and Software Systems: Process Algebras. (2001)
13. Milner, R.: Communication and Concurrency . International Series in Computer
Science. Prentice Hall (1989)
14. Ryan, P., Schneider, S., Goldsmith, M., Lowe, G., and Roscoe, B.: The Modelling
and Analysis of Security Protocols: the CSP Approach . Addison-Wesley (2000)
15. Schneider, S.: Verifying authentication protocols with CSP. In Proceedings of The
10th Computer Security Foundations Workshop . IEEE Computer Society Press
(1997)
16. Stirling, C.: Modal and temporal logics for processes. In Logics for Concurrency:
Structures versus Automata , volume 1043 of Lecture Notes in Computer Science
(1996) 149-237