Control flow analysis using deductive reaching definitions

Details Control flow analysis using deductive reaching definitions Control flow analysis using deductive reaching definitions

G - Physics

06

F

G06F 17/00 (2006.01) G06F 9/44 (2006.01)

Patent

CA 2691851

In an illustrative embodiment a computer-implemented process for deductive reaching definition analysis receives a control flow graph to form a set of received blocks and edges, performs traditional reaching definitions to produce bit-vectors OUT(b), GEN(b) and KILL(b) for each block in the set of received blocks and receives impossibility indicators for a set of definitions that are impossible on specific edges. The computer-implemented process further performs deduction operations using a combination of the bit-vectors and impossibility indicators to deduce that additional definitions cannot reach certain blocks to create resulting reachability information and provides the resulting reachability information as a result to a requestor.

Affiliated with

Also associated with

Rating

Control flow analysis using deductive reaching definitions does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Control flow analysis using deductive reaching definitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Control flow analysis using deductive reaching definitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1450204