Skip to main content
SpringerLink
Log in

A method for determining program data relationships

  • Conference paper
  • First Online:
International Symposium on Theoretical Programming

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 5))

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allen, F.E. and J. Cocke, "Graph Theoretic Constructs for Program Control Flow Analysis", IBM Research Report RC 3923, July, 1972.

    Google Scholar 

  2. Allen, F. E., "A Basis for Program Optimization", Proceedings of the IFIPS Congress 71, North Holland Publishing Co., Amsterdam, Holland.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Thomas J. Watson Research Center, Yorktown Heights, New York

    F. E. Allen

Authors
  1. F. E. Allen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrei Ershov Valery A. Nepomniaschy

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Allen, F.E. (1974). A method for determining program data relationships. In: Ershov, A., Nepomniaschy, V. (eds) International Symposium on Theoretical Programming. Lecture Notes in Computer Science, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-06720-5_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-06720-5_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06720-7

  • Online ISBN: 978-3-540-38012-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation