Title
Robust Assertions and Fail-Bounded Behavior.
Abstract
In this paper the behavior of assertion-based error detection mechanisms is characterized under faults in- jected according to a quite general fault model. Asser- tions based on the knowledge of the application can be very effective at detecting corruption of critical data caused by hardware faults. The main drawbacks of that approach are identified as being the lack of protection of data out- side the section covered by assertions, namely during in- put and output, and the possible incorrect execution of the assertions. To handle those weak-points the Robust Assertions technique is proposed, whose effectiveness is shown by extensive fault injection experiments. With this technique a system follows a new failure model, that is called Fail- Bounded, where with high probability all results produced are either correct or, if wrong, they are within a certain bound of the correct value, whose exact distance depends on the output assertions used. Any kind of assertions can be considered, from simple likelihood tests to high coverage assertions such as those used in the Algorithm Based Fault Tolerance para- digm. We claim that this failure model is very useful to describe the behavior of many low-cost fault-tolerant sys- tems, that have low hardware and software redundancy, like embedded systems, were cost is a severe restriction, yet full availability is expected.
Year
DOI
Venue
2005
10.1590/S0104-65002005000100003
J. Braz. Comp. Soc.
Keywords
Field
DocType
fault tolerant system,embedded system,error detection,fault tolerant,fault model
Stuck-at fault,Data mining,Computer science,Assertion,Software fault tolerance,Algorithm,Input/output,Redundancy (engineering),Fault tolerance,Fault injection,Fault model,Distributed computing
Journal
Volume
Issue
ISSN
10
3
1678-4804
Citations 
PageRank 
References 
1
0.36
36
Authors
4
Name
Order
Citations
PageRank
Paula Prata1266.58
Mário Zenha Rela212416.53
Henrique Madeira31307122.00
João Gabriel Silva461863.55