(Enter summary)
Abstract: Fault-tolerant systems for critical applications
should tolerate as many kinds of faults and as large
a number of faults as possible, while using as little
hardware as feasible. And they should be provided
with strong assurances for their correctness.
Byzantine fault-tolerant architectures are attractive
because they tolerate any kind fault, but they are
rather expensive: at least 3m + 1 processors are required
to withstand m arbitrary faults. Two recent
developments mitigate some of the costs: ... (Update)
Context of citations to this paper: More
.... Agreement algorithm for an asymmetric architecture in less than a day by modifying an existing treatment for a symmetric architecture [7]. The ability to make these enhancements to complex algorithms, rapidly and reliably, is an opportunity created by mechanized formal methods....
.... is feasible in theory and it is achieved in practice by a very clever algorithm whose correctness has been formally verified [LR94] The interactive consistency algorithm of SPIDER is similar to that of FTP (with RMUs taking the part of the interstages) The...
Cited by: More
Formal Verification of Time-Triggered Systems - Pike (2006)
(Correct)
Model Checking Failed Conjectures in Theorem Proving: A.. - Pike, Miner.. (2004)
(Correct)
A Comparison of Bus Architectures for Safety-Critical Embedded.. - Rushby (2001)
(Correct)
Active bibliography (related documents): More All
0.7: Formal Verification for Fault-Tolerant.. - Owre, Rushby.. (1995)
(Correct)
0.7: Formal Methods and the Certification of Critical Systems - Rushby (1993)
(Correct)
0.7: A Formally Verified Algorithm for Interactive Consistency.. - Lincoln, Rushby (1993)
(Correct)
Similar documents based on text: More All
0.5: Formal Verification of Hybrid Byzantine Agreement Under Link Faults - Rushby (2001)
(Correct)
0.1: Mechanical Verification of a Generalized Protocol for Byzantine.. - Shankar (1992)
(Correct)
0.1: A Formally Verified Algorithm for Clock Synchronization Under a.. - Rushby (1994)
(Correct)
Related documents from co-citation: More All
10: A formally verified algorithm for interactive consistency under a hybrid fault m..
- Lincoln, Rushby - 1993
9: Formal verification for fault-tolerant architectures: Prolegomena to the design ..
- Owre, Rushby et al. - 1995
8: Formal verification of an algorithm for interactive consistency under a hybrid f..
- Lincoln, Rushby
BibTeX entry: (Update)
Patrick Lincoln and John Rushby, "Formal verification of an interactive consistency algorithm for the draper ftp architecture under a hybrid fault model", in COMPASS 94, June 1994. http://citeseer.ist.psu.edu/lincoln94formal.html More
@inproceedings{ lincoln94formal,
author = "Patrick Lincoln and John Rushby",
title = "Formal Verification of an Interactive Consistency Algorithm for the {Draper {FTP}} Architecture Under a Hybrid Fault Model",
booktitle = "{COMPASS} '94 (Proceedings of the Ninth Annual Conference on Computer Assurance)",
address = "Gaithersburg, MD",
pages = "107--120",
year = "1994",
url = "citeseer.ist.psu.edu/lincoln94formal.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
256
Reaching agreement in the presence of faults (context) - Pease, Shostak et al. - 1980 ACM DBLP
142
Synchronizing clocks in the presence of faults (context) - Lamport, Melliar-Smith - 1985 ACM DBLP
56
The MAFT architecture for distributed fault tolerance (context) - Kieckhafer, Walter et al. - 1988 ACM DBLP
55
Interactive consistency with multiple failure modes (context) - Thambidurai, Park - 1988 DBLP
44
A formally verified algorithm for interactive consistency un..
- Lincoln, Rushby - 1993 ACM 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
29
Formal Techniques in RealTime and Fault-Tolerant Systems (context) - Vytopil - 1992
26
Verification of fault-tolerant clock synchronization systems (context) - Miner - 1993 ACM
25
An introduction to formal specification and verification usi..
- Rushby, von Henke et al. - 1991
24
Mechanical verification of a generalized protocol for Byzant..
- Shankar
21
MJRTY--- a fast majority vote algorithm
- Boyer, Moore - 1991
19
A continuum of failure models for distributed computing
- Garay, Perry - 1992 ACM DBLP
16
A formally verified algorithm for clock synchronization unde..
- Rushby - 1994 ACM
15
Formal verification of an Oral Messages algorithm for intera..
- Rushby - 1992 ACM
12
A design approach for ultrareliable real-time systems (context) - Lala, Harper et al. - 1991 ACM
11
Machine checked proofs of the design of a faulttolerant circ.. (context) - Bevier, Young - 1992
9
A Byzantine resilient fault tolerant computer for nuclear po.. (context) - Lala - 1986
8
Fault-tolerant parallel processor (context) - Harper, Lala - 1991
5
NASA Langley's research program in formal methods (context) - Butler - 1991
3
A history of research in faulttolerant computing at SRI Inte.. (context) - Goldberg
3
On reliability modeling of faulttolerant distributed systems (context) - Thambidurai, Park et al. - 1989
2
volume 1 of Dependable Computing and FaultTolerant Systems (context) - Avizienis, Kopetz et al. - 1987
2
The evolution of fault tolerant computing at the Charles Sta.. (context) - Hopkins, Jaynarayan et al. - 1955
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.csl.sri.com/fm-papers.html): More
PVS: A Prototype Verification System - Reprint From
(Correct)
Proof Search in the Intuitionistic Sequent Calculus - Shankar (1991)
(Correct)
[12] Sam Owre, John Rushby, Natarajan Shankar, and.. - Fme Industrial-Strength
(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