Model Checking of Fault-Tolerant Distributed Algorithms: from Classics towards Contemporary - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Documents Associated With Scientific Events Year : 2018

Model Checking of Fault-Tolerant Distributed Algorithms: from Classics towards Contemporary

Abstract

Fault-tolerant distributed algorithms-such as agreement, reliable broadcast, and consensus-lie at the heart of distributed systems. Although these algorithms are tiny in comparison to the rest of the system code, they are hard to design and verify. In this short research statement, we discuss the Byzantine model checker, which was developed for automatic verification of asynchronous fault-tolerant distributed algorithms. Further, we discuss the challenges that are posed by contemporary protocols for Blockchain consensus.
Fichier principal
Vignette du fichier
main.pdf (136.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01899723 , version 1 (19-10-2018)

Identifiers

  • HAL Id : hal-01899723 , version 1

Cite

Igor Konnov, Stephan Merz. Model Checking of Fault-Tolerant Distributed Algorithms: from Classics towards Contemporary. BCRB 2018 - DSN Workshop on Byzantine Consensus and Resilient Blockchains, Jun 2018, Luxembourg, Luxembourg. ⟨hal-01899723⟩
85 View
193 Download

Share

Gmail Facebook X LinkedIn More