A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Automated Verification of Selected Equivalences for Security Protocols
20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05)
In the analysis of security protocols, methods and tools for reasoning about protocol behaviors have been quite effective. We aim to expand the scope of those methods and tools. We focus on proving equivalences P ≈ Q in which P and Q are two processes that differ only in the choice of some terms. These equivalences arise often in applications. We show how to treat them as predicates on the behaviors of a process that represents P and Q at the same time. We develop our techniques in the context
doi:10.1109/lics.2005.8
dblp:conf/lics/BlanchetAF05
fatcat:i3g2rwcltjanzhpm6h4rihtcnu