Skip to main content
Conference Proceedings

Checking secrecy by means of partial order reduction

Lecture Notes in Computer Science (2005) 3319 171-188
DOI: 10.1007/978-3-540-31810-1_12
8Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a partial order reduction for model checking security protocols for the secrecy property. Based on this reduction, we develop an automatic tool that can check security protocols for secrecy, given a finite execution scenario. We compare this tool to several other tools. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Cremers, C. J. F., & Mauw, S. (2005). Checking secrecy by means of partial order reduction. In Lecture Notes in Computer Science (Vol. 3319, pp. 171–188). Springer Verlag. https://doi.org/10.1007/978-3-540-31810-1_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free