Verifying security protocols with PVS: widening the rank function approach.
Tools
Evans, N and Schneider, SA (2005) Verifying security protocols with PVS: widening the rank function approach. Journal of Logic and Algebraic Programming, 64 (2). pp. 253-284.
Full text not available from this repository.Item Type: | Article | |||||||||
---|---|---|---|---|---|---|---|---|---|---|
Divisions : | Surrey research (other units) | |||||||||
Authors : |
|
|||||||||
Date : | 2005 | |||||||||
DOI : | 10.1016/j.jlap.2004.09.005 | |||||||||
Related URLs : | ||||||||||
Depositing User : | Symplectic Elements | |||||||||
Date Deposited : | 17 May 2017 11:30 | |||||||||
Last Modified : | 24 Jan 2020 20:55 | |||||||||
URI: | http://epubs.surrey.ac.uk/id/eprint/831636 |
Actions (login required)
![]() |
View Item |
Downloads
Downloads per month over past year