Alireza Mahzoon
Daniel Große
Rolf Drechsler
ABSTRACT
Nowadays, a variety of multipliers are used in different computationally intensive industrial applications. Most of these multipliers are highly parallelized and structurally complex. Therefore, the existing formal verification techniques fail to verify them. In recent years, formal multiplier verification based on Symbolic Computer Algebra (SCA) has shown superior results in comparison to all other existing proof techniques. However, for non-trivial architectures still a monomial explosion can be observed. A common understanding is that this is caused by redundant monomials also known as vanishing monomials. While several approaches have been proposed to overcome the explosion, the problem itself is still not fully understood. In this paper we present a new theory for the origin of vanishing monomials and how they can be handled to prevent the explosion during backward rewriting. We implement our new approach as the SCA-verifier PolyCleaner. The experimental results show the efficiency of our proposed method in verification of non-trivial million-gate multipliers.
- [1].Arithmetic module generator based on ACG. www.aoki.ecei.tohoku.ac.jp/arith/Google Scholar
- [2].. Verification of gate-level arithmetic circuits by function extraction. In DAC, pages 52:1–52:6, 2015.Google Scholar
- [3].. Ideals Varieties and Algorithms. Springer, 1997.Google ScholarDigital Library
- [4].. Gröbner basis based formal verification of large arithmetic circuits using gaussian elimination and cone-based polynomial extraction. MICPRO, 39 (2): 83–96, 2015.Google Scholar
- [5].. Mechanical verification of adder circuits using rewrite rule laboratory. Formal Methods in System Design: An International Journal, 13 (2): 127–158, 1998.Google ScholarDigital Library
- [6].. Efficient Gröbner basis reductions for formal verification of Galois field arithmetic circuits. TCAD, 32 (9): 1409–1420, Sept 2013.Google Scholar
- [7].. Combining symbolic computer algebra and boolean satisfiability for automatic debugging and fixing of complex multipliers. In ISVLSL 2018.Google Scholar
- [8].. Modeling of custom-designed arithmetic components in ABL normalization. In FDL, pages 124–129, 2008.Google Scholar
- [9].. Column-wise verification of multipliers using computer algebra. In FMCAD, pages 23–30, 2017.Google Scholar
- [10].. Improving and extending the algebraic approach for verifying gate-level multipliers. In DATE, pages 1556–1561, 2018.Google Scholar
- [11].. Formal verification of integer multipliers by combining Gröbner basis with logic reduction. In DATE, pages 1048–1053, 2016.Google Scholar
- [12].. Equivalence checking using Gröbner bases. In FMCAD, pages 169–176, 2016.Google Scholar
- [13].. Equivalence checking of arithmetic circuits on the arithmetic bit level. TCAD, 23 (5): 586–597, 2004.Google Scholar
- [14].. Automatic verification of arithmetic circuits in RTL using stepwise refinement of term rewriting systems. TC, 56 (10): 1401–1414, 2007.Google ScholarDigital Library
- [15].. Yosys open synthesis suite. http://www.clifford.at/yosys/Google Scholar
- [16].. Formal verification of arithmetic circuits by function extraction. TCAD, 35 (12): 2131–2142, 2016.Google Scholar
- [17].. Fast algebraic rewriting based on and-inverter graphs. TCAD, 1 (1): 1–5, 2017.Google Scholar
Index Terms
- PolyCleaner: Clean your Polynomials before Backward Rewriting to verify Million-gate Multipliers
Recommendations
Induction-based gate-level verification of multipliers
ICCAD '01: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided designWe propose a method based on unrolling the inductive definition of binary number multiplication to verify gate-level implementations of multipliers. The induction steps successively reduce the size of the multiplier under verification. Through induction,...
Easily testable gate-level and DCVS multipliers
Some C-testable designs of a carry-save parallel multiplier are presented. Results are given for both the gate-level implementation and the differential cascode voltage switch (DCVS) implementation. DCVS circuits are dynamic CMOS circuits which have the ...
Bit-Parallel Systolic Multipliers for GF(2m) Fields Defined by All-One and Equally Spaced Polynomials
Two operations, the cyclic shifting and the inner product, are defined by the properties of irreducible all one polynomials. An effective algorithm is proposed for computing multiplications over a class of fields $GF(2^m)$ using the two operations. Then,...
Comments