Formal that "Floats" High: Formal Verification of Floating Point Arithmetic
Hansa Mohanty, Vaisakh Naduvodi Viswambharan, Deepak Narayan Gadde

TL;DR
This paper introduces a scalable, RTL-to-RTL formal verification methodology for floating-point arithmetic, integrating AI-driven property generation and iterative refinement to improve coverage and efficiency.
Contribution
It presents a novel divide-and-conquer verification approach with AI-assisted property generation, enhancing scalability and robustness in floating-point RTL verification.
Findings
Higher coverage efficiency with fewer assertions
Effective integration of AI-generated properties
Improved scalability over traditional methods
Abstract
Formal verification of floating-point arithmetic remains challenging due to non-linear arithmetic behavior and the tight coupling between control and datapath logic. Existing approaches often rely on high-level C models for equivalence checking against Register Transfer Level (RTL) designs, but this introduces abstraction gaps, translation overhead, and limits scalability at the RTL level. To address these challenges, this paper presents a scalable methodology for verifying floating-point arithmetic using direct RTL-to-RTL model checking against a golden reference model. The approach adopts a divide-and conquer strategy that decomposes verification into modular stages, each captured by helper assertions and lemmas that collectively prove a main correctness theorem. Counterexample (CEX)-guided refinement is used to iteratively localize and resolve implementation defects, while targeted…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical Methods and Algorithms · Formal Methods in Verification · Embedded Systems Design Techniques
