Lifetime analysis of dynamically allocated objects
Cristina Ruggieri, ThomasP. Murtagh · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 1988
The choice of binding time disciplines has major consequences for both the run-time efficiency of programs and the convenience of the language expressing algorithms. Late storage binding time, dynamic allocation, provides the flexibility necessary to implement the complex data structures common in today's object oriented style of programming. In this paper we show that compile-time lifetime analysis can be applied to programs written in languages with static type systems and dynamically allocated objects, to provide earlier storage binding time for objects, while maintaining all the advantages of dynamic allocation.
Cited by 114 works. doi:10.1145/73560.73585 Open-access PDF
Authors
References
- Abstract interpretation
- Abstraction mechanisms in CLU
- A unified approach to global program optimization
- A real-time garbage collector based on the lifetimes of objects
- Finding Dominators in Directed Graphs
- A practical interprocedural data flow analysis algorithm
- An efficient way to find the side effects of procedure calls and the aliases of variables
- Interprocedural Data Flow Analysis.
- A precise inter-procedural data flow algorithm
- Monotone data flow analysis frameworks