PolyCleaner

Mahzoon, Alireza; Große, Daniel; Drechsler, Rolf

doi:10.1145/3240765.3240837

Cited by 38 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, these tools do not scale well with large multipliers. For the last few years, efforts to verify large integer multipliers have explored the symbolic computer algebra approach based on Gröbner basis [7,16,22,23,28,37]. As far as we are aware, all these tools are stand-alone, unverified C programs and none of them except D. Kaufmann et al [16] produces certificates.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

See 1 more Smart Citation

Automated and Scalable Verification of Integer Multipliers

Temel

Slobodová²,

HuntJr.

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The automatic formal verification of multiplier designs has been pursued since the introduction of BDDs. We present a new rewriterbased method for efficient and automatic verification of signed and unsigned integer multiplier designs. We have proved the soundness of this method using the ACL2 theorem prover, and we can verify integer multiplier designs with various architectures automatically, including Wallace, Dadda, and 4-to-2 compressor trees, designed with Booth encoding and various types of final stage adders. Our experiments have shown that our approach scales well in terms of time and memory. With our method, we can confirm the correctness of 1024 × 1024-bit multiplier designs within minutes.

show abstract

Section: Related Work and Conclusionmentioning

confidence: 99%

“…In recent years, the search for more automatic procedures resulted in methods based on symbolic computational algebra [7,16,22,23,40] . This approach makes it possible for certain types of multipliers to be verified automatically for larger designs.…”

Section: Introductionmentioning

confidence: 99%