ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Recursion analysis for compiler optimization
Full text PdfPdf (218 KB)
Source
Communications of the ACM archive
Volume 19 ,  Issue 9  (September 1976) table of contents
Pages: 514 - 516  
Year of Publication: 1976
ISSN:0001-0782
Author
Kenneth G. Walter  Case Western Reserve Univ., Cleveland, OH
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 30,   Citation Count: 6
Additional Information:

abstract   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/360336.360341
What is a DOI?

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.


CITED BY  6
Kenneth G. Walter, Technical correspondance: a note on recursion analysis, Communications of the ACM, v.21 n.3, p.247, March 1978
Mary W. Hall , Ken Kennedy, Efficient call graph analysis, ACM Letters on Programming Languages and Systems (LOPLAS), v.1 n.3, p.227-242, Sept. 1992
Owen Kaser , C. R. Ramakrishnan , Shaunak Pawagi, On the conversion of indirect to direct recursion, ACM Letters on Programming Languages and Systems (LOPLAS), v.2 n.1-4, p.151-164, March–Dec. 1993
Thomas P. Murtagh, An improved storage management scheme for block structured languages, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.3, p.372-398, July 1991
William E. Weihl, Interprocedural data flow analysis in the presence of pointers, procedure variables, and label variables, Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.83-94, January 28-30, 1980, Las Vegas, Nevada
Thomas P. Murtagh, A less dynamic memory allocation scheme for algol-like languages, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.283-289, January 15-18, 1984, Salt Lake City, Utah, United States

INDEX TERMS

Keywords:
compiler optimization, recursion

Collaborative Colleagues:
Kenneth G. Walter: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player