Načítá se...
Automated and Scalable Verification of Integer Multipliers
The automatic formal verification of multiplier designs has been pursued since the introduction of BDDs. We present a new rewriter-based method for efficient and automatic verification of signed and unsigned integer multiplier designs. We have proved the soundness of this method using the ACL2 theor...
Uloženo v:
| Vydáno v: | Computer Aided Verification |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
2020
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7363191/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-53288-8_23 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|