Formal proof of impossibility of reliability in crashing protocols

Authors:
K. Gopinath;Anil K. Pugalia;K. V. M. Naidu
Affiliations:
Computer Science & Automation Indian Institute of Science, Bangalore;Computer Science & Automation Indian Institute of Science, Bangalore;Computer Science & Automation Indian Institute of Science, Bangalore
Venue:
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Year:
2004

Citing 4
Cited 0

Symbolic model checking: an approach to the state explosion problem

Symbolic model checking: an approach to the state explosion problem
The impossibility of implementing reliable communication in the face of crashes

Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
The fault span of crash failures

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a strictly asynchronous system with process failures, it has been known that distributed consensus is impossible [FLP85]. It also has been shown that without persistence, no data link layer can work correctly (this includes all the well known and widely used protocols such as HDLC, etc) [FLMS93]. This work has been extended recently to study the fault span of crash failures [JV00]. In this paper, we present a formal proof of the non-existence of correct crashing network protocols with either unreliable FIFO, reliable FIFO or reliable non-FIFO links using the Input/Output Automata formalism in PVS, a verification system based on higher-order logic.