A Study of Implication Based Pseudo Functional Testing

This paper presents a study of the implication based functional constraint extraction techniques to generate pseudo functional scan tests. Novel algorithms to extract pair-wise and multi-node constraints as Boolean expressions on arbitrary gates in the design are presented. Its impact on reducing the overkill in testing was analyzed, and report the trade-offs in coverage and scan-loads for a number of fault models. In the case of path-delay fault model, it was shown that the longest paths contribute most to the over-testing problem, raising the question about scan testing of the longest paths. Finally, the evaluation of the functional constraints on large industrial circuits show that the proposed constraint generation algorithm generate a powerful set of constraints most of which are not captured in the constraints extracted by designers for design-verification purposes

[1]  Donald E. Thomas,et al.  Behavioral test generation using mixed integer nonlinear programming , 1994, Proceedings., International Test Conference.

[2]  Irith Pomeranz,et al.  On finding undetectable and redundant faults in synchronous sequential circuits , 1998, Proceedings International Conference on Computer Design. VLSI in Computers and Processors (Cat. No.98CB36273).

[3]  Jeff Rearick.  Too much delay fault coverage is a bad thing , 2001, Proceedings International Test Conference 2001 (Cat. No.01CH37260).

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

[5]  Dhiraj K. Pradhan,et al.  Recursive Learning: An attractive alternative to the decision tree for test generation in digital ci , 1992, Proceedings International Test Conference 1992.

[6]  Jacob A. Abraham,et al.  FACTOR: a hierarchical methodology for functional test generation and testability analysis , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

[7]  Mario H. Konijnenburg,et al.  Illegal state space identification for sequential circuit test generation , 1999, Design, Automation and Test in Europe Conference and Exhibition, 1999. Proceedings (Cat. No. PR00078).

[8]  On identifying undetectable and redundant faults in synchronous sequential circuits , 1994, Proceedings of IEEE VLSI Test Symposium.

[9]  Gang Chen,et al.  Procedures for identifying untestable and redundant transition faults in synchronous sequential circuits , 2003, Proceedings 21st International Conference on Computer Design.

[10]  Elizabeth M. Rudnick,et al.  Static logic implication with application to redundancy identification , 1997, Proceedings. 15th IEEE VLSI Test Symposium (Cat. No.97TB100125).

[11]  Miron Abramovici,et al.  FIRE: a fault-independent combinational redundancy identification algorithm , 1996, IEEE Trans. Very Large Scale Integr. Syst..

[12]  Irith Pomeranz.  On the generation of scan-based test sets with reachable states for testing under functional operation conditions , 2004, Proceedings. 41st Design Automation Conference, 2004..

[13]  Jacob A. Abraham,et al.  Automatic test knowledge extraction from VHDL (ATKET) , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[14]  Michael H. Schulz,et al.  ESSENTIAL: an efficient self-learning test pattern generation algorithm for sequential circuits , 1989, Proceedings. 'Meeting the Tests of Time'., International Test Conference.

[15]  Feng Lu,et al.  Constraint extraction for pseudo-functional scan-based delay testing , 2005, Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005..

[16]  Irith Pomeranz,et al.  On generating pseudo-functional delay fault tests for scan designs , 2005, 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (DFT'05).

[17]  Janusz Rajski,et al.  A fast sequential learning technique for real circuits with application to enhancing ATPG performance , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[18]  Chung-Len Lee,et al.  Identifying invalid states for sequential circuit test generation , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[19]  K. Cheng,et al.  Efficient reachability checking using sequential SAT , 2004, Asia and South Pacific Design Automation Conference.

[20]  Janak H. Patel,et al.  Fast identification of untestable delay faults using implications , 1997, ICCAD 1997.

[21]  S. Chakradhar,et al.  Combinational ATPG theorems for identifying untestable faults in sequential circuits , 1993, Proceedings ETC 93 Third European Test Conference.

[22]  David E. Long,et al.  Identifying sequentially untestable faults using illegal states , 1995, Proceedings 13th IEEE VLSI Test Symposium.

[23]  K. Cheng,et al.  SATORI-a fast sequential SAT engine for circuits , 2003, ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486).

[24]  Sharad Malik,et al.  Efficient conflict driven learning in a Boolean satisfiability solver , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[25]  Kwang-Ting Cheng,et al.  Pseudofunctional testing , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.