A new framework for exhaustive and incremental data flow analysis using DJ graphs

@inproceedings{Sreedhar1996ANF,
  title={A new framework for exhaustive and incremental data flow analysis using DJ graphs},
  author={V. Sreedhar and G. Gao and Yong-Fong Lee},
  booktitle={PLDI '96},
  year={1996}
}
  • V. Sreedhar, G. Gao, Yong-Fong Lee
  • Published in PLDI '96 1996
  • Computer Science
  • We present a new elimination-based framework for exhaustive and incremental data flow analysis using the DJ graph representation of a program. Unlike the previous approaches to elimination-based incremental data flow analysis, our approach can handle arbitrary non-structural and structural changes to program flowgraphs, including those causing irreducibility. We show how our approach is related to (iterated) dominance frontiers, and exploit this relationship to establish the complexity of our… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Identifying loops using DJ graphs
    98
    A Framework for Incremental Extensible Compiler Construction
    Making graphs reducible with controlled node splitting
    56
    Composing dataflow analyses and transformations
    96
    Decidability of the Analysis Problem for Dataflow Models of Programs
    2
    On the Importance of Program Representations in Static Analysis
    Handling irreducible loops: optimized node splitting versus DJ-graphs
    25
    The static single information form
    75

    References

    Publications referenced by this paper.
    Compilers: Principles, Techniques, and Tools
    7330