Skip to main content
SpringerLink
Log in

An efficient general iterative algorithm for dataflow analysis

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

Existing iterative algorithms for global dataflow analysis have demonstrable shortcomings; either they can be used only for a limited class of problems or they are needlessly inefficient in some cases. We review several algorithms, pointing out weaknesses and develop a new algorithm that can be used for a wide class of problems and has a runtime that compares favorably ro runtimes of existing algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aho, A., Ullman, J.: Node listings for reducible flowgraphs. J. Comput. Syst. Sci. 13, 286–299 (1976)

    Google Scholar 

  2. Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Reading, MA: Addison Wesley 1974

    Google Scholar 

  3. Allen, F.: Control flow analysis. SIGPLAN Notices 5, 1–19 (1970)

    Google Scholar 

  4. Giegerich, R., Moncke, U., Wilhelm, R.: Invariance of approximative semantics with respect to program transformations. Proceedings, Third Conference of the European Co-operation in Informatics. In: Informatik-Fachberichte 50, pp. 1–10. Berlin Heidelberg New York: Springer 1981

    Google Scholar 

  5. Graham, S., Wegman, M.: A fast and usually linear algorithm for global flow analysis. J. ACM 23, 172–202 (1976)

    Google Scholar 

  6. Hecht, M., Ullman, J.: Analysis of a simple algorithm for global data flow problems. Conf. Record of the 1st ACM Symp. on POPL 207–217 (1973)

  7. Kam, J., Ullman, J.: Monotone data flow analysis frameworks. Acta Inf. 7, 305–317 (1977)

    Google Scholar 

  8. Kam, J., Ullman, J.: Global data flow analysis and iterative algorithms. J. ACM 23, 158–171 (1976)

    Google Scholar 

  9. Kennedy, K.: Node: Listings applied to data flow analysis. Conf. Record of the 2nd ACM Symp. on POPL 10–21 (1975)

  10. Kennedy, K.: A survey of data flow analysis techniques. In: Program Flow Analysis, Theory and Applications. Muchnick, S., Jones, N. (eds.), pp. 45–46. Englewood Cliffs, NJ: Prentice Hall 1981

    Google Scholar 

  11. Kildall, G.: A unified approach to global program optimization. Conf. Record of the 1st ACM Symp. on POPL 194–206 (1973)

  12. Knuth, D.: An empirical study of FORTRAN programs. Software Pract. Exp. 1, 105–134 (1971)

    Google Scholar 

  13. Tarjan, R.: A unified approach to path problems. J. ACM 28, 577–593 (1981)

    Google Scholar 

  14. Tarjan, R.: Fast algorithms for solving path problems. J. ACM 28, 594–614 (1981)

    Google Scholar 

  15. Wilhelm, R.: Global flow analysis and optimization in the MUG2 compiler generating system. In: Program Flow Analysis, Theory and Applications. Muchnick, S., Jones, N. (eds.), pp. 144–147. Englewood Cliffs, NJ: Prentice Hall 1981

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Sciences Department, University of Wisconsin-Madison, 1210 W. Dayton Street, 53706, Madison, WI, USA

    Susan Horwitz

  2. Xerox PARC, 3333 Coyote Hill Road, 94304, Palo Alto, CA, USA

    Alan Demers

  3. Department of Computer Science, Cornell University, 405 Upson Hall, 14853, Ithaca, NY, USA

    Tim Teitelbaum

Authors
  1. Susan Horwitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alan Demers
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tim Teitelbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Horwitz, S., Demers, A. & Teitelbaum, T. An efficient general iterative algorithm for dataflow analysis. Acta Informatica 24, 679–694 (1987). https://doi.org/10.1007/BF00282621

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00282621

Keywords

Search

Navigation