Experimental evaluation of the fail-silent behaviour in programs with consistency checks

Zenha-Rela, Mario; Madeira, Henrique; Silva, João Gabriel

doi:10.1109/ftcs.1996.534625

Cited by 49 publications

(17 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Previous empirical evaluation of run-time checks have generally used small samples of programs, or single programs [4,7,11]. Importantly, we run these measures on a large population of programs.…”

Section: Introductionmentioning

confidence: 99%

On the Effectiveness of Run-Time Checks

Meulen

Strigini

Revilla

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Citation: van der Meulen, M., Strigini, L. and Revilla, M. A. (2005). On the effectiveness of run-time checks. Computer Safety, Reliability and Security, 3688, pp. 151-164. doi: 10.1007/11563228_12 This is the unspecified version of the paper.This version of the publication may differ from the final published version. Abstract. Run-time checks are often assumed to be a cost-effective way of improving the dependability of software components, by checking required properties of their outputs and flagging an output as incorrect if it fails the check. However, evaluating how effective they are going to be in a future application is difficult, since the effectiveness of a check depends on the unknown faults of the program to which it is applied. A programming contest, providing thousands of programs written to the same specifications, gives us the opportunity to systematically test runtime checks to observe statistics of their effects on actual programs. In these examples, run-time checks turn out to be most effective for unreliable programs. For more reliable programs, the benefit is relatively low as compared to the gain that can be achieved by other (more expensive) measures, most notably multiple-version diversity. Permanent

show abstract

Section: Introductionmentioning

confidence: 99%

On the Effectiveness of Run-Time Checks

Meulen

Strigini

Revilla

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Behavior-based error detection techniques are quite promising in that respect. Several studies have investigated the possibility of using them to build low redundancy failsilent systems ( [4] [5] [6] [7]). A common conclusion of those studies is that the crash of a system due to a fault is easy to detect, but when the system produces some output, it is much harder to know whether it has been affected by some fault or not.…”

Section: Introductionmentioning

confidence: 99%

Robust assertions and fail-bounded behavior

Prata¹,

Zenha-Rela²,

Madeira³

et al. 2005

J. Braz. Comp. Soc.

View full text Add to dashboard Cite

“…Together with a fault-handling specification, the compiler can produce a hardened and semantically equivalent implementation. Previous work on compiler solutions to fault tolerance include control-flow checking [18], [19], algorithm-based fault tolerance (ABFT) [20], heuristic rules [21], [22], assertions [23], and process [24] and instruction duplication [25], [26]. These methods range from specialized (efficient but only applicable to certain parts/algorithms of the program) to general (protecting whole programs but potentially compromising performance).…”

Section: Related Workmentioning

confidence: 99%

ROSE::FTTransform - A source-to-source translation framework for exascale fault-tolerance research

Lidman

Quinlan

Liao

et al. 2012

IEEE/IFIP International Conference on Dependable Systems and Networks Workshops (DSN 2012)

View full text Add to dashboard Cite

Abstract-Exascale computing systems will require sufficient resilience to tolerate numerous types of hardware faults while still assuring correct program execution. Such extreme-scale machines are expected to be dominated by processors driven at lower voltages (near the minimum 0.5 volts for current transistors). At these voltage levels, the rate of transient errors increases dramatically due to the sensitivity to transient and geographically localized voltage drops on parts of the processor chip. To achieve power efficiency, these processors are likely to be streamlined and minimal, and thus they cannot be expected to handle transient errors entirely in hardware. Here we present an open, compiler-based framework to automate the armoring of High Performance Computing (HPC) software to protect it from these types of transient processor errors. We develop an open infrastructure to support research work in this area, and we define tools that, in the future, may provide more complete automated and/or semi-automated solutions to support software resiliency on future exascale architectures. Results demonstrate that our approach is feasible, pragmatic in how it can be separated from the software development process, and reasonably efficient (0% to 30% overhead for the Jacobi iteration on common hardware; and 20%, 40%, 26%, and 2% overhead for a randomly selected subset of benchmarks from the Livermore Loops [1]).

show abstract

Experimental evaluation of the fail-silent behaviour in programs with consistency checks

Cited by 49 publications

References 11 publications

On the Effectiveness of Run-Time Checks

On the Effectiveness of Run-Time Checks

Robust assertions and fail-bounded behavior

ROSE::FTTransform - A source-to-source translation framework for exascale fault-tolerance research

Contact Info

Product

Resources

About