A Rigorous Approach to Fault-Tolerant Programming

Authors:
F. Cristian
Affiliations:
IBM Research Laboratory
Venue:
IEEE Transactions on Software Engineering
Year:
1985

Citing 0
Cited 6

Cesium: Testing Hard Real-time and Dependability Properties of Distributed Protocols

WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
Non-functional analysis of distributed systems in unreliable environments using stochastic object based graph grammars

ICGT'06 Proceedings of the Third international conference on Graph Transformations
Verifying fault-tolerant distributed systems using object-based graph grammars

LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
Encapsulating deontic and branching time specifications

Theoretical Computer Science
Model checking propositional deontic temporal logic via a μ-calculus characterization

SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
Middleware design for physically-asynchronous logically-synchronous (PALS) systems

Proceedings of the Eleventh ACM International Conference on Embedded Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

The design of programs that are tolerant of hardware fault occurrences and processor crashes is investigated. Using a stable storage management system as a running example, a new approach is suggested for specifying, understanding, and verifying the correctness of fault-tolerant software. The approach extends previously developed axiomatic reasoning methods to the design of fault-tolerant systems by modeling faults as being operations that are performed at random time intervals on any computing system by the system's adverse environment.