The complexity of adding failsafe fault-tolerance

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2002, Pages 337-344

  Kulkarni, Sandeep S ^a   Ebnenasir, Ali ^a  

^a Michigan State University   (United States)

Author keywords

Distributed programs; Fault tolerance; Formal methods; Program synthesis; Program transformation

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; FAILURE ANALYSIS; POLYNOMIALS;

FAILSAFE FAULT-TOLERANCE PROGRAMS;

FAULT TOLERANT COMPUTER SYSTEMS;

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

References (14)

1. Automating the addition of fault-tolerance
2. Polynomial time synthesis of byzantine agreement
3. The consensus problem in fault-tolerant computing
4. The byzantine generals problem
5. Byzantine agreement with authentication: Observations and applications in tolerating hybrid and link faults
6. Defining liveness
7. Closure and convergence: A foundation of fault-tolerant computing
8. Synthesis of concurrent programs for an atomic read/write model of computation
9. Synthesis of fault-tolerant concurrent programs
10. Synthesis with incomplete information
11. On the synthesis of a reactive module
12. Reliability and synthesis of reactive modules