A formal approach to code optimization

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

Research output: Contribution to journalArticle

9 Citations (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)
Pages (from-to)86-100
Number of pages15
JournalACM SIGPLAN Notices
Volume5
Issue number7
DOIs
StatePublished - Jul 1 1970
Externally publishedYes

Fingerprint

Costs

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

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

In: ACM SIGPLAN Notices, Vol. 5, No. 7, 01.07.1970, p. 86-100.

Research output: Contribution to journalArticle

Aho, Alfred V. ; Sethi, Ravi ; Ullman, J. D. / A formal approach to code optimization. In: ACM SIGPLAN Notices. 1970 ; Vol. 5, No. 7. pp. 86-100.
@article{ae0071d7c33e41d1a5a5024631bbd746,
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 = "1",
doi = "10.1145/390013.808486",
language = "English (US)",
volume = "5",
pages = "86--100",
journal = "ACM SIGPLAN Notices",
issn = "1523-2867",
publisher = "Association for Computing Machinery (ACM)",
number = "7",

}

TY - JOUR

T1 - A formal approach to code optimization

AU - Aho, Alfred V.

AU - Sethi, Ravi

AU - Ullman, J. D.

PY - 1970/7/1

Y1 - 1970/7/1

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=38049108008&partnerID=8YFLogxK

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

U2 - 10.1145/390013.808486

DO - 10.1145/390013.808486

M3 - Article

AN - SCOPUS:38049108008

VL - 5

SP - 86

EP - 100

JO - ACM SIGPLAN Notices

JF - ACM SIGPLAN Notices

SN - 1523-2867

IS - 7

ER -