Improving AMulet2 for verifying multiplier circuits using SAT solving and computer algebra

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. Finally, it uses a polynomial reduction algorithm to verify the correctness of the given circuit. AMULET2 is a re-factorization and improved re-implementation of our previous verification tool AMULET1 and cannot only be used as a stand-alone tool but also serves as a polynomial reasoning framework. We present a novel XOR-based slicing approach and discuss improvements on the data structures including monomial sharing

Standort
Deutsche Nationalbibliothek Frankfurt am Main
Umfang
Online-Ressource
Sprache
Englisch
Anmerkungen
ISSN: 1433-2787

Ereignis
Veröffentlichung
(wo)
Freiburg
(wer)
Universität
(wann)
2023
Urheber
Kaufmann, Daniela
Biere, Armin
Beteiligte Personen und Organisationen

DOI
10.1007/s10009-022-00688-6
URN
urn:nbn:de:bsz:25-freidok-2393703
Rechteinformation
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
Letzte Aktualisierung
25.03.2025, 13:44 MEZ

Datenpartner

Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.

Beteiligte

Entstanden

  • 2023

Ähnliche Objekte (12)