Implications of structured programming for machine architecture
Communications of the ACM
A program data flow analysis procedure
Communications of the ACM
Recursion analysis for compiler optimization
Communications of the ACM
Program development by stepwise refinement
Communications of the ACM
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
ASPLOS I Proceedings of the first international symposium on Architectural support for programming languages and operating systems
RISC I: A Reduced Instruction Set VLSI Computer
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
A theoretical study of some aspects of parameter passing in algol60 and in similar programming languages.
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Safety consideration for storage allocation optimizations
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
A simple interprocedural register allocation algorithm and its effectiveness for LISP
ACM Transactions on Programming Languages and Systems (TOPLAS)
An improved storage management scheme for block structured languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
The implementation of PC Scheme
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
The efficiency of storage management schemes for Ada programs
SIGAda '85 Proceedings of the 1985 annual ACM SIGAda international conference on Ada
The efficiency of storage management schemes for Ada programs
ACM SIGPLAN Notices
| Hi-index | 0.00 |
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.