发明授权
US08015528B2 Enhanced verification by closely coupling a structural satisfiability solver and rewriting algorithms
失效
通过紧密耦合结构可满足性求解器和重写算法来增强验证
- 专利标题: Enhanced verification by closely coupling a structural satisfiability solver and rewriting algorithms
- 专利标题(中): 通过紧密耦合结构可满足性求解器和重写算法来增强验证
-
申请号: US12332191申请日: 2008-12-10
-
公开(公告)号: US08015528B2公开(公告)日: 2011-09-06
- 发明人: Jason R. Baumgartner , Robert L. Kanzelman , Hari Mony , Viresh Paruthi
- 申请人: Jason R. Baumgartner , Robert L. Kanzelman , Hari Mony , Viresh Paruthi
- 申请人地址: US NY Armonk
- 专利权人: International Business Machines Corporation
- 当前专利权人: International Business Machines Corporation
- 当前专利权人地址: US NY Armonk
- 代理机构: Dillon & Yudell LLP
- 主分类号: G06F17/50
- IPC分类号: G06F17/50
摘要:
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.
公开/授权文献
信息查询