ATPG-based grading of strong fault-secureness

Robust circuit design has become a major concern for nanoscale technologies. As a consequence, for design validation, not only the functionality of a circuit has to be considered, but also its robustness properties have to be analyzed. In this work we propose a method to verify the strong fault-secureness by use of constrained SAT-based ATPG. Strongly fault-secure circuits can be seen as the widest class of circuits achieving the totally self-checking (TSC) goal, which requires that every fault be detected the first time it manifests itself as an error at the outputs. As the strongly fault-secure property guarantees to achieve the TSC goal even in the case of fault accumulation, the effects of all possible fault sequences have to be taken into consideration to verify this property. To speed up the complex analysis of multiple faults we develop rules to derive detectability or redundancy information for multiple faults from the respective information for single faults. For the case of not strongly fault-secure circuits our method provides measures to grade the “extent” of strong fault-secureness given by the implementation.

[1]  Donatella Sciuto,et al.  The design of reliable devices for mission-critical applications , 2003, IEEE Trans. Instrum. Meas..

[2]  Bernd Becker,et al.  Selective Hardening in Early Design Steps , 2008, 2008 13th European Test Symposium.

[3]  R. Velazco,et al.  Design of SEU-hardened CMOS memory cells: the HIT cell , 1993, RADECS 93. Second European Conference on Radiation and its Effects on Components and Systems (Cat. No.93TH0616-3).

[4]  Shujian Zhang,et al.  Evaluating the safety of self-checking circuits , 1995, J. Electron. Test..

[5]  Eduard Cerny,et al.  On the generation of test patterns for multiple faults , 1993, J. Electron. Test..

[6]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[7]  Eiji Fujiwara,et al.  Probability to Achieve TSC Goal , 1996, IEEE Trans. Computers.

[8]  Nur A. Touba,et al.  Cost-effective approach for reducing soft error failure rate in logic circuits , 2003, International Test Conference, 2003. Proceedings. ITC 2003..

[9]  Bernd Becker,et al.  Multithreaded SAT Solving , 2007, 2007 Asia and South Pacific Design Automation Conference.

[10]  Vishwani D. Agrawal,et al.  Multiple fault detection in two-level multi-output circuits , 1992, J. Electron. Test..

[11]  Eiji Fujiwara,et al.  Error-control coding for computer systems , 1989 .

[12]  James E. Smith,et al.  Strongly Fault Secure Logic Networks , 1978, IEEE Transactions on Computers.

[13]  Michael Goessel.  New methods of concurrent checking , 2008 .

[14]  Yervant Zorian,et al.  On-Line Testing for VLSI—A Compendium of Approaches , 1998, J. Electron. Test..

[15]  Shekhar Y. Borkar,et al.  Designing reliable systems from unreliable components: the challenges of transistor variability and degradation , 2005, IEEE Micro.

[16]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[17]  Paolo Prinetto,et al.  Improved techniques for multiple stuck-at fault analysis using single stuck-at fault test sets , 1992, [Proceedings] 1992 IEEE International Symposium on Circuits and Systems.

[18]  Sudhakar M. Reddy,et al.  TIGUAN: Thread-Parallel Integrated Test Pattern Generator Utilizing Satisfiability ANalysis , 2009, 2009 22nd International Conference on VLSI Design.

[19]  Rolf Drechsler,et al.  On Acceleration of SAT-Based ATPG for Industrial Designs , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[20]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[21]  Israel Koren,et al.  Fault-Tolerant Systems , 2007 .

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

[23]  Robert Baumann,et al.  Soft errors in advanced computer systems , 2005, IEEE Design & Test of Computers.

[24]  Rolf Drechsler,et al.  A Basis for Formal Robustness Checking , 2008, ISQED 2008.

[25]  P. R. Stephan,et al.  SIS : A System for Sequential Circuit Synthesis , 1992 .

[26]  Bella Bose,et al.  A self-checking ALU design with efficient codes , 1996, Proceedings of 14th VLSI Test Symposium.

[27]  Suchai Thanawastien,et al.  An SFS Berger check prediction ALU and its application to self-checking processor designs , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[28]  Naresh R. Shanbhag,et al.  Sequential Element Design With Built-In Soft Error Resilience , 2006, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[29]  Sybille Hellebrand,et al.  Verification and Analysis of Self-Checking Properties through ATPG , 2008, 2008 14th IEEE International On-Line Testing Symposium.

[30]  Rolf Drechsler,et al.  A Basis for Formal Robustness Checking , 2008, 9th International Symposium on Quality Electronic Design (isqed 2008).

[31]  James E. Smith.  On Necessary and Sufficient Conditions for Multiple Fault Undetectability , 1979, IEEE Transactions on Computers.