Skip to main content
SpringerLink
Log in

A denotational framework for data flow analysis

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

It is shown how to express data flow analysis in a denotational framework by means of abstract interpretation. A continuation style formulation naturally leads to the MOP (Meet Over all Paths) solution, whereas a direct style formulation leads to the MFP (Maximal Fixed Point) solution.

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.V., Ullman, J.D.: Principles of Compiler Design. London: Addison-Wesley, 1977

    Google Scholar 

  2. Cousot, P., Cousot, R.: Abstract Interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. Proc. 4th ACM Symp. Principles Progr. Lang. 238–252 (1977)

  3. Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. Proc. 6th ACM Symp. Principles Progr. Lang. 269–282 (1979)

  4. Donzeau-Gouge, V.: Utilisation de la semantique denotationelle pour l'étude d'interpretations non-standard. Report no. 273, INRIA, France, 1978

    Google Scholar 

  5. Donzeau-Gouge, V.: Denotational definition of properties of program computations. In: Program Flow Analysis: Theory and Applications. Muchnick, S.S., Jones, N.D. (eds.). New Jersey: Prentice-Hall, pp. 343–379, 1981

    Google Scholar 

  6. Gordon, M.J.C.: The Denotational Description of Programming Languages: An Introduction. Berlin, Heidelberg, New York: Springer, 1979

    Google Scholar 

  7. Hecht, M.S.: Flow Analysis of Computer Programs. North-Holland, New York, 1977

    Google Scholar 

  8. Kam, J.B., Ullman, J.D.: Monotone data flow analysis frameworks. Acta Informat. 7, 305–317 (1977)

    CAS  Google Scholar 

  9. Milner, R.: Program semantics and mechanized proof. In: Foundations of Computer Science II. K.R. Apt, and J.W. de Bakker, (eds.). Amsterdam: Mathematical Centre Tracts 82, pp. 3–44, 1976

  10. Milne, R., Strachey, C: A Theory of Programming Language Semantics. London: Chapman and Hall, 1976

    Google Scholar 

  11. Nielson, F.: Semantic foundations of data flow analysis. M. Sc. Thesis, Report no. PB-131. Denmark: Aarhus University, 1981

    Google Scholar 

  12. Nielson, F.: Program transformations in a denotational setting. Report no. PB-140. Denmark: Aarhus University, 1981

    Google Scholar 

  13. Rosen, B.K.: Monoids for rapid data flow analysis. SIAM J. Comput. 9, 159–196 (1980)

    Google Scholar 

  14. Stoy, J.E.: Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. Cambridge: MIT Press, MA, 1977

    Google Scholar 

  15. Ullman, J.D.: A survey of data flow analysis techniques. 2nd USA-Japan Comput. Conf. pp. 335–342, 1975

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, James Clerk Maxwell Building, The King's Buildings Mayfield Road, EH9 3JZ, Edinburgh, GB

    Flemming Nielson

Authors
  1. Flemming Nielson
    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

Nielson, F. A denotational framework for data flow analysis. Acta Informatica 18, 265–287 (1982). https://doi.org/10.1007/BF00263194

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation