scispace - formally typeset
Search or ask a question
Topic

Fault coverage

About: Fault coverage is a research topic. Over the lifetime, 10153 publications have been published within this topic receiving 161933 citations. The topic is also known as: test coverage.


Papers
More filters
DOI
30 Dec 1899
TL;DR: Current fault localization techniques are surveyed and a new technique called relational path analysis is proposed, which suggests that there exists information associated with stored execution paths of programs that, when analyzed heuristically, can localize faults with statistical significance.
Abstract: Software development is a complex and error prone process. As a result of this process, much time is spent debugging software. This debugging process actually consists of two activities, fault localization and repair. For most problems, much of the debugging effort is devoted to fault localization. In this paper, current fault localization techniques are surveyed and a new technique called relational path analysis is proposed. Relational path analysis suggests that there exists information associated with stored execution paths of programs that, when analyzed heuristically, can localize faults with statistical significance. This paper presents a set of candidate heuristics for relational path analysis and the results of an experiment utilizing the heuristics. Conclusions regarding the effectiveness and usability of this technique and future research in this area are also discussed.

47 citations

Proceedings ArticleDOI
20 Oct 1997
TL;DR: A new test effectiveness metric of probability of detection is defined and the application of the technique to an analog multiplier circuit is presented, which results in fault coverage figures more meaningful than those obtained with a fixed threshold.
Abstract: The paper presents a test pattern generation and fault simulation methodology for the detection of catastrophic faults in analogue circuits. The test methodology chosen for evaluation is RMS AC supply current monitoring. Tests are generated and evaluated taking account of the potential fault masking effects of process spread on the faulty circuit responses. A new test effectiveness metric of probability of detection is defined and the application of the technique to an analogue multiplier circuit is presented. The fault coverage figures are therefore more meaningful than those obtained with a fixed threshold, although they appear lower.

47 citations

Proceedings ArticleDOI
27 Mar 1988
TL;DR: This study uses Monte Carlo simulation and introduces a novel notion of machine equivalence and an algorithm given checks for this notion ofmachine equivalence.
Abstract: A description is given of an experience in estimating fault coverage of a test sequence designed to test the control portion of a protocol. The control portion of this protocol is modeled as a finite-state machine. This study uses Monte Carlo simulation and introduces a novel notion of machine equivalence. An algorithm given checks for this notion of machine equivalence. >

47 citations

Journal ArticleDOI
TL;DR: A partial isolation ring provides the same fault coverage as a full isolation ring but avoids adding multiplexers on critical timing paths and reduces area overhead.
Abstract: A partial isolation ring provides the same fault coverage as a full isolation ring but avoids adding multiplexers on critical timing paths and reduces area overhead. The authors examine several partial isolation ring selection strategies that vary in computational complexity.

47 citations

Journal ArticleDOI
TL;DR: This paper starts with a paradigmatic fault tolerance scheme that systematically adds redundancy into a discrete-time dynamic system in a way that achieves tolerance to transient faults in both the state transition and the error-correcting mechanisms, and obtains an efficient way of providing fault tolerance to k identical unreliable LFSMs that operate in parallel on distinct input sequences.
Abstract: This paper discusses fault tolerance in discrete-time dynamic systems, such as finite-state controllers or computer simulations, with focus on the use of coding techniques to efficiently provide fault tolerance to linear finite-state machines (LFSMs). Unlike traditional fault tolerance schemes, which rely heavily-particularly for dynamic systems operating over extended time horizons-on the assumption that the error-correcting mechanism is fault free, we are interested in the case when all components of the implementation are fault prone. The paper starts with a paradigmatic fault tolerance scheme that systematically adds redundancy into a discrete-time dynamic system in a way that achieves tolerance to transient faults in both the state transition and the error-correcting mechanisms. By combining this methodology with low-complexity error-correcting coding, we then obtain an efficient way of providing fault tolerance to k identical unreliable LFSMs that operate in parallel on distinct input sequences. The overall construction requires only a constant amount of redundant hardware per machine (but sufficiently large k) to achieve an arbitrarily small probability of overall failure for any prespecified (finite) time interval, leading in this way to a lower bound on the computational capacity of unreliable LFSMs.

47 citations


Network Information
Related Topics (5)
Fault tolerance
26.8K papers, 409.7K citations
85% related
Benchmark (computing)
19.6K papers, 419.1K citations
85% related
Fault detection and isolation
46.1K papers, 641.5K citations
85% related
CMOS
81.3K papers, 1.1M citations
84% related
Logic gate
35.7K papers, 488.3K citations
84% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202360
2022135
202167
202089
2019120
2018151