Polynomial Formal Verification
Rolf Drechsler, Alireza Mahzoon
2022Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design21 citationsDOI
Abstract
Recently, a lot of 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.
Topics & Concepts
Computer scienceFormal verificationScalabilityTheoretical computer scienceDomain (mathematical analysis)Formal methodsFunctional verificationPolynomialProgramming languageMathematicsMathematical analysisDatabaseFormal Methods in VerificationEmbedded Systems Design TechniquesLow-power high-performance VLSI design