Invention Grant
US08972949B2 Rule-based method for proving unsatisfiable conditions in a mixed numeric and string solver
有权
用于证明混合数字和字符串求解器中不满足条件的基于规则的方法
- Patent Title: Rule-based method for proving unsatisfiable conditions in a mixed numeric and string solver
- Patent Title (中): 用于证明混合数字和字符串求解器中不满足条件的基于规则的方法
-
Application No.: US13482598Application Date: 2012-05-29
-
Publication No.: US08972949B2Publication Date: 2015-03-03
- Inventor: Indradeep Ghosh , Guodong Li
- Applicant: Indradeep Ghosh , Guodong Li
- Applicant Address: JP Kawasaki-shi
- Assignee: Fujitsu Limited
- Current Assignee: Fujitsu Limited
- Current Assignee Address: JP Kawasaki-shi
- Agency: Baker Botts L.L.P.
- Main IPC: G06F9/44
- IPC: G06F9/44

Abstract:
A method includes, by computing devices, analyzing numeric and string constraints associated with a software module that includes numeric and string variables and operations applying to specific variables for numeric or string results. The numeric constraints apply to specific numeric variables. The string constraints apply to specific string variables. The method further includes determining an over-approximated constraint from the numeric constraints or operations, representing the over-approximated constraint and string constraints with finite state machines, representing the numeric constraints with an equation, determining whether a solution does not exist for the combination of the variables that satisfies the over-approximated constraint, the numeric constraints, and the string constraints using operations, and terminating attempts to solve for the variables based on the determination whether the solution does not exist. The over-approximated constraint includes a superset of the numeric constraints or operations and applies to specific string variables.
Public/Granted literature
- US20130326485A1 RULE-BASED METHOD FOR PROVING UNSATISFIABLE CONDITIONS IN A MIXED NUMERIC AND STRING SOLVER Public/Granted day:2013-12-05
Information query