Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Trace-based compositional reasoning about fault tolerant systems
| |
|
Paper Sessions Concurrency: Responsive Systems
Trace-based compositional reasoning about fault tolerant systems
Henk Schepers1 and Jozef Hooman1 
| (1) |
Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands |
Abstract
In this report we present a compositional network proof theory to specify and verify safety properties of fault tolerant systems. Important in such systems is the fault hypothesis which specifies the class of faults that must be tolerated. In the formalism presented in this report, the fault hypothesis of a system is represented by a predicate which expresses how faults might transform the behaviour of the system. To reason about fault tolerant systems, we formulate a compositional proof method based on communication histories. Soundness and relative network completeness of the method is proven. Our approach is illustrated by applying it to the alternating bit protocol.
Key words Compositional proof theory - fault hypothesis - fault tolerance - relative network completeness - safety - soundness - specification - verification
Supported by the Dutch NWO under grant number NWI88.1517: Fault Tolerance: Paradigms, Models, Logics, Construction .
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|