A less dynamic memory allocation scheme for algol-like languages

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A less dynamic memory allocation scheme for algol-like languages

Full text

Pdf (498 KB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages table of contents

Salt Lake City, Utah, United States

Pages: 283 - 289

Year of Publication: 1984

ISBN:0-89791-125-3

Author

Thomas P. Murtagh

Department of Computer Sciences, Purdue University, West Lafayette, IN

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGADA: ACM Special Interest Group on Ada Programming Language
SIGAPL: ACM Special Interest Group on APL Programming Language

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 18, Citation Count: 6

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/800017.800540 What is a DOI?

ABSTRACT

The conventional storage allocation scheme for block structured languages requires the allocation of stack space and the building of a display with each procedure call. This paper describes a technique for analyzing the call graph of a program in a block structured language that makes it possible to eliminate these operations from many call sequences, even in the presence of recursion.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Alfred V. Aho , Jeffrey D. Ullman, The Theory of Parsing, Translation, and Compiling, Prentice Hall Professional Technical Reference, 1972
	2	Alfred V. Aho , Jeffrey D. Ullman, Principles of Compiler Design (Addison-Wesley series in computer science and information processing), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1977
	3	F. E. Allen , J. Cocke, A program data flow analysis procedure, Communications of the ACM, v.19 n.3, p.137, March 1976 [doi>10.1145/360018.360025]
	4	Dijkstra, E.W., "Notes on Structured Programming," in Structured Programming, O-j. Dahl, E.W. Dijkstra, and C.A.R. Hoare,, Academic Press (1972).
	5	Butler W. Lampson, Fast procedure calls, Proceedings of the first international symposium on Architectural support for programming languages and operating systems, p.66-76, March 01-03, 1982, Palo Alto, California, United States
	6	David A. Patterson , Carlo H. Sequin, RISC I: A Reduced Instruction Set VLSI Computer, Proceedings of the 8th annual symposium on Computer Architecture, p.443-457, May 12-14, 1981, Minneapolis, Minnesota, United States
	7	Andrew S. Tanenbaum, Implications of structured programming for machine architecture, Communications of the ACM, v.21 n.3, p.237-246, March 1978 [doi>10.1145/359361.359454]
	8	Kenneth G. Walter, Recursion analysis for compiler optimization, Communications of the ACM, v.19 n.9, p.514-516, Sept. 1976 [doi>10.1145/360336.360341]
	9	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 [doi>10.1145/567446.567455]
	10	Karl Andreas Winklmann, A theoretical study of some aspects of parameter passing in algol60 and in similar programming languages., 1977
	11	Niklaus Wirth, Program development by stepwise refinement, Communications of the ACM, v.14 n.4, p.221-227, April 1971 [doi>10.1145/362575.362577]

CITED BY 6

	D. R. Chase, Safety consideration for storage allocation optimizations, ACM SIGPLAN Notices, v.23 n.7, p.1-10, July 1988
	Peter A. Steenkiste , John L. Hennessy, A simple interprocedural register allocation algorithm and its effectiveness for LISP, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.1, p.1-32, Jan. 1989
	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
	Rajiv Gupta , Mary Lou Soffa, The efficiency of storage management schemes for Ada programs, ACM SIGAda Ada Letters, v.V n.2, p.164-172, Sep., Oct. 1985
	Rajiv Gupta , Mary Lou Soffa, The efficiency of storage management schemes for Ada programs, ACM SIGPLAN Notices, v.20 n.11, November 1985
	David H. Bartley , John C. Jensen, The implementation of PC Scheme, Proceedings of the 1986 ACM conference on LISP and functional programming, p.86-93, August 1986, Cambridge, Massachusetts, United States