Recording Synthesis History for Sequential Verification

Performing synthesis and verification in isolation has two undesirable consequences: (1) verification runs the risk of becoming intractable, and (2) strong sequential optimizations are not applied because they are hard to verify. This paper proposes a format for recording synthesis information and a methodology for sequential equivalence checking using this feedback from synthesis. An implementation is described and experimentally compared against an efficient general-purpose sequential equivalence checker that does not use synthesis information. Experimental results confirm expected substantial savings in runtime and reliability of equivalence checking for large designs.

[1]  Robert K. Brayton,et al.  DAG-aware AIG rewriting: a fresh look at combinational logic synthesis , 2006, 2006 43rd ACM/IEEE Design Automation Conference.

[2]  L Michael,et al.  Inductively Finding a Reachable State Space Over-Approximation , 2006 .

[3]  Alan Mishchenko,et al.  Scalable and scalably-verifiable sequential synthesis , 2008, ICCAD 2008.

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

[5]  A. Mishchenko,et al.  Reducing Structural Bias in Technology Mapping , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  Kwang-Ting Cheng,et al.  IChecker: An Efficient Checker for Inductive Invariants , 2006, 2006 IEEE International High Level Design Validation and Test Workshop.

[7]  Alan Mishchenko,et al.  Applying Logic Synthesis for Speeding Up SAT , 2007, SAT.

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

[9]  Robert K. Brayton,et al.  Retiming and Resynthesis: A Complexity Perspective , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[10]  Jason Baumgartner,et al.  Scalable Sequential Equivalence Checking across Arbitrary Design Transformations , 2006, 2006 International Conference on Computer Design.

[11]  Wei-Lun Hung,et al.  Inductive equivalence checking under retiming and resynthesis , 2007, ICCAD 2007.

[12]  R. Brayton,et al.  SAT-Based Logic Optimization and Resynthesis , 2007 .

[13]  Jason Baumgartner,et al.  Exploiting suspected redundancy without proving it , 2005, Proceedings. 42nd Design Automation Conference, 2005..

[14]  Sungmin Cho,et al.  Combinational and sequential mapping with priority cuts , 2007, ICCAD 2007.

[15]  Karem A. Sakallah,et al.  REVERSE: Efficient Sequential Verification for Retiming , 2003 .

[16]  R. Brayton,et al.  Improvements to Combinational Equivalence Checking , 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.

[17]  R. Brayton,et al.  FRAIGs: A Unifying Representation for Logic Synthesis and Verification , 2005 .

[18]  Jie-Hong Roland Jiang,et al.  Inductive equivalence checking under retiming and resynthesis , 2007, 2007 IEEE/ACM International Conference on Computer-Aided Design.

[19]  A. Kuehlmann.  Dynamic transition relation simplification for bounded property checking , 2004, ICCAD 2004.

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

[21]  Robert K. Brayton,et al.  Reducing structural bias in technology mapping , 2006, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[22]  Peichen Pan,et al.  A new retiming-based technology mapping algorithm for LUT-based FPGAs , 1998, FPGA '98.

[23]  C. A. J. van Eijk,et al.  Sequential Equivalence Checking Based on Structural Similarities , 2000 .

[24]  Karem A. Sakallah,et al.  Principles of sequential-equivalence verification , 2005, IEEE Design & Test of Computers.

[25]  Kwang-Ting Cheng,et al.  A signal correlation guided ATPG solver and its applications for solving difficult industrial cases , 2003, DAC '03.

[26]  Alan Mishchenko,et al.  Scalable Sequential Verification , 2007 .

[27]  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).

[28]  Andreas Kuehlmann.  Dynamic transition relation simplification for bounded property checking , 2004, IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004..