University of Surrey

Test tubes in the lab Research in the ATI Dance Research

A decision procedure for the existence of a rank function

Heather, J and Schneider, S (2005) A decision procedure for the existence of a rank function Journal of Computer Security, 13 (2). pp. 317-344.

Available under License : See the attached licence file.

Download (166kB)
Text (licence)

Download (33kB)


Schneider’s work on rank functions [17] provides a formal approach to verification of certain properties of a security protocol. However, he illustrates the approach only with a protocol running on a small network; and no help is given with the somewhat hit-and-miss process of finding the rank function that underpins the central theorem. In this paper, we develop the theory to allow for an arbitrarily large network, and give a clearly defined decision procedure by which one may either construct a rank function, proving correctness of the protocol, or show that no rank function exists. We briefly discuss the implications of the absence of a rank function, and the open question of completeness of the rank function theorem.

Item Type: Article
Divisions : Faculty of Engineering and Physical Sciences > Computer Science
Authors : Heather, J and Schneider, S
Date : 2005
Additional Information : © IOS Press. All rights reserved
Depositing User : Mr Adam Field
Date Deposited : 03 Feb 2012 10:29
Last Modified : 06 Jul 2019 05:09

Actions (login required)

View Item View Item


Downloads per month over past year

Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800