SAT-based methods for sequential hardware equivalence verification without synchronization

The BDD- and SAT-based model checking and verification methods normally require an initial state. Here we are concerned with sequential hardware verification, where an initial state must be one of the reset states. In practice, a reset state is not always given by the designer, and computing a reset state of a circuit is a hard problem. In this paper we propose a method allowing usage of SAT-based verification methods without a need for a user-given or a computed initial state. The idea is to employ a binary encoding of 3-valued modeling of circuits, and use the undefined state X as a reset state.

[1]  Paolo Prinetto,et al.  A new approach for initialization sequences computation for synchronous sequential circuits , 1997, Proceedings International Conference on Computer Design VLSI in Computers and Processors.

[2]  Edmund M. Clarke,et al.  Symbolic model checking for sequential circuit verification , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Carl Pixley,et al.  A theory and implementation of sequential hardware equivalence , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Vishwani D. Agrawal,et al.  STATE ASSIGNMENT FOR INITIALIZABLE SYNTHESIS , 1989 .

[5]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[6]  Koen Claessen,et al.  SAT-Based Verification without State Space Traversal , 2000, FMCAD.

[7]  Irith Pomeranz,et al.  Synchronization of large sequential circuits by partial reset , 1996, Proceedings of 14th VLSI Test Symposium.

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

[9]  Randal E. Bryant,et al.  Formal verification by symbolic evaluation of partially-ordered trajectories , 1995, Formal Methods Syst. Des..

[10]  Olivier Coudert,et al.  Verification of Synchronous Sequential Machines Based on Symbolic Execution , 1989, Automatic Verification Methods for Finite State Systems.

[11]  Irith Pomeranz,et al.  On Removing Redundancies from Synchronous Sequential Circuits with Synchronizing Sequences , 1996, IEEE Trans. Computers.

[12]  Gianpiero Cabodi,et al.  Symbolic FSM traversals based on the transition relation , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Olivier Coudert,et al.  A unified framework for the formal verification of sequential circuits , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[14]  Bernd Becker,et al.  On the (non-)resetability of synchronous sequential circuits , 1996, Proceedings of 14th VLSI Test Symposium.

[15]  Fabio Somenzi,et al.  Logic synthesis and verification algorithms , 1996 .

[16]  Robert B. Jones.  Symbolic Simulation Methods for Industrial Formal Verification , 2002 .

[17]  Shi-Yu Huang,et al.  Verifying sequential equivalence using ATPG techniques , 2001, TODE.

[18]  Carl Pixley,et al.  Calculating resettability and reset sequences , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[19]  Masahiro Fujita,et al.  Symbolic model checking using SAT procedures instead of BDDs , 1999, DAC '99.

[20]  Seh-Woong Jeong,et al.  Synchronizing sequences and symbolic traversal techniques in test generation , 1993, J. Electron. Test..

[21]  Edmund M. Clarke,et al.  Counterexample-guided abstraction refinement , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..

[22]  Shi-Yu Huang,et al.  An ATPG-based framework for verifying sequential equivalence , 1996, Proceedings International Test Conference 1996. Test and Design Validity.

[23]  Anna Philippou,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.

[24]  Kenneth L. McMillan,et al.  Symbolic model checking: an approach to the state explosion problem , 1992 .

[25]  Gianpiero Cabodi,et al.  Improved reachability analysis of large finite state machines , 1996, Proceedings of International Conference on Computer Aided Design.

[26]  Randal E. Bryant,et al.  Digital circuit verification using partially-ordered state models , 1994, Proceedings of 24th International Symposium on Multiple-Valued Logic (ISMVL'94).

[27]  Seh-Woong Jeong,et al.  Exact calculation of synchronizing sequences based on binary decision diagrams , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[28]  Zurab Khasidashvili,et al.  TRANS: efficient sequential verification of loop-free circuits , 2002, Seventh IEEE International High-Level Design Validation and Test Workshop, 2002..

[29]  Mary Sheeran,et al.  A Tutorial on Stålmarck's Proof Procedure for Propositional Logic , 2000, Formal Methods Syst. Des..

[30]  A. Rosenmann,et al.  Alignability equivalence of synchronous sequential circuits , 2002, Seventh IEEE International High-Level Design Validation and Test Workshop, 2002..

[31]  Shi-Yu Huang,et al.  On verifying the correctness of retimed circuits , 1996, Proceedings of the Sixth Great Lakes Symposium on VLSI.

[32]  Parosh Aziz Abdulla,et al.  Symbolic Reachability Analysis Based on SAT-Solvers , 2000, TACAS.

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

[34]  Randal E. Bryant,et al.  Boolean Analysis of MOS Circuits , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[35]  Robert K. Brayton,et al.  Implicit state enumeration of finite state machines using BDD's , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.