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 results for some types of circuits, while they fail for others. A major challenge in this domain is that the verification techniques suffer from unpredictability in their performance. The only way to overcome this challenge is the calculation of bounds for the space and time complexities. If a verification method has polynomial space and time complexities, scalability can be guaranteed.
In this monograph, we propose Polynomial Formal Verification (PFV) of arithmetic circuits. We discuss the importance and advantages of PFV. Subsequently, we prove that PFV of different types of arithmetic circuits, including adders, multipliers, and Arithmetic Logic Units (ALUs) is possible. Furthermore, we calculate the exact upper-bound space and time complexities of verifying these circuits.
