Formal Verification of Integer Multiplier Circuits Using Algebraic Reasoning: A Survey

DOI10.1007/978-3-030-68071-8_1MaRDI QIDQ5157436zbMATH OpenOpenAlexFDO

Authors Daniela Kaufmann

Publication date 18 October 2021

Published in Recent Findings in Boolean Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-68071-8_1

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites work

• An Algebraic Approach for Proving Data Correctness in Arithmetic Data Paths
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Automated and scalable verification of integer multipliers
• Automatic Verification of Arithmetic Circuits in RTL Using Stepwise Refinement of Term Rewriting Systems
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 5353378 (Why is no real title available?)
• scientific article; zbMATH DE number 1256733 (Why is no real title available?)
• scientific article; zbMATH DE number 7178357 (Why is no real title available?)
• Incremental column-wise verification of arithmetic circuits using computer algebra
• Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs
• Nullstellensatz-proofs for multiplier verification
• Verification of arithmetic circuits using binary moment diagrams

Cited in

(1)

• Verification of Galois field based circuits by formal reasoning based on computational algebraic geometry

Describes a project that uses

Uses Software

• EPFL

This page was built for publication: Formal Verification of Integer Multiplier Circuits Using Algebraic Reasoning: A Survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5157436)