In recent years, formal methods based on Symbolic Computer Algebra (SCA) have shown
very good results in verification of integer multipliers. The success is based on removing …

Formal verification utilizing symbolic computer algebra has demonstrated the ability to
formally verify large Galois field arithmetic circuits and basic architectures of integer …

Reusable hardware Intellectual Property (IP) based System-on-Chip (SoC) design has
emerged as a pervasive design practice in the industry today. The possibility of hardware …

Nowadays, a variety of multipliers are used in different computationally intensive industrial
applications. Most of these multipliers are highly parallelized and structurally complex …

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 …

Constructing algebraic polynomials using computer algebra techniques is believed to be
state-of-the-art in analyzing gate-level arithmetic circuits. However, the existing approach …

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

Growing reliance on reusable hardware Intellectual Property (IP) blocks, severely affects the
security and trustworthiness of System-on-Chips (SoCs) since untrusted third-party vendors …

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 …

In recent years, significant effort has been put into developing formal verification approaches
by both academic and industrial research. In practice, these techniques often give satisfying …