Enhanced verification by closely coupling a struct

专利名称：Enhanced verification by closely coupling a

structural satisfiability solver and rewritingalgorithms

发明人：Jason R. Baumgartner,Robert L.

Kanzelman,Hari Mony,Viresh Paruthi

申请号：US12332191申请日：20081210公开号：US08015528B2公开日：20110906

专利附图：

摘要：A method, system and computer program product are disclosed. The method

includes initializing a first variable to limit a rewrite time for rewrite operations withrespect to an initial design by a rewriting module, a second variable to limit a time forsatisfiability solver operations with respect to said initial design by a satisfiability solvermodule and a third variable to limit a maximum number of rewrite iterations with respectto said initial design. A timer is called to track said rewrite time and a local logic rewritingoperation 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 arewrite time is expired is determined. In response to determining that said rewrite time isnot expired, AND refactoring is run. In response to determining that said rewrite time isnot expired, XOR refactoring is run.

申请人：Jason R. Baumgartner,Robert L. Kanzelman,Hari Mony,Viresh Paruthi

地址：Austin TX US,Rochester MN US,Austin TX US,Austin TX US

国籍：US,US,US,US

代理机构：Dillon & Yudell LLP

更多信息请下载全文后查看