Skip to main content
SpringerLink
Log in
Book cover

Compiler Construction pp 549–602Cite as

Optimization

  • Chapter 5.: Engineering A Compilers
  • Chapter
  • First Online:

  • 2136 Accesses

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aho, A.V., Sethi, R., Ullman, J.D.: A formal approach to code optimization. SIGPLAN Notices 5, 86–100 (July, 1970).

    Google Scholar 

  • Aho, A.V., Ullman, J.D.: The theory of parsing, translation, and compiling. Prentice-Hall 1973.

    Google Scholar 

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

    Google Scholar 

  • Allen, F.E.: A basis for program optimization. Information Processing 71, 385–391, North-Holland 1972.

    Google Scholar 

  • Allen, F.E., Cocke, J.: A catalogue of optimizing transformations. In Rustin, R. (Ed.): Design and Optimization of Compilers. Prentice-Hall 1972.

    Google Scholar 

  • ANSI: FORTRAN. X3.9-1966, American National Standards Institute 1966.

    Google Scholar 

  • Backus, J.W., Heising, W.P.: FORTRAN. IEEE Transactions EC-13, 382–385 (1964).

    Google Scholar 

  • Bagwell, J.T.: Local optimizations. SIGPLAN Notices 5, 52–66 (July, 1970).

    Google Scholar 

  • Bauer, F.L., Samuelson, K.: Comment in ALGOL Bulletin 10 (1961).

    Google Scholar 

  • Beatty, J.C.: Register assignment algorithm for generation of highly optimized object code. IBM J. Res. Develop. 18, 20–39 (1974).

    Google Scholar 

  • Clark, B.L., Horning, J.J.: Reflections on a language designed to write an operating system. ACM SIGPLAN/SIGOPS Interface Meeting, Savannah, 9–12 April 1973.

    Google Scholar 

  • Cocke, J.: Global common subexpression elimination. SIGPLAN Notices 5, 20–24 (July, 1970).

    Google Scholar 

  • Cocke, J., Schwartz, J.T.: Programming languages and their compilers: preliminary notes. New York University 1970.

    Google Scholar 

  • Earnest, C.: Some topics in code optimization. JACM 21, 76–102 (1974).

    Google Scholar 

  • Forsythe, A.I., Keenan, T.A., Organick, E.I., Stenberg, W.: Computer science: a first course. John Wiley 1969.

    Google Scholar 

  • Frailey, D.J.: Expression optimization using unary complement operators. SIGPLAN Notices 5, 67–85 (July, 1970).

    Google Scholar 

  • GE: GE-400 Series Basic Language. CPB-1470 (1968).

    Google Scholar 

  • Gear, C.W.: High speed compilation of efficient object code. CACM 8, 483–488 (1965).

    Google Scholar 

  • Gries, D.: Compiler Construction for Digital Computers. John Wiley, 1967.

    Google Scholar 

  • Hall, A.D.: Private Communication 1974.

    Google Scholar 

  • Hext, J.B.: Programming Languages and Compiling Techniques. Ph.D. Dissertation, University of Cambridge 1965.

    Google Scholar 

  • Hopcroft, J., Tarjan, R.: Efficient algorithms for graph manipulation. CACM 16, 372–378 (1973).

    Google Scholar 

  • IBM Corp.: IBM system/360 operating system FORTRAN IV (H) compiler program logic manual. Y28-6642-3 (1968).

    Google Scholar 

  • Kildall, G.A.: Global expression optimization during compilation. Ph.D. Thesis, University of Washington 1972.

    Google Scholar 

  • Knuth, D.E.: The Art of Computer Programming, Vol. 2: Seminumerical Algorithms. Addison Wesley 1969.

    Google Scholar 

  • Knuth, D.E.: An empirical study of FORTRAN programs. Software — Practice and Experience 1, 105–133 (1971).

    Google Scholar 

  • Lee, J.A.N.: A formal definition of the BASIC language. Computer J. 15, 37–41 (1972).

    Google Scholar 

  • Lowry, E.S., Medlock, C.W.: Object code optimization. CACM 12, 13–22 (1969).

    Google Scholar 

  • McKeeman, W.M.: Peephole optimization. CACM 8, 443–444 (1965).

    Google Scholar 

  • Rohl, J.S., Linn, J.A.: A note on compiling arithmetic expressions. Computer J. 15, 13–14 (1972).

    Google Scholar 

  • Sethi, R., Ullman, J.D.: The generation of optimal code for arithmetic expressions. JACM 17, 715–728 (1970).

    Google Scholar 

  • Sheridan, P.B.: The FORTRAN arithmetic-compiler of the IBM FORTRAN automatic coding system. CACM 2, 9-(1959).

    Google Scholar 

  • Spillman, T.C.: Exposing side-effects in a PL/I optimizing compiler. Information Processing 71, 376–381, North-Holland 1972.

    Google Scholar 

  • Ullman, J.D.: Fast algorithms for the elimination of common subexpressions. Acta Informatica 2, 191–213 (1973).

    Google Scholar 

  • Wilcox, T.R.: Generating Machine Code for High-Level Programming Languages. Ph.D. Thesis, Cornell University 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Colorado, Boulder, Colorado, USA

    W. M. Waite

Authors
  1. W. M. Waite
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

F. L. Brauer J. Eickel F. L. De Remer M. Griffiths U. Hill J. J. Horning C. H. A. Koster W. M. McKeeman P. C. Poole W. M. Waite

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Waite, W.M. (1976). Optimization. In: Brauer, F.L., et al. Compiler Construction. Lecture Notes in Computer Science, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3540069585_65

Download citation

  • DOI: https://doi.org/10.1007/3540069585_65

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06958-4

  • Online ISBN: 978-3-540-37263-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation