Optimization of very high level languages-I

Authors:
J. T. Schwartz
Affiliations:
Computer Science Department, Courant Institute of Mathematical Sciences, New York University, U.S.A.
Venue:
Computer Languages
Year:
1975

Citing 4
Cited 1

A unified approach to global program optimization

POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Automatic data structure choice in a language of very high level

POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Calculating properties of programs by valuations on specific models

Proceedings of ACM conference on Proving assertions about programs
Global common subexpression elimination

Proceedings of a symposium on Compiler optimization

Control-flow analysis of functional programs

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

SETL is a set-theoretically oriented language of very high level whose repertoire of semantic objects includes finite sets, ordered n-tuples, and sets of ordered n-tuples useable as mappings. This two-part paper studies the optimization problems associated with such a language. The first issue studied is that of copy optimization, i.e. the discovery of cases in which changes to a compound data object can be made 'differentially' without recopying the whole of the object. The second part of the paper sets forth techniques for the automatic discovery of relationships of inclusion and membership on which automatic data-structure choice may be based. The methods used extend known techniques of data-flow analysis and of logical program analysis.