Complexity of Data Flow Analysis for Non-Separable Frameworks

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.

[1]  Saumya K. Debray,et al.  On the complexity of flow-sensitive dataflow analyses , 2000, POPL '00.

[2]  Jeffrey D. Ullman,et al.  Monotone data flow analysis frameworks , 1977, Acta Informatica.

[3]  Gary A. Kildall,et al.  A unified approach to global program optimization , 1973, POPL.

[4]  Joe D. Warren,et al.  The program dependence graph and its use in optimization , 1987, TOPL.

[5]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[6]  Dhananjay M. Dhamdhere,et al.  Complexity of bi-directional data flow analysis , 1993, POPL '93.

[7]  Mark N. Wegman,et al.  A Fast and Usually Linear Algorithm for Global Flow Analysis , 1976, J. ACM.

[8]  Dhananjay M. Dhamdhere,et al.  Bidirectional data flow analysis for type inferencing , 2003, Comput. Lang. Syst. Struct..

[9]  Barbara G. Ryder,et al.  Properties of data flow frameworks , 1990, Acta Informatica.

[10]  John Ban Nang Kam.  Monotone data flow analysis frameworks: a formal theory of global computer program optimization. , 1976 .

[11]  Susan Horwitz,et al.  An efficient general iterative algorithm for dataflow analysis , 2004, Acta Informatica.

[12]  David A. Padua,et al.  Dependence graphs and compiler optimizations , 1981, POPL '81.

[13]  Uday P. Khedker.  Data Flow Analysis , 2002, The Compiler Design Handbook.

[14]  Laurie J. Hendren,et al.  Context-sensitive interprocedural points-to analysis in the presence of function pointers , 1994, PLDI '94.

[15]  Aditya Kanade,et al.  Heterogeneous Fixed Points with Application to Points-To Analysis , 2005, APLAS.

[16]  Mark N. Wegman,et al.  Efficiently computing static single assignment form and the control dependence graph , 1991, TOPL.

[17]  Flemming Nielson,et al.  Flow Logics for Constraint Based Analysis , 1998, CC.

[18]  Dhananjay M. Dhamdhere,et al.  A generalized theory of bit vector data flow analysis , 1994, TOPL.

[19]  Matthew S. Hecht,et al.  Flow Analysis of Computer Programs , 1977 .

[20]  Flemming Nielson,et al.  Principles of Program Analysis , 1999, Springer Berlin Heidelberg.

[21]  Flemming Nielson,et al.  Bounded fixed point iteration , 1991, POPL '92.

[22]  Steven S. Muchnick,et al.  Advanced Compiler Design and Implementation , 1997 .

[23]  Flemming Nielson,et al.  Bounded fixed point iteration , 1992, POPL '92.

[24]  Bernhard Steffen,et al.  Partial dead code elimination , 1994, PLDI '94.