Formal Verification of Structurally Complex Multipliers

DOI10.1007/978-3-031-24571-8MaRDI QIDQ6193697zbMATH OpenOpenAlexFDO

Authors Alireza Mahzoon, Daniel Große, Rolf Drechsler

Publication date 18 March 2024

Full work available at URL https://doi.org/10.1007/978-3-031-24571-8

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Mathematical problems of computer architecture (68M07) Networks and circuits as models of computation; circuit complexity (68Q06) Specification and verification (program logics, model checking, etc.) (68Q60) Symbolic computation and algebraic computation (68W30) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Automated and scalable verification of integer multipliers
• scientific article; zbMATH DE number 1330907
• Scalable Techniques for Formal Verification
• SAT-Based Scalable Formal Verification Solutions
• Formal system verification. State-of the-art and future trends

Cited in

(3)

• Polynomial Formal Verification of Approximate Functions
• Verified implementation of an efficient term-rewriting algorithm for multiplier verification on ACL2
• Symbolic computer algebra for multipliers revisited - demonstrating the significance of order and phase optimization

This page was built for publication: Formal Verification of Structurally Complex Multipliers

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