Formal Verification of Restoring Dividers made Fast and Simple
Jiteshri Dasari, Maciej J. Ciesielski
摘要
The paper describes a formal verification method for hardware implementation of restoring divider circuits. The method is based on setting select signals to predefined constants to reduce the design to easily verifiable circuit components, followed by their verification using standard equivalence checking and SAT. It is then concluded by a global proof that the composition of those components indeed implements a divider. In contrast to previous approaches, the verification is done on a functional level without any reverse engineering of the internal structure. The results show significant improvement in verification time compared to other methods. The proposed approach can also be used in debugging by localizing the source of a bug. This feature is currently not available in the existing verification tools and will be a subject of future work.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper2
- Symbolic Computer Algebra and SAT Based Information Forwarding for Fully Automatic Divider VerificationChristoph Scholl, Alexander KonradDAC 2020 · 被引用 16 次
- Formal verification of modular multipliers using symbolic computer algebra and boolean satisfiabilityAlireza Mahzoon, Daniel Große, Christoph Scholl, Alexander Konrad 等DAC 2022 · 被引用 15 次
相关 Paper
- Automated and Scalable Verification of Integer MultipliersMertcan Temel, Anna Slobodová, Warren A. HuntCAV 2020 · 被引用 28 次
- The Simulation Semantics of Synthesisable VerilogAndreas LööwOOPSLA 2025 · 被引用 4 次
- Formally Verifying Arithmetic Chisel Designs for All Bit Widths at OnceWeizhi Feng, Yicheng Liu, Jiaxiang Liu, David N. Jansen 等DAC 2024
- CirFix: automatically repairing defects in hardware design codeHammad Ahmad, Yu Huang, Westley WeimerASPLOS 2022 · 被引用 23 次
- X-SAT: An Efficient Circuit-Based SAT SolverYuhang Qian, Zhihan Chen, Xindi Zhang, Shaowei CaiDAC 2025 · 被引用 4 次
