Enhancing the fault-tolerance of nonmasking programs

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2003, Pages 441-449

  Kulkarni, Sandeep S ^a   Ebnenasir, Ali ^a  

^a Michigan State University   (United States)

Author keywords

Automatic addition of fault tolerance; Distributed programs; Fault tolerance; Formal methods; Program synthesis; Program transformation

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; COMPUTER SYSTEM RECOVERY; ITERATIVE METHODS; NETWORK PROTOCOLS; POLYNOMIALS; PROGRAM DIAGNOSTICS; REDUNDANCY;

BYZANTINE AGREEMENT; NONMASKING PROGRAMS; PROGRAM SYNTHESIS; TRIPLE MODULAR REDUNDANCY;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0038644227     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. S. S. Kulkarni and A. Arora. Automating the addition of fault-tolerance. Formal Techniques in Real-Time and Fault-Tolerant Systems, 2000. Also available as a Technical Report MSU-CSE-00-13 at Computer Science and Enigneering Department, Michigan State University, East Lansing, Michigan.
2. Sandeep S. Kulkarni, A. Arora, and A. Chippada. Polynomial time synthesis of byzantine agreement. Symposium on Reliable Distributed Systems, 2001.
3. A. Arora and S. S. Kulkarni. Designing masking fault-tolerance via nonmasking fault-tolerance. IEEE Transactions on Software Engineering, pages 435-450, June 1998. A preliminary version appears in the Proceedings of the Fourteenth Symposium on Reliable Distributed Systems, Bad Neuenahr, 1995, pages 174-185.
4. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 1982.
5. B. Alpern and F. B. Schneider. Defining liveness. Information Processing Letters, 21: 181-185, 1985.
6. A. Arora and M. G. Gouda. Closure and convergence: A foundation of fault-tolerant computing. IEEE Transactions on Software Engineering, 19(11):1015-1027, 1993.
7. S. S. Kulkarni. Component-based design of fault-tolerance. PhD thesis, Ohio State University, 1999.
8. P. Attie and E. Emerson. Synthesis of concurrent systems for an atomic read/write model of computation. ACM Symposium on the Principles of Distributed Computing (PODC), 1996.
9. P. Attie and A. Emerson. Synthesis of concurrent programs for an atomic read/write model of computation. ACM TOPLAS, 23(2), March 2001.
10. Sandeep S. Kulkarni and Ali Ebnenasir. Enhancing the fault-tolerance of nonmasking programs. Technical Report MSU-CSE-03-2, Computer Science and Engineering, Michigan State University, East Lansing, Michigan, 2003.
11. S. Kulkarni and A. Ebnenasir. The complexity of adding failsafe fault-tolerance. International Conference on Distributed Computing Systems, 2002.
12. E.A. Emerson and E.M. Clarke. Using branching time temporal logic to synthesis synchronization skeletons. Science of Computer Programming, 2(3):241-266, 1982.
13. A. Arora, P. C. Attie, and E. A. Emerson. Synthesis of fault-tolerant concurrent programs. Proceedings of the 17th ACM Symposium on Principles of Distributed Computing (PODC), 1998.
14. O. Kupferman and M. Vardi. Synthesis with incomplete information. International Conference on Temporal Logic, 1997.