GenMul: Generating Architecturally Complex Multipliers to Challenge Formal Verification Tools

DOI10.1007/978-3-030-68071-8_9MaRDI QIDQ5157446zbMATH OpenOpenAlexFDO

Authors Alireza Mahzoon, Daniel Große, Rolf Drechsler

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_9

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06) Specification and verification (program logics, model checking, etc.) (68Q60) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Cites work

• Automatic Verification of Arithmetic Circuits in RTL Using Stepwise Refinement of Term Rewriting Systems
• Computer arithmetic algorithms.
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 5353378 (Why is no real title available?)
• scientific article; zbMATH DE number 1506311 (Why is no real title available?)
• On WLCDs and the complexity of word-level decision diagrams --- A lower bound for division
• Polynomial formal verification of multipliers

Cited in

(1)

• GenMul

Describes a project that uses

Uses Software

• RevSCA
• PolyCleaner

This page was built for publication: GenMul: Generating Architecturally Complex Multipliers to Challenge Formal Verification Tools

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