Invention Grant
- Patent Title: Enhanced verification by closely coupling a structural overapproximation algorithm and a structural satisfiability solver
- Patent Title (中): 通过紧密耦合结构过近似算法和结构可满足性求解器来增强验证
-
Application No.: US12013163Application Date: 2008-01-11
-
Publication No.: US07743353B2Publication Date: 2010-06-22
- Inventor: Jason R. Baumgartner , Robert L. Kanzelman , Hari Mony , Viresh Paruthi
- Applicant: Jason R. Baumgartner , Robert L. Kanzelman , Hari Mony , Viresh Paruthi
- Applicant Address: US NY Armonk
- Assignee: International Business Machines Corporation
- Current Assignee: International Business Machines Corporation
- Current Assignee Address: US NY Armonk
- Agency: Dillon & Yudell LLP
- Main IPC: G06F17/50
- IPC: G06F17/50

Abstract:
A method, system and computer program product for performing verification are disclosed. A first abstraction of an initial design netlist containing a first target is created and designated as a current abstraction, and the current abstraction is unfolded by a selectable depth. A composite target is verified using a satisfiability solver, and in response to determining that the verifying step has hit the composite target, a counterexample to is examined to identify one or more reasons for the first target to be asserted. One or more refinement pairs are built by examining the counterexample, and a second abstraction is built by composing the refinement pairs. One or more learned clauses and one or more invariants to the second abstraction and the second abstraction is chosen as the current abstraction. The current abstraction is verified with the satisfiability solver.
Public/Granted literature
Information query