Multipliers and dividers: Insights on arithmetic circuit verification (extended abstract)
- Randal E. BryantAffiliated withCarnegie Mellon University
We consider methods for verifying multiplier and divider circuits based on symbolic function representations. Verification can be performed at either the bit-level, where individual signals are represented as Boolean functions, or at the word-level, where signal vectors are represented as “pseudo-Boolean” functions mapping Boolean variables to numeric values. These two classes of functions can be represented and manipulated as ordered Binary Decision Diagrams (BDDs), and Binary Moment Diagrams (BMDs), respectively.
It is impractical to verify multiplier or divider circuits entirely at the bit-level, because the BDD representations for these functions grow exponentially with the word size. It is possible, however, to analyze individual stages of these circuits using BDDs. Such analysis can be helpful when implementing complex arithmetic algorithms. As a demonstration, we show that Intel could have used BDDs to detect and even correct erroneous table entries in the Pentium floating point divider.
Abstracting to a word level offers two advantages over bit-level verification. First, it allows much more abstract and concise specifications in terms of arithmetic expressions. Second, we can verify complete multiplier circuits in polynomial time. Future extensions promise to enable word-level verification of divider circuits, as well.
- Multipliers and dividers: Insights on arithmetic circuit verification (extended abstract)
- Book Title
- Computer Aided Verification
- Book Subtitle
- 7th International Conference, CAV '95 Liège, Belgium, July 3–5, 1995 Proceedings
- pp 1-3
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
To view the rest of this content please follow the download PDF link above.