Effective Robustness Analysis Using Bounded Model Checking Techniques

Continuously shrinking feature sizes result in an increasing susceptibility of circuits to transient faults, e.g., due to environmental radiation. Approaches to implement fault tolerance are known. But assessing the fault tolerance of a given implementation is a hard verification problem. Here, we propose the use of formal methods to assess the robustness of a digital circuit with respect to transient faults. Our formal model uses a fixed bound in time and exploits fault detection circuitry to cope with the complexity of the underlying sequential equivalence check. As a result, a lower and an upper bound on the robustness are returned together with vulnerable components. The underlying algorithm and techniques to improve the efficiency are presented. In experiments, we evaluate the method on circuits with different fault detection mechanisms.

[1]  Todd M. Austin,et al.  CrashTest: A fast high-fidelity FPGA-based resiliency analysis framework , 2008, 2008 IEEE International Conference on Computer Design.

[2]  Heinrich Theodor Vierhaus,et al.  Evaluating Coverage of Error Detection Logic for Soft Errors using Formal Methods , 2006, Proceedings of the Design Automation & Test in Europe Conference.

[3]  Massimo Violante,et al.  An FPGA-Based Approach for Speeding-Up Fault Injection Campaigns on Safety-Critical Circuits , 2002, J. Electron. Test..

[4]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[5]  Diana Marculescu,et al.  Circuit Reliability Analysis Using Symbolic Techniques , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[7]  Emmanuelle Encrenaz-Tiphène,et al.  Complementary Formal Approaches for Dependability Analysis , 2009, 2009 24th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems.

[8]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[9]  Robert K. Brayton,et al.  SAT-based complete don't-care computation for network optimization , 2005, Design, Automation and Test in Europe.

[10]  Dhiraj K. Pradhan,et al.  Recursive learning: a new implication technique for efficient solutions to CAD problems-test, verification, and optimization , 1994, The IEEE International Symposium on Circuits and Systems, 2003. Tutorial Guide: ISCAS 2003..

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

[12]  Robert E. Tarjan,et al.  A fast algorithm for finding dominators in a flowgraph , 1979, TOPL.

[13]  Omer Khan,et al.  Improving yield and reliability of chip multiprocessors , 2009, 2009 Design, Automation & Test in Europe Conference & Exhibition.

[14]  Joonyoung Kim,et al.  SATIRE: A new incremental satisfiability engine , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

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

[16]  Rolf Drechsler,et al.  Computing bounds for fault tolerance using formal techniques , 2009, 2009 46th ACM/IEEE Design Automation Conference.

[17]  Malay K. Ganai,et al.  Circuit-based Boolean reasoning , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[18]  Michael S. Hsiao,et al.  Integration of learning techniques into Incremental Satisfiability for efficient path-delay fault test generation , 2005, Design, Automation and Test in Europe.

[19]  Ofer Strichman,et al.  SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques , 2002, CAV.

[20]  Marco Bozzano,et al.  Symbolic Fault Tree Analysis for Reactive Systems , 2007, ATVA.

[21]  Moayad Fahim Ali,et al.  Fault diagnosis and logic debugging using Boolean satisfiability , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[22]  Karem A. Sakallah,et al.  Conflict analysis in search algorithms for propositional satisfiability , 1996 .

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

[24]  Tiziano Villa,et al.  Efficient solution of language equations using partitioned representations , 2005, Design, Automation and Test in Europe.

[25]  Kavita Ravi,et al.  High-density reachability analysis , 1995, ICCAD.

[26]  Bernd Becker,et al.  ATPG-based grading of strong fault-secureness , 2009, 2009 15th IEEE International On-Line Testing Symposium.

[27]  Todd M. Austin,et al.  Deployment of better than worst-case design: solutions and needs , 2005, 2005 International Conference on Computer Design.

[28]  Rolf Drechsler,et al.  Test Pattern Generation using Boolean Proof Engines , 2009 .

[29]  Kartik Mohanram,et al.  Gate sizing to radiation harden combinational logic , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[31]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[32]  Ohad Shacham,et al.  On-The-Fly Resolve Trace Minimization , 2007, 2007 44th ACM/IEEE Design Automation Conference.

[33]  Lorenzo Alvisi,et al.  Modeling the effect of technology trends on the soft error rate of combinational logic , 2002, Proceedings International Conference on Dependable Systems and Networks.

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

[35]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[36]  Sujit Dey,et al.  Improving transient error tolerance of digital VLSI circuits using robustness compiler (ROCO) , 2006, 7th International Symposium on Quality Electronic Design (ISQED'06).

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

[38]  E. Clarke,et al.  Using SAT based image computation for reachability analysis , 2003 .

[39]  Krishnendu Chatterjee,et al.  Robustness in the Presence of Liveness , 2010, CAV.

[40]  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.

[41]  David Blaauw,et al.  Razor: A Low-Power Pipeline Based on Circuit-Level Timing Speculation , 2003, MICRO.

[42]  Dong Sam Ha,et al.  HOPE: an efficient parallel fault simulator for synchronous sequential circuits , 1992, DAC '92.

[43]  Kartik Mohanram,et al.  Reliability Analysis of Logic Circuits , 2009, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[44]  Markus Wedler,et al.  Unbounded Protocol Compliance Verification Using Interval Property Checking With Invariants , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[45]  Diana Marculescu,et al.  Multiple Transient Faults in Combinational and Sequential Circuits: A Systematic Approach , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[46]  Ofer Strichman,et al.  Pruning Techniques for the SAT-Based Bounded Model Checking Problem , 2001, CHARME.

[47]  Sanjit A. Seshia,et al.  Verification-Guided Soft Error Resilience , 2007, 2007 Design, Automation & Test in Europe Conference & Exhibition.

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

[49]  John P. Hayes,et al.  An Analysis Framework for Transient-Error Tolerance , 2007, 25th IEEE VLSI Test Symposium (VTS'07).

[50]  Régis Leveugle,et al.  A new approach for early dependability evaluation based on formal property checking and controlled mutations , 2005, 11th IEEE International On-Line Testing Symposium.