Sequentially untestable faults identified without search ("simple implications beat exhaustive search!")
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 259-266
- https://doi.org/10.1109/test.1994.527957
Abstract
This paper presents a novel fault-independent algorithm for identifying untestable faults in sequential circuits. The algorithm is based on a simple concept that a fault which requires an illegal combination of values as a necessary condition for its detection is untestable. It uses implications to find a subset of such faults whose detection requires conflicts on certain lines in the circuit. No global reset state is assumed and no state transition information is needed. Our fault-independent algorithm identifies untestable faults without any search as opposed to exhaustive search done by fault-oriented test generation algorithms. Results on benchmark and real circuits indicate that we find a large number of untestable faults, much faster (up to 3 orders of magnitude) than a test-generation-based algorithm that targeted the faults identified by our algorithm. Moreover, many faults identified as untestable by our approach were aborted when targeted by a sequential test generator.Keywords
This publication has 15 references indexed in Scilit:
- The Best Flip-Flops to ScanPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Combinational profiles of sequential benchmark circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Low-cost redundancy identification for combinational circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An ATPG-based approach to sequential logic optimizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Redundancy identification/removal and test generation for sequential circuits using implicit state enumerationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993
- Classification of faults in synchronous sequential circuitsIEEE Transactions on Computers, 1993
- The multiple observation time test strategyIEEE Transactions on Computers, 1992
- One-pass redundancy identification and removalPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- On removing redundancy in sequential circuitsPublished by Association for Computing Machinery (ACM) ,1991
- Polynomially Complete Fault Detection ProblemsIEEE Transactions on Computers, 1975