Yüklüyor......
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...
Kaydedildi:
| Yayımlandı: | Computer Aided Verification |
|---|---|
| Asıl Yazarlar: | , , |
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
2020
|
| Konular: | |
| Online Erişim: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7363191/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-53288-8_23 |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|