A satisfiability-based test generator for path delay faults in combinational circuits

The paper describes a new formulation to generate robust tests for path delay faults in combinational circuits based on Boolean satisfiability. Conditions to detect a target path delay fault are represented by a Boolean formula. Unlike the technique described by A. Saldhana et al. (1992), which extracts the formula for each path delay fault, the proposed formulation needs to extract the formula only once for each circuit cone. Experimental results show tremendous time saving on formula extraction compared to other satisfiability based ATPG algorithms. This also leads to low test generation time, especially for circuits that have many paths but few outputs. The proposed formulation has also been modified to generate other types of tests for path delay faults.

[1]  Sudhakar M. Reddy,et al.  On Multiple Path Propagating Tests for Path Delay Faults , 1991, 1991, Proceedings. International Test Conference.

[2]  Srinivas Patil,et al.  Skewed-Load Transition Test: Part II, Coverage , 1992, Proceedings International Test Conference 1992.

[3]  Robert K. Brayton,et al.  Combinational test generation using satisfiability , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Sudhakar M. Reddy,et al.  On Delay Fault Testing in Logic Circuits , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  Vishwani D. Agrawal,et al.  Logic systems for path delay test generation , 1993, Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference.

[6]  M. Ray Mercer,et al.  Combinational circuit ATPG using binary decision diagrams , 1993, Digest of Papers Eleventh Annual 1993 IEEE VLSI Test Symposium.

[7]  CATAPULT: concurrent automatic testing allowing parallelization and using limited topology , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[8]  Jacob Savir,et al.  Random Pattern Testability of Delay Faults , 1988, IEEE Trans. Computers.

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

[10]  Michael D. Ciletti,et al.  Reducing correlation to improve coverage of delay faults in scan-path design , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

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

[13]  Kwang-Ting Cheng,et al.  Delay testing for non-robust untestable circuits , 1993, Proceedings of IEEE International Test Conference - (ITC).

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

[15]  Sudhakar M. Reddy,et al.  Design of robustly testable combinational logic circuits , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[16]  M. Ray Mercer,et al.  An efficient delay test generation system for combinational logic circuits , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Srinivas Patil,et al.  Broad-side delay test , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[18]  Ted Stanion,et al.  TSUNAMI: a path oriented scheme for algebraic test generation , 1991, [1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium.

[19]  Sudhakar M. Reddy,et al.  On the detection of delay faults , 1988, International Test Conference 1988 Proceeding@m_New Frontiers in Testing.

[20]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[21]  Vishwani D. Agrawal,et al.  A transitive closure based algorithm for test generation , 1991, 28th ACM/IEEE Design Automation Conference.

[22]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[23]  Prathima Agrawal,et al.  Delay fault test generation for scan/hold circuits using Boolean expressions , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

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

[25]  Michael H. Schulz,et al.  DYNAMITE: an efficient automatic test pattern generation system for path delay faults , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[27]  Vishwani D. Agrawal,et al.  Delay fault models and test generation for random logic sequential circuits , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[28]  F. F. Sellers,et al.  Analyzing Errors with the Boolean Difference , 1968, IEEE Transactions on Computers.

[29]  Kurt Keutzer,et al.  A Partial Enhanced-Scan Approach to Robust Delay-Fault Test Generation for Sequential Circuits , 1991, 1991, Proceedings. International Test Conference.

[30]  Robert K. Brayton,et al.  Equivalence of robust delay-fault and single stuck-fault test generation , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[31]  S. M. Reddy,et al.  On the design of path delay fault testable combinational circuits , 1990, [1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium.

[32]  Vishwani D. Agrawal,et al.  A transitive closure algorithm for test generation , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[33]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .