Invention Grant
US08532971B2 DPLL-based SAT solver using with application-aware branching 有权
基于DPLL的SAT解算器使用应用感知分支

DPLL-based SAT solver using with application-aware branching
Abstract:
A system and method for determining satisfiability of a bounded model checking instance by restricting the decision variable ordering of the SAT solver to a sequence wherein a set of control state variables is given higher priority over the rest variables appearing in the formula. The order for control state variables is chosen based on an increasing order of the control path distance of corresponding control states from the target control state. The order of the control variables is fixed, while that of the rest is determined by the SAT search. Such a decision variable ordering strategy leads to improved performance of SAT solver by early detection and pruning of the infeasible path segments that are closer to target control state.
Public/Granted literature
Information query
Patent Agency Ranking
0/0