On the minimal test set for single fault location

A new heuristic algorithm (based on the fault dictionary approach) that finds the minimal test set for locating single faults (of the stuck-at type) in a digital circuit, thus reducing the size of the fault dictionary, is presented. The proposed algorithm is based on finding the transitive closure of the vectors in the test set with respect to the functional dominancies using Warshall's algorithm for binary matrices. The space complexity of the proposed algorithm is O(ma.<<ETX>>

[1]  Irith Pomeranz,et al.  On achieving a complete fault coverage for sequential machines using the transition fault model , 1991, 28th ACM/IEEE Design Automation Conference.

[2]  Prabhakar Goel,et al.  An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits , 1981, IEEE Transactions on Computers.

[3]  Jason Cong,et al.  A new formulation of yield enhancement problems for reconfigurable chips , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[4]  S.D. Millman,et al.  Diagnosing CMOS bridging faults with stuck-at fault dictionaries , 1990, Proceedings. International Test Conference 1990.

[5]  W. Kent Fuchs,et al.  TWO-STAGE FAULT LOCATION , 1991, 1991, Proceedings. International Test Conference.

[6]  Vishwani D. Agrawal,et al.  Design of sequential machines for efficient test generation , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[7]  Abraham Silberschatz,et al.  Database System Concepts , 1980 .