Enhanced diameter bounding via structural transformation

Bounded model checking (BMC) has gained widespread industrial use due to its relative scalability. Its exhaustiveness over all valid input vectors allows it to expose arbitrarily complex design flaws. However, BMC is limited to analyzing only a specific time window, hence will only expose those flaws which manifest within that window and thus connect readily prove correctness. The diameter of a design has thus become an important concept - a bounded check of depth equal to the diameter constitutes a complete proof. While the diameter of a design may be exponential in the number of its state elements, in practice it often ranges from tens to a few hundred regardless of design size. Therefore, a powerful diameter overapproximation technique may enable automatic proofs that otherwise would be infeasible. Unfortunately, exact diameter calculation requires exponential resources, and overapproximation techniques may yield exponentially loose bounds. In this paper, we provide a general approach for enabling the use of structural transformations, such as redundancy removal, retiming, and target enlargement, to tighten the bounds obtained by arbitrary diameter approximation techniques. Numerous experiments demonstrate that this approach may significantly increase the set of designs for which practically useful diameter bounds may be obtained.

[1]  J. Baumgartner,et al.  Min-area retiming on flexible circuit structures , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[2]  Enrico Tronci,et al.  Correct Hardware Design and Verification Methods , 2003, Lecture Notes in Computer Science.

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

[4]  Malay K. Ganai,et al.  Robust Boolean reasoning for equivalence checking and functional property verification , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Jian Shen,et al.  On Combining Formal and Informal Verification , 1997, CAV.

[6]  Jason Baumgartner,et al.  Transformation-Based Verification Using Generalized Retiming , 2001, CAV.

[7]  Jacob A. Abraham,et al.  Property Checking via Structural Analysis , 2002, CAV.

[8]  Fabio Somenzi,et al.  Optimizing sequential verification by retiming transformations , 2000, Proceedings 37th Design Automation Conference.

[9]  Jacob A. Abraham,et al.  Automatic structural abstraction techniques for enhanced verification , 2002 .

[10]  Daniel Kroening,et al.  Efficient Computation of Recurrence Diameters , 2003, VMCAI.

[11]  Karem A. Sakallah,et al.  SAT-based sequential depth computation , 2003, ASP-DAC '03.

[12]  Robert P. Kurshan,et al.  Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach , 2014 .

[13]  Andreas Kuehlmann,et al.  Equivalence checking using cuts and heaps , 1997, DAC.

[14]  Sharad Malik,et al.  Conflict driven learning in a quantified Boolean Satisfiability solver , 2002, ICCAD 2002.

[15]  Adnan Aziz,et al.  Model Checking the IBM Gigahertz Processor: An Abstraction Algorithm for High-Performance Netlists , 1999, CAV.

[16]  Adnan Aziz,et al.  Algorithms for efficient state space search , 2001 .

[17]  Adnan Aziz,et al.  An Abstraction Algorithm for the Verification of Generalized C-Slow Designs , 2000, CAV.

[18]  Mary Sheeran,et al.  Checking Safety Properties Using Induction and a SAT-Solver , 2000, FMCAD.

[19]  Robert K. Brayton,et al.  Minimizing interacting finite state machines: a compositional approach to language containment , 1994, Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[20]  Charles E. Leiserson,et al.  Retiming synchronous circuitry , 1988, Algorithmica.

[21]  David L. Dill,et al.  Validation with guided search of the state space , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[22]  In-Ho Moon,et al.  Simplifying Circuits for Formal Verification Using Parametric Representation , 2002, FMCAD.

[23]  Sharad Malik,et al.  Exploiting Retiming in a Guided Simulation Based Validation Methodology , 1999, CHARME.

[24]  Chia-Chih Yen,et al.  A Practical Approach to Cycle Bound Estimation for Property Checking , 2002, IWLS.

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

[26]  K. Brayton,et al.  Verifying Interacting Finite State Machines : Complexity , 1993 .

[27]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[28]  Kathi Fisler,et al.  Bisimulation and Model Checking , 1999, CHARME.