Formal Verification of Integer Dividers: Division by a Constant
Résumé
Division is one of the most complex and hard to verify
arithmetic operations. While verification of major arithmetic operators,
such as adders and multipliers, has significantly progressed in
recent years, less attention has been devoted to formal verification of
dividers. A type of divider that is often used in embedded systems is
divide by a constant. This paper presents a formal verification method
for different divide-by-constant architectures and the generic restoring
dividers based on computer algebra approach. Our experiments for
different divider architectures and comparison with exhaustive simulation
demonstrates the effectiveness and scalability of the method.