Formal verification method for optimizing multiplier realized by SCA-SAT cooperation
CN117785112BActive Publication Date: 2026-08-28SHANGHAI TECH UNIV
View PDF 0 Cites 0 Cited by
Patent Information
- Application Number
- CN202410065035.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-01-16
- Publication Date
- 2026-08-28
- Estimated Expiration
- 2044-01-16
AI Technical Summary
Technical Problem
然而,对于优化后的乘法器,这些边界被模糊,经常发生内存爆炸的问题
✦ Generated by Eureka AI based on patent content.
Smart Images

Figure CN117785112B_ABST
Abstract
The application discloses a kind of SCA-SAT synergistic effect realizes formal verification method of optimized multiplier, include: reverse engineering algorithm systematically from optimized multiplier restores adder tree;2) constraint satisfaction algorithm is only used by adder through constraint condition to complete the generation of reference multiplier;3) the verification method based on SCA and SAT combines the complementary advantages of SCA and SAT.In the foregoing verification framework, the application introduces a benchmark multiplier generator, which is used to generate a correct benchmark multiplier that has both similar structure to the optimized multiplier and clear adder boundaries.Clear adder boundaries enable the use of SCA-based verification to prove its correctness.Using the structural similarity of the benchmark multiplier and the optimized multiplier, the benchmark multiplier is then used as a known correct model for SAT-based verification of the optimized multiplier.
Need to check novelty before this filing date? Find Prior Art