A formal approach to code optimization

Alfred V. Aho, Ravi Sethi, J. D. Ullman

Research output: Contribution to conferencePaper

1 Citation (Scopus)

Abstract

We examine from a formal point of view some problems which arise in code optimization and present some of the results which can come from such an approach. Specifically, a set of transformations which characterize optimization algorithms for straight line code is presented. Then we present an algorithm which produces machine code for evaluating arithmetic expressions on machines with N > 1 general purpose registers. We can prove that this algorithm produces optimal code when the cost criterion is the length of machine code generated.

Original languageEnglish (US)
Pages86-100
Number of pages15
DOIs
StatePublished - Jul 27 1970
Externally publishedYes
Event1970 Symposium on Compiler Optimization - Urbana-Champaign, United States
Duration: Jul 27 1970Jul 28 1970

Other

Other1970 Symposium on Compiler Optimization
CountryUnited States
CityUrbana-Champaign
Period7/27/707/28/70

Fingerprint

Costs

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Aho, A. V., Sethi, R., & Ullman, J. D. (1970). A formal approach to code optimization. 86-100. Paper presented at 1970 Symposium on Compiler Optimization, Urbana-Champaign, United States. https://doi.org/10.1145/800028.808486

A formal approach to code optimization. / Aho, Alfred V.; Sethi, Ravi; Ullman, J. D.

1970. 86-100 Paper presented at 1970 Symposium on Compiler Optimization, Urbana-Champaign, United States.

Research output: Contribution to conferencePaper

Aho, AV, Sethi, R & Ullman, JD 1970, 'A formal approach to code optimization', Paper presented at 1970 Symposium on Compiler Optimization, Urbana-Champaign, United States, 7/27/70 - 7/28/70 pp. 86-100. https://doi.org/10.1145/800028.808486
Aho AV, Sethi R, Ullman JD. A formal approach to code optimization. 1970. Paper presented at 1970 Symposium on Compiler Optimization, Urbana-Champaign, United States. https://doi.org/10.1145/800028.808486
Aho, Alfred V. ; Sethi, Ravi ; Ullman, J. D. / A formal approach to code optimization. Paper presented at 1970 Symposium on Compiler Optimization, Urbana-Champaign, United States.15 p.
@conference{6d6aba0e1e73453cb52f1a1899a3fc80,
title = "A formal approach to code optimization",
abstract = "We examine from a formal point of view some problems which arise in code optimization and present some of the results which can come from such an approach. Specifically, a set of transformations which characterize optimization algorithms for straight line code is presented. Then we present an algorithm which produces machine code for evaluating arithmetic expressions on machines with N > 1 general purpose registers. We can prove that this algorithm produces optimal code when the cost criterion is the length of machine code generated.",
author = "Aho, {Alfred V.} and Ravi Sethi and Ullman, {J. D.}",
year = "1970",
month = "7",
day = "27",
doi = "10.1145/800028.808486",
language = "English (US)",
pages = "86--100",
note = "1970 Symposium on Compiler Optimization ; Conference date: 27-07-1970 Through 28-07-1970",

}

TY - CONF

T1 - A formal approach to code optimization

AU - Aho, Alfred V.

AU - Sethi, Ravi

AU - Ullman, J. D.

PY - 1970/7/27

Y1 - 1970/7/27

N2 - We examine from a formal point of view some problems which arise in code optimization and present some of the results which can come from such an approach. Specifically, a set of transformations which characterize optimization algorithms for straight line code is presented. Then we present an algorithm which produces machine code for evaluating arithmetic expressions on machines with N > 1 general purpose registers. We can prove that this algorithm produces optimal code when the cost criterion is the length of machine code generated.

AB - We examine from a formal point of view some problems which arise in code optimization and present some of the results which can come from such an approach. Specifically, a set of transformations which characterize optimization algorithms for straight line code is presented. Then we present an algorithm which produces machine code for evaluating arithmetic expressions on machines with N > 1 general purpose registers. We can prove that this algorithm produces optimal code when the cost criterion is the length of machine code generated.

UR - http://www.scopus.com/inward/record.url?scp=85059739058&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85059739058&partnerID=8YFLogxK

U2 - 10.1145/800028.808486

DO - 10.1145/800028.808486

M3 - Paper

AN - SCOPUS:85059739058

SP - 86

EP - 100

ER -