A Graph—Free Approach to Data—Flow Analysis

  • Markus Mohnen
Conference paper

DOI: 10.1007/3-540-45937-5_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2304)
Cite this paper as:
Mohnen M. (2002) A Graph—Free Approach to Data—Flow Analysis. In: Horspool R.N. (eds) Compiler Construction. CC 2002. Lecture Notes in Computer Science, vol 2304. Springer, Berlin, Heidelberg


For decades, data—flow analysis (DFA) has been done using an iterative algorithm based on graph representations of programs. For a given data—flow problem, this algorithm computes the maximum fixed point (MFP) solution. The edge structure of the graph represents possible control flows in the program. In this paper, we present a new, graph-free algorithm for computing the MFP solution. The experimental implementation of the algorithm was applied to a large set of samples. The experiments clearly show that the memory usage of our algorithm is much better: Our algorithm always reduces the amount of memory and reached improvements upto less than a tenth. In the average case, the reduction is about a third of the memory usage of the classical algorithm. In addition, the experiments showed that the runtimes are almost the same: The average speedup of the classical algorithm is only marginally greater than one.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Markus Mohnen
    • 1
  1. 1.Lehrstuhl für Informatik IIRWTH AachenGermany

Personalised recommendations