Efficient model checking of fault-tolerant distributed protocols

Péter Bokor, Johannes Kinder, Marco Serafini, Neeraj Suri

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

17 Citations (Scopus)

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 publicationProceedings of the International Conference on Dependable Systems and Networks
Pages73-84
Number of pages12
DOIs
Publication statusPublished - 26 Aug 2011
Externally publishedYes
Event2011 IEEE/IFIP 41st International Conference on Dependable Systems and Networks, DSN 2011 - Hong Kong, Hong Kong
Duration: 27 Jun 201130 Jun 2011

Other

Other2011 IEEE/IFIP 41st International Conference on Dependable Systems and Networks, DSN 2011
CountryHong Kong
CityHong Kong
Period27/6/1130/6/11

Fingerprint

Model checking
Network protocols
Data storage equipment
Costs

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this

Bokor, P., Kinder, J., Serafini, M., & Suri, N. (2011). Efficient model checking of fault-tolerant distributed protocols. In Proceedings of the International Conference on Dependable Systems and Networks (pp. 73-84). [5958208] https://doi.org/10.1109/DSN.2011.5958208

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

Proceedings of the International Conference on Dependable Systems and Networks. 2011. p. 73-84 5958208.

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

Bokor, P, Kinder, J, Serafini, M & Suri, N 2011, Efficient model checking of fault-tolerant distributed protocols. in Proceedings of the International Conference on Dependable Systems and Networks., 5958208, pp. 73-84, 2011 IEEE/IFIP 41st International Conference on Dependable Systems and Networks, DSN 2011, Hong Kong, Hong Kong, 27/6/11. https://doi.org/10.1109/DSN.2011.5958208
Bokor P, Kinder J, Serafini M, Suri N. Efficient model checking of fault-tolerant distributed protocols. In Proceedings of the International Conference on Dependable Systems and Networks. 2011. p. 73-84. 5958208 https://doi.org/10.1109/DSN.2011.5958208
Bokor, Péter ; Kinder, Johannes ; Serafini, Marco ; Suri, Neeraj. / Efficient model checking of fault-tolerant distributed protocols. Proceedings of the International Conference on Dependable Systems and Networks. 2011. pp. 73-84
@inproceedings{f3a887dc27f44bd086267f05fffba8e9,
title = "Efficient model checking of fault-tolerant distributed protocols",
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.",
author = "P{\'e}ter Bokor and Johannes Kinder and Marco Serafini and Neeraj Suri",
year = "2011",
month = "8",
day = "26",
doi = "10.1109/DSN.2011.5958208",
language = "English",
isbn = "9781424492336",
pages = "73--84",
booktitle = "Proceedings of the International Conference on Dependable Systems and Networks",

}

TY - GEN

T1 - Efficient model checking of fault-tolerant distributed protocols

AU - Bokor, Péter

AU - Kinder, Johannes

AU - Serafini, Marco

AU - Suri, Neeraj

PY - 2011/8/26

Y1 - 2011/8/26

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=80051925539&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80051925539&partnerID=8YFLogxK

U2 - 10.1109/DSN.2011.5958208

DO - 10.1109/DSN.2011.5958208

M3 - Conference contribution

SN - 9781424492336

SP - 73

EP - 84

BT - Proceedings of the International Conference on Dependable Systems and Networks

ER -