Communications of the ACM
Relations and graphs: discrete mathematics for computer scientists
Relations and graphs: discrete mathematics for computer scientists
A relational division operator: the conjugate kernel
Theoretical Computer Science
Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
Computer program construction
A relational basis for program construction by parts
A relational basis for program construction by parts
Relational methods in computer science
Relational methods in computer science
The Science of Programming
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
A Discipline of Programming
Combining Fault Avoidance, Fault Removal and Fault Tolerance: An Integrated Model
ASE '99 Proceedings of the 14th IEEE international conference on Automated software engineering
RE '01 Proceedings of the Fifth IEEE International Symposium on Requirements Engineering
Hi-index | 0.00 |
Fault tolerance is the ability of a system to continue delivering its services after faults have caused errors. We have argued, in the past, that complex and/or critical systems are best validated by a wide range of methods, including proving, testing, and fault tolerance; we have also argued that in order to use these methods in concert, we need to cast them in a common framework. In this paper, we present mathematical characterizations of fault tolerance properties, using a relational calculus.