A method of search space pruning based on search state dominance

EST (Equivalent STate hashing) algorithm, which reduces the search space form a different point of view from the conventional methods, was proposed for test generation by Giraldi and Bushnell. In this method the processes and results of the test pattern searches are stored and used to avoid fruitless searches to reduce the search space. In this paper the concept of search state equivalence, which is introduced for EST, is extended to that of search state dominance. Based on that concept an algorithm DST (Dominant STate hashing) is proposed. The search state dominance can prune the search space more effectively than the search state equivalence.

[1]  Hideo Fujiwara,et al.  An efficient test generation algorithm based on search state dominance , 1992, [1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing.

[2]  Michael H. Schulz,et al.  Improved deterministic test pattern generation with applications to redundancy identification , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  F. Brglez,et al.  A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN , 1985 .

[4]  J. Paul Roth,et al.  Programmed Algorithms to Compute Tests to Detect and Distinguish Between Failures in Logic Circuits , 1967, IEEE Trans. Electron. Comput..

[5]  Hideo Fujiwara,et al.  On the Acceleration of Test Generation Algorithms , 1983, IEEE Transactions on Computers.

[6]  Michael L. Bushnell,et al.  SEARCH STATE EQUIVALENCE FOR REDUNDANCY IDENTIFICATION AND TEST GENERATION , 1991, 1991, Proceedings. International Test Conference.

[7]  Tracy Larrabee.  Efficient generation of test patterns using Boolean difference , 1989, Proceedings. 'Meeting the Tests of Time'., International Test Conference.