Polynomial Formal Verification: Ensuring Correctness under Resource Constraints : (Invited Paper)

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 verificatio...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2022 IEEE/ACM International Conference On Computer Aided Design (ICCAD) S. 1 - 9
Hauptverfasser: Drechsler, Rolf, Mahzoon, Alireza
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: ACM 29.10.2022
Schlagworte:
binary decision diagrams
complexity
Computer architecture
Design automation
polynomial formal verification
Scalability
symbolic computer algebra
Task analysis
Time complexity
Tutorials
Upper bound
ISSN:1558-2434
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.In this tutorial paper, we review recent developments in formal verification techniques and give a comprehensive overview of Polynomial Formal Verification (PFV). In PFV, polynomial upper bounds for the run-time and memory needed during the entire verification task hold. Thus, correctness under resource constraints can be ensured. We discuss the importance and advantages of PFV in the design flow. Formal methods on the bit-level and the word-level, and their complexities when used to verify different types of circuits, like adders, multipliers, or ALUs are presented. The current status of this new research field and directions for future work are discussed.
ISSN:1558-2434
DOI:10.1145/3508352.3561104