Transformation of programs for fault-tolerance |
| |
Authors: | Zhiming Liu Mathai Joseph |
| |
Affiliation: | (1) Department of Computer Science, University of Warwick, CV4 7AL Coventry, UK |
| |
Abstract: | In this paper we describe how a program constructed for afault-free system can be transformed into afault-tolerant program for execution on a system which is susceptible to failures. A program is described by a set of atomic actions which perform transformations from states to states. We assume that a fault environment is represented by a programF. Interference by the fault environmentF on the execution of a programP can then be described as afault-transformation which transformsP into a program (P). This is proved to be equivalent to the programPP
F
, whereP
F
is derived fromP andF, and defines the union of the sets of actions ofP andF
P
. A recovery transformation transformsP into a program (P) =PR by adding a set ofrecovery actions R, called arecovery program. If the system isfailstop and faults do not affect recovery actions, we have ((P))=(P)R=PP
F
R We illustrate this approach to fault-tolerant programming by considering the problem of designing a protocol that guarantees reliable communication from a sender to a receiver in spite of faults in the communication channel between them. |
| |
Keywords: | Failure semantics Consistency Fault-tolerant transformation Fault-tolerant refinement |
本文献已被 SpringerLink 等数据库收录! |