A small test generator for large designs

We report an automatic test pattern generator that can handle designs with one million gates or more on medium size workstations. Run times and success rates, i.e. the fraction of faults that are resolved, are comparable to or better than those reported previously in the literature. No preprocessing is required and the amount of memory needed is less than 100 bytes per gate. The low memory requirements and high performance have been achieved by working with a larger but simpler search space, by simplifying decision making and backtracking and by using only implication techniques that are fast and that require no preprocessing.

[1]  John A. Waicukauski,et al.  A Statistical Calculation of Fault Detection Probabilities By Fast Fault Simulation , 1985, ITC.

[2]  John A. Waicukauski,et al.  ATPG for ultra-large structured designs , 1990, Proceedings. International Test Conference 1990.

[3]  Leendert M. Huisman,et al.  Symbolic implication in test generation , 1991, Proceedings of the European Conference on Design Automation..

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

[5]  Michael L. Bushnell,et al.  EST: The new frontier in automatic test-pattern generation , 1990, DAC '90.

[6]  Vishwani D. Agrawal,et al.  Toward massively parallel automatic test generation , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Janak H. Patel,et al.  Effectiveness of Heuristics Measures for Automatic Test Pattern Generation , 1986, 23rd ACM/IEEE Design Automation Conference.

[8]  J. Paul Roth,et al.  Diagnosis of automata failures: a calculus and a method , 1966 .

[9]  Sanjay J. Patel,et al.  Effectiveness of Heuristics Measures for Automatic Test Pattern Generation , 1986, DAC 1986.

[10]  André Ivanov,et al.  Dynamic testability measures for ATPG , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Michael H. Schulz,et al.  Advanced automatic test pattern generation and redundancy identification techniques , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

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

[13]  M. Ray Mercer,et al.  A Topological Search Algorithm for ATPG , 1987, 24th ACM/IEEE Design Automation Conference.

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

[15]  David Bryan,et al.  Combinational profiles of sequential benchmark circuits , 1989, IEEE International Symposium on Circuits and Systems,.

[16]  Michael H. Schulz,et al.  SOCRATES: a highly efficient automatic test pattern generation system , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  William A. Rogers,et al.  Search strategy switching: an alternative to increased backtracking , 1989, Proceedings. 'Meeting the Tests of Time'., International Test Conference.

[18]  Janusz Rajski,et al.  A method to calculate necessary assignments in algorithmic test pattern generation , 1990, Proceedings. International Test Conference 1990.

[19]  Füsun Özgüner,et al.  9-V Algorithm for Test Pattern Generation of Combinational Digital Circuits , 1978, IEEE Transactions on Computers.