Complexity of Data Flow Analysis for Non-Separable Frameworks
Programming Languages
2007-05-23 v2
Abstract
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.
Cite
@article{arxiv.cs/0610164,
title = {Complexity of Data Flow Analysis for Non-Separable Frameworks},
author = {Bageshri Karkare and Uday Khedker},
journal= {arXiv preprint arXiv:cs/0610164},
year = {2007}
}
Comments
Published in the International Conference on Programming Languages and Compilers (PLC) 2006, Las Vegas, U.S.A