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.
My Menu
Saved Items

Paper Sessions
Concurrency: Responsive Systems

Trace-based compositional reasoning about fault tolerant systems

Henk SchepersContact Information and Jozef HoomanContact Information

(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: lsquoFault Tolerance: Paradigms, Models, Logics, Constructionrsquo.
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.111 • Server: mpweb06
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)