The incorporation of a recovery algorithm into a program can be viewed as a program transformation, converting the basic program into a fault-tolerant version. We present a framework in which such program transformations are accompanied by a corresponding specification transformation which obtains properties of the fault tolerant versions of the programs from properties of the basic programs. Compositionality is achieved when every property of the fault tolerant version can be obtained from a transformed property of the basic program.
Bibliographical noteFunding Information:
Correspondence to: D. Peled, AT&T Bell Laboratories, 600 Mountain Avenue, Murray USA. Email addresses: email@example.com and firstname.lastname@example.org. * Supported in part by SERC research grants GR/F 57960 and CR/H 39499.