Complexity of Data Flow Analysis for Non-Separable Frameworks

Details Complexity of Data Flow Analysis for Non-Separable Frameworks Complexity of Data Flow Analysis for Non-Separable Frameworks

2006-10-30

arxiv.org/abs/cs/0610164v2

Computer Science

Programming Languages

Published in the International Conference on Programming Languages and Compilers (PLC) 2006, Las Vegas, U.S.A

Scientific paper

The complexity of round robin method of intraprocedural data flow analysis is measured in number of iterations over the control flow graph. Existing complexity bounds realistically explain the complexity of only Bit-vector frameworks which are separable. In this paper we define the complexity bounds for non-separable frameworks by quantifying the interdependences among the data flow information of program entities using an Entity Dependence Graph.

Affiliated with

Also associated with

No associations

Rating

Complexity of Data Flow Analysis for Non-Separable Frameworks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Complexity of Data Flow Analysis for Non-Separable Frameworks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of Data Flow Analysis for Non-Separable Frameworks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-230327