Abstract. This paper presents an application of PVS to the veri cation of security protocols. The objective is to provide mechanical support for a veri cation 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.
Dutertre and Schneider REF used an embedding of CSP in PVS in order to verify the authentication property of Needham Shroeder public key protocol.
Using a PVS Embedding of CSP to Verify Authentication Protocols
In Theorem Proving in Higher Order Logics, TPHOL's 97
Computer Science