Automating the addition of fail-safe fault-tolerance: Beyond fusion-closed specifications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3253, Issue , 2004, Pages 183-198

  Gärtner, Felix G ^a   Jhumka, Arshad ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANT COMPUTER SYSTEMS; REAL TIME SYSTEMS; SPECIFICATIONS; TIME SHARING SYSTEMS;

ADDITION OF FAULT-TOLERANCE; AUTOMATED METHODS; EXPONENTIAL GROWTH; FAIL SAFES; FAULT-TOLERANCE COMPONENTS; FAULT-TOLERANT; HISTORY INFORMATIONS; HISTORY VARIABLES;

FAULT TOLERANCE;

EID: 35048886623     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30206-3_14     Document Type: Article

References (12)

1. M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2):253-284, May 1991.
2. B. Alpern and F. B. Schneider. Defining liveness. Information Processing Letters, 21:181-185, 1985.
3. A. Arora and S. S. Kulkarni. Component based design of multitolerant systems. IEEE Transactions on Software Engineering, 24(1):63-78, Jan. 1998.
4. A. Cau and W.-P. de Roever. Specifying fault tolerance within stark's formalism. In J.-C. Laprie, editor, Proceedings of the 23rd Annual International Symposium on Fault-Tolerant Computing (FTCS '93), pages 392-401, Toulouse, France, June 1993. IEEE Computer Society Press.
5. K. M. Chandy and J. Misra. Parallel Program Design: A Foundation. AddisonWesley, Reading, MA, Reading, Mass., 1988.
6. F. C. Gärtner and A. Jhumka. Automating the addition of fail-safe fault-tolerance: Beyond fusion-closed specifications. Technical Report IC/2003/23, Swiss Federal Institute of Technology (EPFL), School of Computer and Communication Sciences, Lausanne, Switzerland, Apr. 2003.
7. H. P. Gumm. Another glance at the Alpern-Schneider characterization of safety and liveness in concurrent executions. Information Processing Letters, 47(6):291-294, 1993.
8. A. Jhumka, F. C. Gärtner, C. Fetzer, and N. Suri. On systematic design of fast and perfect detectors. Technical Report 200263, Swiss Federal Institute of Technology (EPFL), School of Computer and Communication Sciences, Lausanne, Switzerland, Sept. 2002.
9. S. S. Kulkarni and A. Arora. Automating the addition of fault-tolerance. In M. Joseph, editor, Formal Techniques in Real-Time and Fault-Tolerant Systems, 6th International Symposium (FTRTFT 2000) Proceedings, number 1926 in Lecture Notes in Computer Science, pages 82-93, Pune, India, Sept. 2000. SpringerVerlag.
10. L. Lamport. Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering, 3(2):125-143, Mar. 1977.
11. Z. Liu and M. Joseph. Specification and verification of fault-tolerance, timing and scheduling. ACM Transactions on Programming Languages and Systems, 21(1):46-89, 1999.
12. H. Mantel and F. C. Gärtner. A case study in the mechanical verification of fault tolerance. Journal of Experimental & Theoretical Artificial Intelligence (JETAI), 12(4):473-488, Oct. 2000.