We combine SAT and computer algebra to substantially improve the most effective approach
for automatically verifying integer multipliers. In our approach complex final stage adders are …

The formal verification of integer multipliers is one of the important but challenging problems
in the verification community. Recently, the methods based on symbolic computer algebra …

Formal verification methods have made huge progress over the last decades. However,
proving the correctness of arithmetic circuits involving integer multipliers still drives the …

Despite the recent success of formal verification methods, the computational complexity of
most of them is still unknown. It raises serious questions regarding the scalability of the …

Reasoning high-level abstractions from bit-blasted Boolean networks (BNs) such as gate-
level netlists can significantly benefit functional verification, logic minimization, datapath …

Verifying the functional correctness of a circuit is often the most time-consuming part of the
design process. Recently, world-level formal verification methods, eg, Binary Moment …

Arithmetic block identification in gate-level netlist is an essential procedure for malicious
logic detection, functional verification, or macro-block optimization. We argue that existing …

The size and the complexity of digital circuits are increasing rapidly. This makes the circuits
highly error-prone. As a result, proving the correctness of a circuit is of utmost importance …

With the ever-increasing hardware design complexity comes the realization that efforts
required for hardware verification increase at an even faster rate. Driven by the push from …

AMulet 2.0 is a fully automatic tool for the verification of integer multipliers using computer
algebra. Our tool models multiplier circuits given as and-inverter graphs as a set of …