Better Static Memory Management: Improving Region-Based Analysis of Higher-Order Languages (1995)
Cached
Download Links
- [research.microsoft.com]
- [www.cs.berkeley.edu]
- [research.microsoft.com]
- DBLP
Other Repositories/Bibliography
| Venue: | In ACM Conference on Programming Language Design and Implementation |
| Citations: | 89 - 6 self |
BibTeX
@INPROCEEDINGS{Aiken95betterstatic,
author = {Alexander Aiken and Manuel Fähndrich and Raph Levien},
title = {Better Static Memory Management: Improving Region-Based Analysis of Higher-Order Languages},
booktitle = {In ACM Conference on Programming Language Design and Implementation},
year = {1995},
pages = {174--185},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Static memory management replaces runtime garbage collection with compile-time annotations that make all memory allocation and deallocation explicit in a program. We improve upon the Tofte/Talpin region-based scheme for compile-time memory management [TT94]. In the Tofte/Talpin approach, all values, including closures, are stored in regions. Region lifetimes coincide with lexical scope, thus forming a runtime stack of regions and eliminating the need for garbage collection. We relax the requirement that region lifetimes be lexical. Rather, regions are allocated late and deallocated as early as possible by explicit memory operations. The placement of allocation and deallocation annotations is determined by solving a system of constraints that expresses all possible annotations. Experiments show that our approach reduces memory requirements significantly, in some cases asymptotically. 1 Introduction In a recent paper, Tofte and Talpin propose a novel method for memory management in type...
Citations
No citations identified.
