Towards Formal Verification of Optimized and Industrial Multipliers
Alireza Mahzoon1,a, Daniel Große1,2,b,Christoph Scholl3,d and Rolf Drechsler1,2,c
1Institute of Computer Science, University of Bremen, Germany
2Cyber-Physical Systems, DFKI GmbH, Bremen, Germany
3Institute of Computer Science, University of Freiburg, Germany
amahzoon@informatik.uni-bremen.de
bgrosse@informatik.uni-bremen.de
cdrechsle@informatik.uni-bremen.de
dscholl@informatik.uni-freiburg.de
ABSTRACT
Formal verification methods have made huge progress over the last decades. However, proving the correctness of arithmetic circuits involving integer multipliers still drives the verification techniques to their limits. Recently, Symbolic Computer Algebra (SCA) methods have shown good results in the verification of both large and non-trivial multipliers. Their success is mainly based on (1) reverse engineering and identifying basic building blocks, (2) finding converging gate cones which start from the basic building blocks and (3) early removal of redundant terms (vanishing monomials) to avoid the blow-up during backward rewriting.
Despite these important accomplishments, verifying optimized and technology-mapped multipliers is an almost unexplored area. This creates major barriers for industrial use as most of the designs are area and delay optimized. To overcome the barriers, we propose a novel SCA-method which supports the formal verification of a large variety of optimized multipliers. Our method takes advantage of a dynamic substitution ordering to avoid the monomial explosion during backward rewriting. Experimental results confirm the efficiency of our approach in the verification of a wide range of optimized multipliers including industrial benchmarks.
