Mechanizing verification of arithmetic circuits: SRT division

Deepak Kapur, M. Subramaniam

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations


The use of a rewrite-based theorem prover for verifying properties of arithmetic circuits is discussed. A prover such as Rewrite Rule Laboratory (RRL) can be used effectively for establishing numbertheoretic properties of adders, multipliers and dividers. Since verification of adders and multipliers has been discussed elsewhere in earlier papers, the focus in this paper is on a divider circuit. An SRT division circuit similar to the one used in the Intel Pentium processor is mechanically verified using RRL. The number-theoretic correctness of the division circuit is established from its equational specification. The proof is generated automatically, and follows easily using the inference procedures for contextual rewriting and a decision procedure for the quantifier-free theory of numbers (Presburger arithmetic) already implemented in RRL. Additional enhancements to rewrite-based provers such as RRL that would further facilitate verifying properties of circuits with structure similar to that of the SRT division circuit are discussed.

Original languageEnglish (US)
Title of host publicationFoundations of Software Technology and Theoretical Computer Science - 17th Conference, 1997, Proceedings
EditorsS. Ramesh, G. Sivakumar
PublisherSpringer Verlag
Number of pages20
ISBN (Print)3540638768, 9783540638766
StatePublished - 1997
Externally publishedYes
Event17th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 1997 - Kharagpur, India
Duration: Dec 18 1997Dec 20 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other17th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 1997

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Mechanizing verification of arithmetic circuits: SRT division'. Together they form a unique fingerprint.

Cite this