Algebraic approach to arithmetic design verification

The paper describes an algebraic approach to functional verification of arithmetic circuits specified at bit level. The circuit is represented as a network of half adders, full adders, and inverters, and modeled as a system of linear equations. The proof of functional correctness of the design is obtained by computing its algebraic signature using standard LP solver and comparing it with the reference signature provided by the designer. Initial experimental results and comparison with SMT solvers show that the method is efficient, scalable and applicable to large arithmetic designs, such as multipliers.

[1]  Markus Wedler,et al.  STABLE: A new QF-BV SMT solver for hard verification problems combining Boolean reasoning with computer algebra , 2011, 2011 Design, Automation & Test in Europe.

[2]  Jacob A. Abraham,et al.  Automatic Verification of Arithmetic Circuits in RTL Using Stepwise Refinement of Term Rewriting Systems , 2007, IEEE Transactions on Computers.

[3]  Takafumi Aoki,et al.  Application of symbolic computer algebra to arithmetic circuit verification , 2007, 2007 25th International Conference on Computer Design.

[4]  Sofia Cassel,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 2012 .

[5]  R. Bryant,et al.  Verification of Arithmetic Functions with Binary Moment Diagrams , 1994 .

[6]  Markus Wedler,et al.  An Algebraic Approach for Proving Data Correctness in Arithmetic Data Paths , 2008, CAV.

[7]  Randal E. Bryant,et al.  Verification of Arithmetic Circuits with Binary Moment Diagrams , 1995, 32nd Design Automation Conference.

[8]  Java Binding,et al.  GNU Linear Programming Kit , 2011 .

[9]  Daniel Kroening,et al.  Decision Procedures - An Algorithmic Point of View , 2008, Texts in Theoretical Computer Science. An EATCS Series.

[10]  Toby Walsh,et al.  Handbook of satisfiability , 2009 .

[11]  Florian Enescu,et al.  Equivalence Verification of Polynomial Datapaths Using Ideal Membership Testing , 2007, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Priyank Kalla,et al.  Taylor Expansion Diagrams: A Canonical Representation for Verification of Data Flow Designs , 2006, IEEE Transactions on Computers.

[13]  Markus Wedler,et al.  Verifying full-custom multipliers by Boolean equivalence checking and an arithmetic bit level proof , 2008, 2008 Asia and South Pacific Design Automation Conference.