CMU-CS-00-106 Computer Science Department School of Computer Science, Carnegie Mellon University
Toward Compositional Analysis of Security Protocols Using Theorem Proving Oleg Sheyner, Jeannette Wing January 2000
CMU-CS-00-106.ps
Various formalisms have been used successfully for reasoning about large protocol compositions by hand. However, hand proofs are prone to error. Automated proof systems can help make the proofs more rigorous. The goal of our work is to develop an automated proof environment for compositional reasoning about systems. This environment would combine the power of compositional reasoning with the rigor of mechanically-checked proofs. The hope is that the resulting system would be useful in verification of security protocols of real-life size and complexity. Toward this goal, we present results of a case study in compositional verification of a private communication protocol with the aid of automated proof tool Isabelle/IOA. 30 pages
| |
Return to:
SCS Technical Report Collection This page maintained by [email protected] |