TY - JOUR
T1 - The use of executable assertions for error detection and damage assessment
AU - Jaoua, Ali
AU - Mili, Ali
N1 - Funding Information:
This research is supported in part by the Directorship of Scientific and Technical Research, at the Tunisian Ministry of Higher Education and Scientific Research, under research contract number MA7-85. Also, it is the subject of a joint research programme between the University of Tunis and the Universitd Paul Sabatier in Toulouse, France. The authors are grateful to Dr. N. Bendtige and the anonymous reviewers for their comments and suggestions for improvements.
Copyright:
Copyright 2014 Elsevier B.V., All rights reserved.
PY - 1990/4
Y1 - 1990/4
N2 - A fault-tolerant program is one that can continue service after faults have adversely affected the state of the program. The process by which a program can tolerate faults is divided into four phases: error detection, when the fault is first detected; damage assessment, when the damage caused by the fault is assessed; fault removal, when the fault is diagnosed, then removed; finally, error recovery, when the impact of the fault on the state of the program is corrected. In this article, we are interested in the first two phases. We discuss means to carry these phases out, using executable assertions. Appropriate executable assertions are derived by solving algebraic equations in the Tarski calculus of relations.
AB - A fault-tolerant program is one that can continue service after faults have adversely affected the state of the program. The process by which a program can tolerate faults is divided into four phases: error detection, when the fault is first detected; damage assessment, when the damage caused by the fault is assessed; fault removal, when the fault is diagnosed, then removed; finally, error recovery, when the impact of the fault on the state of the program is corrected. In this article, we are interested in the first two phases. We discuss means to carry these phases out, using executable assertions. Appropriate executable assertions are derived by solving algebraic equations in the Tarski calculus of relations.
UR - http://www.scopus.com/inward/record.url?scp=0025415666&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0025415666&partnerID=8YFLogxK
U2 - 10.1016/0164-1212(90)90063-R
DO - 10.1016/0164-1212(90)90063-R
M3 - Article
AN - SCOPUS:0025415666
SN - 0164-1212
VL - 12
SP - 15
EP - 37
JO - The Journal of Systems and Software
JF - The Journal of Systems and Software
IS - 1
ER -