On Automating Proofs of Multiplier Adder Trees using the RTL Books
We present an experimental, verified clause processor ctv-cp that fits into the framework used at Arm for formal verification of arithmetic hardware designs.This largely automates the ACL2 proof development effort for integer multiplier modules that exist in designs ranging from floating-point division to matrix multiplication.
Authors
- Mayank Manjrekar
Institutions
- American Rock Mechanics Association (US)
Publication Details
- Journal
- Electronic Proceedings in Theoretical Computer Science
- Published
- 2025-07-24
- DOI
- https://doi.org/10.4204/eptcs.423.5
- Primary Topic
- Polynomial and algebraic computation
- Type
- article
- Field-Weighted Citation Impact
- 0.00