FTSyn: a framework for automatic synthesis of fault-tolerance

In this paper, we present a software framework for adding fault-tolerance to existing finite-state programs. The input to our framework is a fault-intolerant program and a class of faults that perturbs the program. The output of our framework is a fault-tolerant version of the input program. Our fra...

Full description

Saved in:
Bibliographic Details
Published in:International journal on software tools for technology transfer Vol. 10; no. 5; pp. 455 - 471
Main Authors: Ebnenasir, Ali, Kulkarni, Sandeep S., Arora, Anish
Format: Journal Article
Language:English
Published: Berlin/Heidelberg Springer-Verlag 01.10.2008
Springer
Springer Nature B.V
Subjects:
Applied sciences
Computer Science
Computer science; control theory; systems
Computer systems performance. Reliability
Exact sciences and technology
Fault tolerance
Heuristic
Programming theory
Regular Contribution
Software
Software Engineering
Software Engineering/Programming and Operating Systems
Theoretical computing
Theory of Computation
Automatic addition of fault-tolerance
Fault-tolerance
Distributed programs
Formal methods
Program synthesis
Fault-tolerance, Automatic addition of fault-tolerance
Automatic programming
Formal method
Software development
Byzantine behavior
Finite state machine
Transmission protocol
Program transformation
Teaching
Polynomial time
Fault tolerance
Token ring
Distributed algorithm
Heuristic method
Aircraft
Fault tolerant system
ISSN:1433-2779, 1433-2787
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we present a software framework for adding fault-tolerance to existing finite-state programs. The input to our framework is a fault-intolerant program and a class of faults that perturbs the program. The output of our framework is a fault-tolerant version of the input program. Our framework provides (1) the first automated tool for the synthesis of fault-tolerant distributed programs, and (2) an extensible platform for researchers to develop a repository of heuristics that deal with the complexity of adding fault-tolerance to distributed programs. We also present a set of heuristics for polynomial-time addition of fault-tolerance to distributed programs. We have used this framework for automated synthesis of several fault-tolerant programs including a simplified version of an aircraft altitude switch, token ring, Byzantine agreement, and agreement in the presence of Byzantine and fail-stop faults. These examples illustrate that our framework can be used for synthesizing programs that tolerate different types of faults (process restarts, Byzantine and fail-stop) and programs that are subject to multiple faults (Byzantine and fail-stop) simultaneously. We have found our framework to be highly useful for pedagogical purposes, especially for teaching concepts of fault-tolerance, automatic program transformation, and the effect of heuristics.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1433-2779
1433-2787
DOI:10.1007/s10009-008-0083-0