On the accurate reliability analysis of combinational circuits using theorem proving

Reliability analysis of combinational circuits has become imperative these days due to the extensive usage of nanotechnologies in their fabrication. Traditionally, reliability analysis is done using simulation or paper-and-pencil proof methods. But, these techniques do not ensure accurate results and thus may lead to disastrous consequences when dealing with safety critical applications. In this paper, we mainly tackle the accuracy problem of reliability analysis by presenting a formal approach that is based on higher-order-logic theorem proving. The paper presents formal definitions of gate fault and reliability and utilizes them to formally verify some key reliability properties in a theorem prover. This formal infrastructure can be used to formally analyze the reliability of any combinational circuit. For illustration purposes, we utilize the proposed framework to analyze the reliability of a comparator and a full adder.

[1]  Stephan Merz,et al.  Model Checking , 2000 .

[2]  John Harrison,et al.  Handbook of Practical Logic and Automated Reasoning , 2009 .

[3]  Sofiène Tahar,et al.  Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables , 2008, Journal of Automated Reasoning.

[4]  John P. Hayes,et al.  Accurate reliability evaluation and enhancement via probabilistic transfer matrices , 2005, Design, Automation and Test in Europe.

[5]  Francis P. Mathur On Reliability Modeling and Analysis of Ultrareliable Fault-Tolerant Digital Systems , 1971, IEEE Transactions on Computers.

[6]  Grzegorz Rozenberg,et al.  A Decade of Concurrency Reflections and Perspectives , 1994, Lecture Notes in Computer Science.

[7]  M. Gordon,et al.  Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[8]  J. Fortes,et al.  Towards Accurate and Efficient Reliability Modeling of Nanoelectronic Circuits , 2006, 2006 Sixth IEEE Conference on Nanotechnology.

[9]  Jianbo Gao,et al.  Faults, error bounds and reliability of nanoelectronic circuits , 2005, 2005 IEEE International Conference on Application-Specific Systems, Architecture Processors (ASAP'05).

[10]  Sandeep K. Shukla,et al.  NANOPRISM: a tool for evaluating granularity vs. reliability trade-offs in nano architectures , 2004, GLSVLSI '04.

[11]  Aarti Gupta,et al.  Formal hardware verification methods: A survey , 1992, Formal Methods Syst. Des..

[12]  Anthony Hall,et al.  Realising the Benefits of Formal Methods , 2005, J. Univers. Comput. Sci..

[13]  Roy C. Ogus,et al.  The Probability of a Correct Output from a Combinational Circuit , 1975, IEEE Transactions on Computers.

[14]  Sandeep K. Shukla,et al.  Scalable techniques and tools for reliability analysis of large circuits , 2007, 20th International Conference on VLSI Design held jointly with 6th International Conference on Embedded Systems (VLSID'07).

[15]  Michael J. C. Gordon,et al.  Mechanizing programming logics in higher order logic , 1989 .

[16]  Joe Hurd,et al.  Formal verification of probabilistic algorithms , 2003 .

[17]  Edmund M. Clarke,et al.  Verification Tools for Finite-State Concurrent Systems , 1993, REX School/Symposium.