Factorizing fault tolerance

This paper presents a theory of component based development for exception-handling in fault tolerant systems. The theory is based on a general theory of composition, which enables us to factorize the temporal specification of a system into the specifications of its components. This is a new development because in the past efforts to set up such a theory have always been hindered by the problem of composing progress properties.

[1]  I. S. W. B. Prasetya.  Mechanically supported design of self-stabilizing algorithms , 1995 .

[2]  Pierre Collette,et al.  Composition of Assumption-Commitment Specifications in a UNITY Style , 1994, Sci. Comput. Program..

[3]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[4]  I. S. W. B. Prasetya,et al.  Component-wise formal approach to design distributed systems , 2000 .

[5]  S. Doaitse Swierstra,et al.  Towards the Formal Design of Self-Stabilizing Distributed Algorithms , 1993, STACS.

[6]  I. S. W. B. Prasetya.  Formalization of Variables Access Constraints to Support Compositionality of Liveness Properties , 1993, HUG.

[7]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[8]  Ted Herman.  Adaptivity through distributed convergence , 1992 .

[9]  Mathai Joseph,et al.  Transformation of programs for fault-tolerance , 2005, Formal Aspects of Computing.

[10]  Anish Arora.  A foundation of fault-tolerant computing , 1992 .

[11]  Anish Arora,et al.  Distributed Reset (Extended Abstract) , 1990, FSTTCS.

[12]  Mathai Joseph,et al.  Specification and verification of fault-tolerance, timing, and scheduling , 1999, TOPL.

[13]  Leslie Lamport,et al.  An Assertional Correctness Proof of a Distributed Algorithm , 1982, Sci. Comput. Program..

[14]  Orna Grumberg,et al.  Model checking and modular verification , 1994, TOPL.

[15]  Rob T. Udink,et al.  Program refinement in UNITY-like environments , 1995 .

[16]  Martín Abadi,et al.  Composing specifications , 1989, TOPL.