Time is not a healer

Santoro, Nicola; Widmayer, Peter

doi:10.1007/bfb0028994

Cited by 137 publications

(183 citation statements)

References 19 publications

Supporting

Mentioning

181

Contrasting

Order By: Relevance

“…By similar adaptations one models, e.g., corrupted communication (e.g., due to faulty links) [31], or hybrid fault models [4] that contain different fault scenarios. Figure 3 compares the number of states and memory consumption when modeling message passing using both solutions.…”

Section: Efficient Encoding Of Message Passingmentioning

confidence: 99%

“…As usual for fault-tolerant algorithms, this block has three logical parts: the receive part (lines [21][22][23][24], the computation part (lines [25][26][27][28][29][30][31][32], and the sending part (lines 33-38). As we have already discussed the encoding of message passing above, it remains to discuss the control flow of the algorithm.…”

Section: Encoding the Control Flowmentioning

confidence: 99%

See 1 more Smart Citation

Towards Modeling and Model Checking Fault-Tolerant Distributed Algorithms

John

Konnov

Schmid

et al. 2013

Model Checking Software

View full text Add to dashboard Cite

Abstract. Fault-tolerant distributed algorithms are central for building reliable, spatially distributed systems. In order to ensure that these algorithms actually make systems more reliable, we must ensure that these algorithms are actually correct. Unfortunately, model checking state-ofthe-art fault-tolerant distributed algorithms (such as Paxos) is currently out of reach except for very small systems. In order to be eventually able to automatically verify such fault-tolerant distributed algorithms also in larger systems, several problems have to be addressed. In this paper, we consider modeling and verification of fault-tolerant algorithms that basically only contain threshold guards to control the flow of the algorithm. As threshold guards are widely used in fault-tolerant distributed algorithms (and also in Paxos) efficient methods to handle them bring us closer to the above mentioned goal. As case study we use the reliable broadcasting algorithm by Srikanth and Toueg that tolerates even Byzantine faults. We show how one can model this basic fault-tolerant distributed algorithm in Promela such that safety and liveness properties can be efficiently verified in Spin. We provide experimental data also for other distributed algorithms.

show abstract

Section: Efficient Encoding Of Message Passingmentioning

confidence: 99%

Section: Encoding the Control Flowmentioning

confidence: 99%

Towards Modeling and Model Checking Fault-Tolerant Distributed Algorithms

John

Konnov

Schmid

et al. 2013

Model Checking Software

View full text Add to dashboard Cite

show abstract

“…The HO model [6] is a communication-closed round model that generalizes the asynchronous round model by Dwork et al [12] with some features of [14] and [24]. Let Π = {1, 2, · · · , n} be the set of processes.…”

Section: Consensus In the Heard-of Modelmentioning

confidence: 99%

Using Bounded Model Checking to Verify Consensus Algorithms

Tsuchiya

Schiper

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Classic results in distributed computing theory show that under general assumptions on the environment, fault tolerance is not achievable [32], [18], [40]. Hence, fault-tolerant distributed algorithms are based on quite involved assumptions on the environment, such as type of fault behavior, message delays, processing speeds.…”

mentioning

confidence: 99%

Communication-Closed Layers as Paradigm for Distributed Systems: A Manifesto

Drăgoi¹,

Lazić²,

Widder³

2018

Proceedings of the International Scientific Conference - Sinteza 2018

View full text Add to dashboard Cite

Abstract:Distributed computations are characterized by a partial order over events: two concurrent events at different processes may be re-ordered without changing the outcome of the computation. For systems that are composed of so-called communication-closed layers, this partial-order argument has been used by Elrad and Francez [13] to reduce the reasoning about distributed systems to a specific sequential form. We discuss existing techniques for communicationclosed layers, and discuss applications to automated verification of state-ofthe-art distributed systems.

show abstract

Time is not a healer

Cited by 137 publications

References 19 publications

Towards Modeling and Model Checking Fault-Tolerant Distributed Algorithms

Towards Modeling and Model Checking Fault-Tolerant Distributed Algorithms

Using Bounded Model Checking to Verify Consensus Algorithms

Communication-Closed Layers as Paradigm for Distributed Systems: A Manifesto

Contact Info

Product

Resources

About