Component based design of multitolerant systems

IEEE Transactions on Software Engineering

Volumn 24, Issue 1, 1998, Pages 63-78

  Arora, Anish ^a   Kulkarni, Sandeep S ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

Compositional design; Correctors; Dependability; Detectors; Fault tolerance; Formal methods; Graceful degradation; Interference freedom; Stepwise design

Indexed keywords

EID: 0001893711     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.663998     Document Type: Article

References (27)

1. D. Siewiorek and R.S. Swarz, Reliable Computer Systems: Design and Evaluation. Digital Press, 1992.
2. W.N. Toy and L.C. Toy, The AT&T Case, ch.8, in [1].
3. R.W. Kocsis, The Galileo Case, ch. 9, in [1].
4. F.B. Bastani, I.-L. Yen, and I.-R. Chen, A Class of Inherently Fault-Tolerant Distributed Programs, IEEE Trans. Software Eng., vol. 14, no. 10, pp. 1,431-1,442, 1988.
5. A. Arora, A Foundation of Fault-Tolerant Computing, PhD thesis, Univ. of Texas at Austin, 1992.
6. S. Dolev and T. Herman, Superstabilzing Protocols for Dynamic Distributed Systems, Proc. Second Workshop Self-Stabilizing Systems, 1995.
7. M. Gouda and M. Schneider, Maximal Flow Routing, Proc. Second Workshop Self-Stabilizing Systems, 1995.
8. I. Yen and F. Bastani, A Highly Safe Self-Stabilizing Mutual Exclusion Algorithm, Proc. Second Workshop Self-Stabilizing Systems, 1995.
9. B. Alpern and F.B. Schneider, Defining Liveness, Information Processing Letters, vol. 21, pp. 181-185, 1985.
10. A. Arora and M.G. Gouda, Closure and Convergence: A Foundation of Fault-Tolerant Computing, IEEE Trans. Software Eng., vol. 19, no. 11, pp. 1,015-1,027, 1993.
11. E.W. Dijkstra, A Discipline of Programming. Prentice Hall, 1976.
12. D. Gries. The Science of Programming. Springer-Verlag, 1981.
13. B. Alpern and F.B. Schneider, Proving Boolean Combinations of Deterministic Properties, Proc. Second Symp. Logic Computer Science, pp. 131-137, 1987.
14. K.M. Chandy and J. Misra, Parallel Program Design: A Foundation. Addison-Wesley, 1988.
15. M. Abadi and L. Lamport, The Existence of Refinement Mappings, Theoretical Computer Science, vol. 82, pp. 253-284, 1991.
16. G.M. Levin and D. Gries, A Proof Technique for Communicating Sequential Processes, Acta Informatica, pp. 281-302, 1981.
17. R.J.R. Back and K. Sere, Stepwise Refinement of Parallel Programs, ACM Trans. Software Eng. and Methodology, vol. 3, no. 4, pp. 133-180, 1994.
18. J. Misra and K.M. Chandy, Proofs of Networks of Processes, IEEE Trans. Software Eng., vol. 7, no. 4, pp. 417-426, 1981.
19. S. Owicki and D. Gries, An Axiomatic Proof Technique for Parallel Programs, Acta Informatica, vol. 6, pp. 319-340, 1976.
20. A. Arora and S.S. Kulkarni, Designing Masking Fault-Tolerance via Nonmasking Fault-Tolerance, IEEE Trans. Software Eng., 1998, to appear. A preliminary version appears in the Proc. 14th Symp. Reliable Distributed Systems, B. Neuenahr, ed., pp. 174-185, 1995.
21. J. Rushby, Critical System Properties: Survey and Taxonomy, Reliability Eng. and System, vol. 43, pp. 180-219, 1994.
22. M. Herlihy and J. Wing, Specifying Graceful Degradation, IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 93-104, 1991.
23. S.S. Kulkarni and A. Arora, Multitolerance in Distributed Reset, Chicago J. Theoretical Computer Science, Special Issue on Self-Stabilization, 1998, to appear.
24. A. Arora and S.S. Kulkarni, Multitolerance and Its Design, Technical Report OSU-CISRC 07/96 TR-37, Ohio State Univ., 1996.
25. A. Arora, M.G. Gouda, and G. Varghese, Constraint Satisfaction as a Basis for Designing Nonmasking Fault-Tolerance, J. High Speed Networks, vol. 5, no. 3, pp. 293-306, 1996.
26. S.S. Kulkarni and A. Arora, Multitolerant Barrier Synchronization, Information Processing Letters, vol. 64, no. 1, 1997.
27. S.S. Kulkarni and A. Arora, Compositional Design of Multitolerant Repetitive Byzantine Agreement, Proc. 17th Int'l Conf. Foundations Software Technology and Theoretical Computer Science, Kharagpur, India, Dec. 1997.