Polynomial Formal Verification of Complex Multipliers
Konferenz: MBMV 2022 - 25. Workshop MBMV
17.02.2022 - 18.02.2022 in online
Tagungsband: ITG-Fb. 302: MBMV 2022
Seiten: 4Sprache: EnglischTyp: PDF
Autoren:
Mahzoon, Alireza (Institute of Computer Science, University of Bremen, Bremen, Germany)
Drechsler, Rolf (Institute of Computer Science, University of Bremen, Bremen, Germany & Cyber-Physical Systems, DFKI GmbH, Bremen, Germany & Cyber-Physical Systems, DFKI GmbH, Bremen, Germany)
Inhalt:
In recent years, several formal verification methods based on Symbolic Computer Algebra (SCA) have been proposed to verify complex multipliers. Despite this progress, the complexity of these methods is usually unknown. It raises serious questions regarding the scalability of SCA-based approaches. In this paper, we propose a verification method based on SCA and Binary Decision Diagrams (BDDs) to guarantee the polynomial formal verification of complex multipliers.