Verifying security protocols with PVS: widening the rank function approach.

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
Authors :	Name Email ORCID Evans, N Schneider, SA s.schneider@surrey.ac.uk
Date :	2005
DOI :	10.1016/j.jlap.2004.09.005
Related URLs :	Publisher
Depositing User :	Symplectic Elements
Date Deposited :	17 May 2017 11:30
Last Modified :	16 Jan 2019 18:16
URI:	http://epubs.surrey.ac.uk/id/eprint/831636

Actions (login required)

View Item

Downloads