Item Infomation
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Daniela, Kaufmann | - |
| dc.contributor.author | Armin, Biere | - |
| dc.date.accessioned | 2023-03-31T02:24:57Z | - |
| dc.date.available | 2023-03-31T02:24:57Z | - |
| dc.date.issued | 2023 | - |
| dc.identifier.uri | https://link.springer.com/article/10.1007/s10009-022-00688-6 | - |
| dc.identifier.uri | https://dlib.phenikaa-uni.edu.vn/handle/PNK/7364 | - |
| dc.description | CC BY | vi |
| dc.description.abstract | Verifying arithmetic circuits and most prominently multiplier circuits is an important problem which in practice is still considered to be challenging. One of the currently most successful verification techniques relies on algebraic reasoning. In this article, we present AMULET2, a fully automatic tool for verification of integer multipliers combining SAT solving and computer algebra. Our tool models multipliers given as and-inverter graphs as a set of polynomials and applies preprocessing techniques based on elimination theory of Gröbner bases. | vi |
| dc.language.iso | en | vi |
| dc.publisher | Springer | vi |
| dc.subject | AMULET2 | vi |
| dc.subject | SAT | vi |
| dc.title | Improving AMULET2 for verifying multiplier circuits using SAT solving and computer algebra | vi |
| dc.type | Book | vi |
| Appears in Collections | ||
| OER - Công nghệ thông tin | ||
Files in This Item:
