Invention Grant
- Patent Title: DPLL-based SAT solver using with application-aware branching
- Patent Title (中): 基于DPLL的SAT解算器使用应用感知分支
-
Application No.: US12872797Application Date: 2010-08-31
-
Publication No.: US08532971B2Publication Date: 2013-09-10
- Inventor: Malay K. Ganai
- Applicant: Malay K. Ganai
- Applicant Address: US NJ Princeton
- Assignee: NEC Laboratories America, Inc.
- Current Assignee: NEC Laboratories America, Inc.
- Current Assignee Address: US NJ Princeton
- Agent Joseph Kolodka; James Bitetto
- Main IPC: G06F17/50
- IPC: G06F17/50

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
- US20110184705A1 DPLL-BASED SAT SOLVER USING WITH APPLICATION-AWARE BRANCHING Public/Granted day:2011-07-28
Information query