Patent Document ID: 8996922
Application ID: 13683921

Base Claim:
1. A method of determining whether a set of constraints is satisfiable, the method comprising: identifying a set of constraints associated with a software module; modeling a string associated with a string constraint of the set of constraints as a parameterized array; and determining a satisfiability of the set of constraints based on a representation of the string constraint as a quantified expression and based on elimination of a quantifier associated with the quantified expression such that the string constraint is represented as a numeric constraint, the representation of the string constraint as a quantified expression being based on the parameterized array associated with the string.

---

Claim 9:
9. The method of claim 1 , further comprising: eliminating the quantifier through recursively unrolling the quantified expression to generate an incremented expression of the string constraint; and determining whether the set of constraints is satisfiable based on the incremented expression.