Efficient model checking of fault-tolerant distributed protocols. / Bokor, Péter; Kinder, Johannes; Serafini, Marco; Suri, Neeraj.

Proc. 41st Int Conf. Dependable Systems and Networks (DSN-DCCS 2011). IEEE, 2011. p. 73-84.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Published

Documents

  • dsn2011

    Accepted author manuscript, 253 KB, PDF document

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.
Original languageEnglish
Title of host publicationProc. 41st Int Conf. Dependable Systems and Networks (DSN-DCCS 2011)
PublisherIEEE
Pages73-84
DOIs
Publication statusPublished - 2011
This open access research output is licenced under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.

ID: 17558009