Formal Proof of Impossibility of Reliability in Crashing Protocols

Gopinath, K and Pugalia, Anil K and Naidu, KVM (2004) Formal Proof of Impossibility of Reliability in Crashing Protocols. In: 6th International Workshop on Distributed Computing:IWDC 2004 (Lecture Notes in Computer Science), December 27-30, 2004, Kolkata, India, Vol.3326, 347-352.

PDF FormalProof_BC-Feb19th.pdf Restricted to Registered users only Download (102kB) | Request a copy

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.

Item Type:	Conference Paper
Publication:	6th International Workshop on Distributed Computing, IWDC 2004, Kolkata, India (Lecture Notes in Computer Science)
Publisher:	Springer Verlag
Additional Information:	Copyright of this article belongs to Springer Verlag.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	30 Nov 2007
Last Modified:	19 Sep 2010 04:35
URI:	http://eprints.iisc.ac.in/id/eprint/9952

Actions (login required)

View Item