Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 99-125 |
| Number of pages | 27 |
| Journal | Theoretical Computer Science |
| Volume | 128 |
| Issue number | 1-2 |
| DOIs | |
| State | Published - 6 Jun 1994 |
| Externally published | Yes |
Bibliographical note
Funding Information:Correspondence to: D. Peled, AT&T Bell Laboratories, 600 Mountain Avenue, Murray USA. Email addresses: [email protected] and [email protected]. * Supported in part by SERC research grants GR/F 57960 and CR/H 39499.
Funding
Correspondence to: D. Peled, AT&T Bell Laboratories, 600 Mountain Avenue, Murray USA. Email addresses: [email protected] and [email protected]. * Supported in part by SERC research grants GR/F 57960 and CR/H 39499.
| Funders | Funder number |
|---|---|
| Connecticut State Emergency Response Commission | CR/H 39499, GR/F 57960 |