Invention Grant
US08015528B2 Enhanced verification by closely coupling a structural satisfiability solver and rewriting algorithms
失效
通过紧密耦合结构可满足性求解器和重写算法来增强验证
- Patent Title: Enhanced verification by closely coupling a structural satisfiability solver and rewriting algorithms
- Patent Title (中): 通过紧密耦合结构可满足性求解器和重写算法来增强验证
-
Application No.: US12332191Application Date: 2008-12-10
-
Publication No.: US08015528B2Publication Date: 2011-09-06
- 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 are disclosed. The method includes initializing a first variable to limit a rewrite time for rewrite operations with respect to an initial design by a rewriting module, a second variable to limit a time for satisfiability solver operations with respect to said initial design by a satisfiability solver module and a third variable to limit a maximum number of rewrite iterations with respect to said initial design. A timer is called to track said rewrite time and a local logic rewriting operation is run on said initial design with said rewrite module. In response to determining that all of all targets for said initial design netlist are not solved, whether a rewrite time is expired is determined. In response to determining that said rewrite time is not expired, AND refactoring is run. In response to determining that said rewrite time is not expired, XOR refactoring is run.
Public/Granted literature
Information query