Verification of arithmetic circuits using binary moment diagrams

DOI10.1007/S100090100037zbMATH Open1002.68588OpenAlexW1520753950WikidataQ126568026 ScholiaQ126568026MaRDI QIDQ1606802FDOQ1606802

Yirng-An Chen, Randal E. Bryant

Publication date: 25 July 2002

Published in: International Journal on Software Tools for Technology Transfer. STTT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s100090100037

Recommendations

• Decision diagrams for verification
• Polynomial formal verification of multipliers
• Publication:4504717
• Publication:4934627
• Boolean expression diagrams

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Computer science aspects of computer-aided design (68U07) Network design and communication in computer systems (68M10)

Cited In (4)

• Polynomial formal verification of multipliers
• Bit-precise verification of discontinuity errors under fixed-point arithmetic
• Formal Verification of Integer Multiplier Circuits Using Algebraic Reasoning: A Survey
• Incremental column-wise verification of arithmetic circuits using computer algebra

This page was built for publication: Verification of arithmetic circuits using binary moment diagrams

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