Polynomial Formal Verification of Structurally Simple Multipliers
Formal verification of integer multipliers remains a challenging problem in electronic design automation, as logic-based approaches such as Satisfiability Solvers (SAT) and Binary Decision Diagrams (BDDs) often scale poorly on such circuitry. In recent times, Polynomial Formal Verification (PFV) has been investigated f...