Formal Verification of an Intrusion-Tolerant Group Membership Protocol(Verification and Dependability Analysis)(<Special Issue>Dependable Computing)
スポンサーリンク
概要
- 論文の詳細を見る
The traditional approach for establishing the correctness of group communication protocols is through rigorous arguments. While this is a valid approach, the likelihood of subtle errors in the design and implementation of such complex distributed protocols is not negligible. The use of formal verification methods has been widely advocated to instill confidence in the correctness of protocols. In this paper, we describe how we used the SPIN model checker to formally verify a group membership protocol that is part of an intrusion-tolerant group communication system. We describe how we successfully tackled the state-space explosion problem by determining the right abstraction level for formally specifying the protocol. The verification exercise not only formally showed that the protocol satisfies its correctness claims, but also provided information that will help us make the protocol more efficient without violating correctness.
- 社団法人電子情報通信学会の論文
- 2003-12-01
著者
-
Sanders William
University Of Illinois
-
Ramasamy Harigovind
University Of Illinois
-
CUKIER Michel
University of Maryland
-
Cukier Michel
University Of Maryland College Park
関連論文
- Formal Verification of an Intrusion-Tolerant Group Membership Protocol(Verification and Dependability Analysis)(Dependable Computing)
- Formal Verification of an Intrusion-Tolerant Group Membership Protocol