Computing a symbolic bound for a procedure
AssigneeMicrosoft Corporation
InventorsSumit Gulwani, Florian Franz Zuleger, Sudeep Dilip Juvekar
Life of this patent
Estimating the term…
Loading patent…
AssigneeMicrosoft Corporation
InventorsSumit Gulwani, Florian Franz Zuleger, Sudeep Dilip Juvekar
Estimating the term…
A system that facilitates computing a symbolic bound with respect to a procedure that is executable by a processor on a computing device is described herein. The system includes a transition system generator component that receives the procedure and computes a disjunctive transition system for a control location in the procedure. A compute bound component computes a bound for the transition system, wherein the bound is expressed in terms of inputs to the transition system. The system further includes a translator component that translates the bound computed by the compute bound component such that the bound is expressed in terms of inputs to the procedure.
A system that facilitates computing a symbolic bound on the number of visits to a control location inside a procedure, the system comprising:
A method for computing a reachability bound on a control location inside a procedure that is executable by a processor in a computing device, wherein the method comprises:
A computer-readable memory comprising instructions that, when executed by a processor, cause the processor perform acts comprising:
Dependencies are inferred from the claim text.