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 formula 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. A verification method for proving the correctness of formula transformations is presented. This makes it possible to prove just once that a formula transformation corresponds to a program transformation, removing the need to prove separately the correctness of each transformed program.
Original language | English |
---|---|
Title of host publication | PARLE 1993 - Parallel Architectures and Languages Europe - 5th International PARLE Conference, Proceedings |
Editors | Arndt Bode , Mike Reeve , Gottfried Wolf |
Publisher | Springer Verlag |
Pages | 173-184 |
Number of pages | 12 |
ISBN (Print) | 9783540568919 |
DOIs | |
State | Published - 1993 |
Externally published | Yes |
Event | 5th International Conference on Parallel Architectures and Languages Europe, PARLE 1993 - Munich, Germany Duration: 14 Jun 1993 → 17 Jun 1993 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 694 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 5th International Conference on Parallel Architectures and Languages Europe, PARLE 1993 |
---|---|
Country/Territory | Germany |
City | Munich |
Period | 14/06/93 → 17/06/93 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1993.