^{1,a}, Daniel Große

^{1,2,b}, Ulrich Kühne

^{1,c}, Mathias Soeken

^{1,3}and Rolf Drechsler

^{1,2,d}

^{1}Faculty of Mathematics and Computer Science, University of Bremen, Germany.

^{a}asahmed@informatik.uni-bremen.de

^{b}grosse@informatik.uni-bremen.de

^{c}ulrichk@informatik.uni-bremen.de

^{d}drechsle@informatik.uni-bremen.de

^{2}Cyber-Physical Systems, DFKI GmbH, Bremen, Germany.

^{3}Integrated Systems Laboratory (LSI), EPFL, Switzerland.

Formal verification utilizing symbolic computer algebra has demonstrated the ability to formally verify large Galois field arithmetic circuits and basic architectures of integer arithmetic circuits. The technique models the circuit as Gröbner basis polynomials and reduces the polynomial equation of the circuit specification wrt. the polynomials model. However, during the Gröbner basis reduction, the technique suffers from exponential blow-up in the size of the polynomials, if it is applied on parallel adders and recoded multipliers. In this paper, we address the reasons of this blow-up and present an approach that allows to apply the technique on basic and complex parallel architectures of multipliers. The approach is based on applying a logic reduction rule during Gröbner basis rewriting. The rule uses structural circuit information to remove terms that evaluate to zero before their blow-up. The experiments show that the approach is applicable up to 128 bit multipliers.