As-Robust-As-Possible test generation in the presence of small delay defects using pseudo-Boolean optimization

Delay testing is performed to guarantee that a manufactured chip is free of delay defects and meets its performance specification. However, only few delay faults are robustly testable. For robustly untestable faults, non-robust tests which are of lesser quality are typically generated. Due to significantly relaxed conditions, there is a large quality gap between non-robust and robust tests. This paper presents a test generation procedure for As-Robust-As-Possible (ARAP) tests to increase the overall quality of the test set. Instead of generating a non-robust test for a robustly untestable fault, an ARAP test is generated which maximizes the number of satisfiable conditions required for robust test generation by pseudo-Boolean optimization. Additionally, the problem formulation is extended to incorporate the increased significance of small delay defects. By this, the likeliness that small delay defects invalidate the test is reduced. Experimental results on large industrial circuits confirm the quality gap and show that the generated ARAP tests satisfy a large percentage of all robustness conditions on average which signifies a very high quality.

[1]  Sandip Kundu,et al.  On ATPG for Multiple Aggressor Crosstalk Faults , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Jacob A. Abraham,et al.  Critical Path Selection for Delay Testing Considering Coupling Noise , 2009, 2008 13th European Test Symposium.

[3]  Tracy Larrabee,et al.  Test pattern generation using Boolean satisfiability , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Ananta K. Majhi,et al.  On hazard-free patterns for fine-delay fault testing , 2004 .

[5]  Theo Tryfonas,et al.  Frontiers in Artificial Intelligence and Applications , 2009 .

[6]  Andreas G. Veneris,et al.  Maximum Circuit Activity Estimation Using Pseudo-Boolean Satisfiability , 2012, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Pallab Dasgupta,et al.  Satisfiability Models for Maximum Transition Power , 2008, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[8]  Sandeep K. Gupta,et al.  A satisfiability-based test generator for path delay faults in combinational circuits , 1996, DAC '96.

[9]  Janak H. Patel,et al.  Testing of critical paths for delay faults , 2001, Proceedings International Test Conference 2001 (Cat. No.01CH37260).

[10]  Karem A. Sakallah,et al.  Pueblo: A Hybrid Pseudo-Boolean SAT Solver , 2006, J. Satisf. Boolean Model. Comput..

[11]  Vasco M. Manquinho,et al.  Satisfiability-based algorithms for pseudo-Boolean optimization using Gomory cuts and search restarts , 2005, 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05).

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

[13]  Niklas Sörensson,et al.  Translating Pseudo-Boolean Constraints into SAT , 2006, J. Satisf. Boolean Model. Comput..

[14]  Rolf Drechsler,et al.  MONSOON: SAT-Based ATPG for Path Delay Faults Using Multiple-Valued Logics , 2010, J. Electron. Test..

[15]  Nisar Ahmed,et al.  Nanometer Technology Designs: High-Quality Delay Tests , 2007 .

[16]  Gordon L. Smith,et al.  Model for Delay Faults Based upon Paths , 1985, ITC.

[17]  Kwang-Ting Cheng,et al.  Generation of High Quality Non-Robust Tests for Path Delay Faults , 1994, 31st Design Automation Conference.

[18]  Richard Putman,et al.  Enhanced timing-based transition delay testing for small delay defects , 2006, 24th IEEE VLSI Test Symposium.

[19]  Michael Pabst,et al.  RESIST: a recursive test pattern generation algorithm for path delay faults , 1994, EURO-DAC '94.

[20]  Martin Gebser,et al.  Conflict-Driven Answer Set Solving , 2007, IJCAI.

[21]  Michael S. Hsiao,et al.  ALAPTF: a new transition fault model and the ATPG algorithm , 2004, 2004 International Conferce on Test.