A Normalization Method for Arithmetic Data-Path Verification

We propose a normalization technique for verifying arithmetic circuits in a bounded model-checking environment. Our technique operates on the arithmetic bit-level (ABL) description of the arithmetic circuit parts and property. The ABL description can easily be provided by the front-end of a register transfer level property checker. The proposed normalization greatly simplifies the SAT instances to be solved for arithmetic circuit verification. Our approach has been successfully applied to verify the integer pipeline of an industrial microprocessor with advanced DSP capabilities.

[1]  Rolf Drechsler,et al.  Formal Verification on the RT Level Computing One-To-One Design Abstractions by Signal Width Reduction , 2001 .

[2]  Andreas Kuehlmann,et al.  A fast pseudo-Boolean constraint solver , 2003, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  Priyank Kalla,et al.  Equivalence verification of arithmetic datapaths with multiple word-length operands , 2006, Proceedings of the Design Automation & Test in Europe Conference.

[4]  Rolf Drechsler,et al.  RTL-datapath verification using integer linear programming , 2002, Proceedings of ASP-DAC/VLSI Design 2002. 7th Asia and South Pacific Design Automation Conference and 15h International Conference on VLSI Design.

[5]  Zhihong Zeng,et al.  LPSAT: a unified approach to RTL satisfiability , 2001, Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001.

[6]  Zhihong Zeng,et al.  Functional Test Generation using Constraint Logic Programming , 2001, VLSI-SOC.

[7]  Ieee Circuits,et al.  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems information for authors , 2018, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Cesare Tinelli,et al.  DPLL( T): Fast Decision Procedures , 2004, CAV.

[9]  Dominik Stoffel,et al.  Verification of integer multipliers on the arithmetic bit level , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[10]  David L. Dill,et al.  A decision procedure for bit-vector arithmetic , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[11]  Kurt Keutzer,et al.  Functional vector generation for HDL models using linearprogramming and Boolean satisfiability , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Priyank Kalla,et al.  Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[13]  Kwang-Ting Cheng,et al.  An efficient finite-domain constraint solver for circuits , 2004, Proceedings. 41st Design Automation Conference, 2004..

[14]  Markus Wedler,et al.  Arithmetic reasoning in DPLL-based SAT solving , 2004, Proceedings Design, Automation and Test in Europe Conference and Exhibition.

[15]  Peer Johannsen.  BooStER: Speeding Up RTL Property Checking of Digital Designs by Word-Level Abstarction , 2001, CAV.

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

[17]  Dominik Stoffel,et al.  Cost-efficient block verification for a UMTS up-link chip-rate coprocessor , 2004, Proceedings Design, Automation and Test in Europe Conference and Exhibition.

[18]  Piergiorgio Bertoli,et al.  A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions , 2002, CADE.

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

[20]  Kwang-Ting Cheng,et al.  RTL SAT simplification by Boolean and interval arithmetic reasoning , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..