See this document in CiteSeerX!

A Formally Verified Algorithm for Interactive Consistency Under a Hybrid Fault Model (1993)  (Make Corrections)  (44 citations)
Patrick Lincoln, John Rushby
Proc. 23rd Int. Conf. on Fault-Tolerant Computing (FTCS-23)



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
sri.com/~lincoln/papers/ftcs93.ps.gz
sri.com/users/lincoln/pa...ftcs93.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  sri.com/~lincoln...lincolnpapers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Thambidurai and Park [13] have proposed an algorithm for Interactive Consistency that retains resilience to the arbitrary (or Byzantine) fault mode, while tolerating more faults of simpler kinds than standard Byzantine-resilent algorithms. Unfortunately, and despite a published proof of correctness, their algorithm is flawed. We detected this while undertaking a formal verification of the algorithm. We present a corrected algorithm that has been subjected to mechanically-checked formal... (Update)

Cited by:   More
Formal Verification of Time-Triggered Systems - Pike (2006)   (Correct)
Reaching Strong Consensus in a General Network - Hsiao, Chin, Yang (2002)   (Correct)
Formal Specification and Verification of the.. - Layouni, Hooman, Tahar (2003)   (Correct)

Similar documents (at the sentence level):
6.4%:   The Formal Verification of an Algorithm for Interactive.. - Lincoln, Rushby (1993)   (Correct)

Active bibliography (related documents):   More   All
0.7:   Formal Verification of an Interactive Consistency Algorithm.. - Lincoln, Rushby (1994)   (Correct)
0.4:   Formal Verification of Hybrid Byzantine Agreement Under Link Faults - Rushby (2001)   (Correct)
0.4:   Formal Verification for Fault-Tolerant.. - Owre, Rushby.. (1995)   (Correct)

System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text:   More   All
0.7:   The Byzantine Generals Problem - Lamport, Shostak, Pease (1982)   (Correct)
0.5:   Byzantine Agreements in Secure Communication - Wagner (2002)   (Correct)
0.3:   Fail-Stutter Fault Tolerance - Arpaci-Dusseau, Arpaci-Dusseau (2001)   (Correct)

Related documents from co-citation:   More   All
22:   Interactive consistency with multiple failure modes (context) - Thambidurai, Park - 1988
16:   ACM Transactions on Programming Languages and Systems (context) - Lamport, Shostak et al. - 1982
15:   Reaching Agreement in the Presence of Faults (context) - Pease, Shostak et al. - 1980

BibTeX entry:   (Update)

Patrick Lincoln and John Rushby, "A formally verified algorithm for interactive consistency under a hybrid fault model", in Fault Tolerant Computing Symposium 23, pp. 402--411, Toulouse, France, June 1993. IEEE Computer Society. http://citeseer.ist.psu.edu/lincoln93formally.html   More

@inproceedings{ lincoln93formally,
    author = "P. Lincoln and J. Rushby",
    title = "A Formally Verified Algorithm for Interactive Consistency Under a Hybrid Fault Model",
    booktitle = "Proc. 23rd Int. Conf. on Fault-Tolerant Computing ({FTCS}-23)",
    publisher = "IEEE Computer Society Press",
    address = "Toulouse, France",
    pages = "402--411",
    year = "1993",
    url = "citeseer.ist.psu.edu/lincoln93formally.html" }
Citations (may not include all citations):
625   ACM Transactions on Programming Languages and Systems (context) - Lamport, Shostak et al. - 1982
295   PVS: A prototype verification system (context) - Owre, Rushby et al. - 1992  DBLP
270   Formal verification for fault-tolerant architectures: Some l.. - Owre, Rushby et al. - 1993  DBLP
256   Reaching agreement in the presence of faults (context) - Pease, Shostak et al. - 1980  ACM   DBLP
55   Interactive consistency with multiple failure modes (context) - Thambidurai, Park - 1988  DBLP
39   Formal verification of algorithms for critical systems (context) - Rushby, von Henke - 1993  ACM   DBLP
31   Consensus with dual failure modes (context) - Meyer, Pradhan - 1991  ACM   DBLP
30   Formal verification of an algorithm for interactive consiste.. - Lincoln, Rushby - 1993
30   Formal verification of an algorithm for interactive consiste.. - Lincoln, Rushby - 1993
15   Formal verification of an Oral Messages algorithm for intera.. - Rushby - 1992  ACM
14   An efficient algorithm for Byzantine Agreement without authe.. - Dolev, Fisher et al. - 1982  DBLP
11   Machine checked proofs of the design of a fault-tolerant cir.. (context) - Bevier, Young - 1992
10   Development and flight test experiences with a flight-crucia.. (context) - Mackall - 1988
3   On reliability modeling of fault-tolerant distributed system.. (context) - Thambidurai, Park et al. - 1989



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www2.csl.sri.com/~lincoln/lincoln-papers.html):   More
Simulation and Performance Estimation for the Rewrite Rule.. - Hitoshi Aida (1992)   (Correct)
Decision Problems for Propositional Linear Logic - Lincoln, Mitchell, Scedrov.. (1990)   (Correct)
A Probabilistic Poly-Time Framework for Protocol Analysis - Lincoln, Mitchell.. (1998)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC