Search strategy switching: an alternative to increased backtracking
- 13 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 803-811
- https://doi.org/10.1109/test.1989.82369
Abstract
Test generation algorithms use search strategies to control decision making whenever the algorithms encounter a choice of a signal value or action. The authors' study of traditional search strategies used in automatic test pattern generation (ATPG) has led to the observation that no single strategy is superior for all faults in a circuit or all circuits. Further experimentation led to the conclusion that a combination of search strategies provides better fault coverage and/or faster ATPG for a given backtrack limit. Instead of using just one strategy to the backtrack limit, a primary strategy is used for the first half of the backtrack limit, and then a secondary strategy is used for the second half. The authors present an ATPG cost model based on the number of test generation events. They use this model to explain why search strategy switching is faster and show experimental evidence to verify the search strategy switching theory. The experiments were performed with the ISCAS circuits and the authors' implementation of the FAN algorithm Author(s) Min, H.B. Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA Rogers, W.A.Keywords
This publication has 8 references indexed in Scilit:
- Advanced automatic test pattern generation and redundancy identification techniquesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- SOCRATES: a highly efficient automatic test pattern generation systemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- A topological search algorithm for ATPGPublished by Association for Computing Machinery (ACM) ,1987
- Effectiveness of heuristics measures for automatic test pattern generationPublished by Association for Computing Machinery (ACM) ,1986
- On the Acceleration of Test Generation AlgorithmsIEEE Transactions on Computers, 1983
- An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic CircuitsIEEE Transactions on Computers, 1981
- Polynomially Complete Fault Detection ProblemsIEEE Transactions on Computers, 1975
- Diagnosis of Automata Failures: A Calculus and a MethodIBM Journal of Research and Development, 1966