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

DOI10.1007/978-3-030-68071-8_1OpenAlexW3159305744MaRDI QIDQ5157436

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)

Uses Software

• EPFL

Cites Work

• Verification of arithmetic circuits using binary moment diagrams
• Nullstellensatz-proofs for multiplier verification
• Towards verifying nonlinear integer arithmetic
• Automated and scalable verification of integer multipliers
• Incremental column-wise verification of arithmetic circuits using computer algebra
• An Algebraic Approach for Proving Data Correctness in Arithmetic Data Paths
• Graph-Based Algorithms for Boolean Function Manipulation
• Automatic Verification of Arithmetic Circuits in RTL Using Stepwise Refinement of Term Rewriting Systems
• Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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