Abstract
This paper presents an application of PVS to the verification of security protocols. The objective is to provide mechanical support for a verification method described in [14]. The PVS formalization consists of a semantic embedding of CSP and of a collection of theorems and proof rules for reasoning about authentication properties. We present an application to the Needham-Schroeder public key protocol.
Cite
CITATION STYLE
Dutertre, B., & Schneider, S. (1997). Using a PVS embedding of CSP to verify authentication protocols. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1275, pp. 121–136). Springer Verlag. https://doi.org/10.1007/bfb0028390
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
