Abstract.
In this paper we explore how partial-order reduction can make the task of verifying security protocols more efficient. These reduction techniques have been implemented in our tool Brutus. Partial-order reductions have proved very useful in the domain of model checking reactive systems. These reductions are not directly applicable in our context because of additional complications caused by tracking knowledge of various agents. We present partial-order reductions in the context of verifying security protocols and prove their correctness. Experimental results demonstrating the effectiveness of this reduction technique are also presented.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Published online: 24 January 2003
Rights and permissions
About this article
Cite this article
Clarke, E., Jha, S. & Marrero, W. Efficient verification of security protocols using partial-order reductions . STTT 4, 173–188 (2003). https://doi.org/10.1007/s10009-002-0103-4
Issue Date:
DOI: https://doi.org/10.1007/s10009-002-0103-4