See this document in CiteSeerX!

Automating the Addition of Fail-Safe Fault-Tolerance: Beyond Fusion-Closed Specifications (2004)  (Make Corrections)  
Felix C. Gärtner, Arshad Jhumka



  Home/Search   Context   Related

 
View or download:
i4.informatik.rwthaac...ftrtft2004.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  i4.informatik.r...ertner:2001:DRF (more)
(Enter author homepages)

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

Abstract: The fault tolerance theories by Arora and Kulkarni [3] and by Jhumka et al. [8] view a fault-tolerant program as the composition of a fault-intolerant program with fault tolerance components called detectors and correctors. At their core, the theories assume that the correctness specifications under consideration are fusion closed. In general, fusion closure of specifications can be achieved by adding history variables. (Update)

Similar documents (at the sentence level):
5.0%:   Automating the Addition of Fail-Safe Fault-Tolerance: Beyond.. - Gärtner, Jhumka (2003)   (Correct)

Active bibliography (related documents):   More   All
0.2:   Formale Grundlagen der Fehlertoleranz in verteilten Systemen - Gärtner (2001)   (Correct)
0.2:   On Systematic Design of Fast and Perfect Detectors - Jhumka, Gärtner, al. (2002)   (Correct)
0.2:   Resettable Vector Clocks: A Case Study in Designing Graybox.. - Demirbas (2000)   (Correct)

Similar documents based on text:   More   All
0.2:   An Exercise in Systematically Deriving Fault-Tolerance.. - Gärtner (1999)   (Correct)
0.2:   A Framework for the Design and Validation of Efficient.. - Jhumka, Suri, Hiller   (Correct)
0.2:   An Approach to Analysing the Propagation of Data Errors in.. - Hiller, Jhumka, Suri (2001)   (Correct)

BibTeX entry:   (Update)

@misc{ rtner-automating,
  author = "Felix C. Gärtner and Arshad Jhumka",
  title = "Automating the Addition of Fail-Safe Fault-Tolerance: Beyond Fusion-Closed
    Specifications",
  url = "citeseer.ist.psu.edu/722208.html" }
Citations (may not include all citations):
716   Parallel Program Design: A Foundation (context) - Chandy, Misra - 1988
274   The existence of refinement mappings - Abadi, Lamport - 1991
231   Information Processing Letters (context) - Alpern, Schneider - 1985
157   Proving the correctness of multiprocess programs (context) - Lamport - 1977
29   Component based design of multitolerant systems - Arora, Kulkarni - 1998
16   ACM Transactions on Programming Languages and Systems (context) - Liu, Joseph et al. - 1999
12   Automating the addition of fault-tolerance - Kulkarni, Arora - 2000
9   Another glance at the Alpern-Schneider characterization of s.. - Gumm - 1993
6   A case study in the mechanical verification of fault toleran.. - Mantel, Gartner - 2000
5   Specifying fault tolerance within stark's formalism - Cau, de Roever - 1993
3   On systematic design of fast and perfect detectors - Jhumka, Gartner et al. - 2002
2   Automating the addition of fail-safe fault-tolerance: Beyond.. (context) - Gartner, Jhumka - 2003

Documents on the same site (http://www-i4.informatik.rwth-aachen.de/lufg/publications/papers.de.html#Gaertner:2001:DRF):   More
Approaching a Formal Definition of Fairness in Electronic.. - Gärtner, Pagnia, Vogt (1999)   (Correct)
Failure Detection Sequencers: Necessary and Sufficient.. - Gärtner, Pleisch (2002)   (Correct)
On the Impossibility of Fair Exchange without a Trusted Third.. - Pagnia, Gärtner (1999)   (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