Efficient model checking of fault-tolerant distributed protocols
Authors:
- 1 June 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 73-84
Abstract
To aid the formal verification of fault-tolerant distributed protocols, we propose an approach that significantly reduces the costs of their model checking. These protocols often specify atomic, process-local events that consume a set of messages, change the state of a process, and send zero or more messages. We call such events quorum transitions and leverage them to optimize state exploration in two ways. First, we generate fewer states compared to models where quorum transitions are expressed by single-message transitions. Second, we refine transitions into a set of equivalent, finer-grained transitions that allow partial-order algorithms to achieve better reduction. We implement the MP-Basset model checker, which supports refined quorum transitions. We model check protocols representing core primitives of deployed reliable distributed systems, namely: Paxos consensus, regular storage, and Byzantine-tolerant multicast. We achieve up to 92% memory and 85% time reduction compared to model checking with standard unrefined single-message transitions.Keywords
This publication has 20 references indexed in Scilit:
- Application-Level Diagnostic and Membership Protocols for Generic Time-Triggered SystemsIEEE Transactions on Dependable and Secure Computing, 2011
- Actor frameworks for the JVM platform2009
- Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique2009
- A Reduction Theorem for the Verification of Round-Based Distributed AlgorithmsLecture Notes in Computer Science, 2009
- Cartesian Partial-Order Reduction2007
- Distributed Computing2004
- Distributed Systems for System Architects2001
- The state explosion problem1998
- Sharing memory robustly in message-passing systemsJournal of the ACM, 1995
- Abstracting interactions based on message setsLecture Notes in Computer Science, 1995