Recursion analysis for compiler optimization

Authors:
Kenneth G. Walter
Affiliations:
Case Western Reserve Univ., Cleveland, OH
Venue:
Communications of the ACM
Year:
1976

Citing 0
Cited 7

An improved storage management scheme for block structured languages

ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient call graph analysis

ACM Letters on Programming Languages and Systems (LOPLAS)
On the conversion of indirect to direct recursion

ACM Letters on Programming Languages and Systems (LOPLAS)
Technical correspondance: a note on recursion analysis

Communications of the ACM
Interprocedural data flow analysis in the presence of pointers, procedure variables, and label variables

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A less dynamic memory allocation scheme for algol-like languages

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Optimal interprocedural program optimization: a new framework and its application

Optimal interprocedural program optimization: a new framework and its application

Quantified Score

Hi-index	48.23

Visualization

Abstract

A relatively simple method for the detection of recursive use of procedures is presented for use in compiler optimization. Implementation considerations are discussed, and a modification of the algorithm is given to further improve optimization. This analysis can also be used to determine what possible subset of values could be assumed by variables which can only take on a relatively small discrete set of values. The most common are parameters of variables assuming values of label, procedure, or Pascal's enumerated type.