Title :
Self-Stabilizing Programs: The Fault-Tolerant Capability of Self-Checking Programs
Author_Institution :
Department of Computer and Information Sciences, Texas A & M University
fDate :
7/1/1982 12:00:00 AM
Abstract :
Self-checking programs are programs which meet the following condition. For any legal input, either they return the correct output or they return a message indicating that the output may be incorrect. Self-checking programs are capable of recognizing irregular conditions in their state space and reporting it. Self-stabilizing programs are programs which, in addition to (or instead of) reporting irregular conditions in their state space, take action to recover from them. This correspondence describes how to formally verify that a program is self-checking or self-stabilizing and discusses the relationship between the thoroughness of recovery actions in a self-stabilizing program and the overall quality of the program.
Keywords :
Asserted programs; assertions; frame of assertions; program validation; recovery; self-checking programs; self-stabilizing programs; Algorithms; Fault tolerance; Guidelines; Law; Legal factors; Programming profession; State-space methods; Terminology; Testing; Asserted programs; assertions; frame of assertions; program validation; recovery; self-checking programs; self-stabilizing programs;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1982.1676067