Abstract Models of Memory Management

DSpace/Manakin Repository

Abstract Models of Memory Management

Citable link to this page

. . . . . .

Title: Abstract Models of Memory Management
Author: Harper, Robert; Felleisen, Matthias; Morrisett, John Gregory

Note: Order does not necessarily reflect citation order of authors.

Citation: Morrisett, Greg, Matthias Felleisen, and Robert Harper. Abstract models of memory management. In Conference record of FPCA '95 SIGPLAN-SIGARCH-WG2.8 Conference on Functional Programming Languages and Computer Architecture : Papers presented at the Conference, La Jolla, California, June 25-28, 1995, Ed. ICFPLCA, 66-77. New York: ACM Press.
Full Text & Related Files:
Abstract: Most specifications of garbage collectors concentrate on the low-level algorithmic details of how to find and preserve accessible objects. Often, they focus on bit-level manipulations such as "scanning stack frames," "marking objects," "tagging data," etc. While these details are important in some contexts, they often obscure the more fundamental aspects of memory management: what objects are garbage and why? We develop a series of calculi that are just low-level enough that we can express allocation and garbage collection, yet are sufficiently abstract that we many formally prove the correctness of various memory management strategies. By making the heap of a program syntactically apparent, we can specify memory actions as rewriting rules that allocate values on the heap and automatically dereference pointers to such objects when needed. this formulation permits the specification of garbage collection as a relation that removes portions of the heap without affecting the outcome of the evaluation. Our high-level approach allows us to specify in a compact manner a wide variety of memory management techniques, including standard trace-based garbage collection (i.e., the family of copying and mark/sweep collection algorithms), generational collection, and type-based, tag-free collection. Furthermore, since the definition of garbage is based on the semantics of the underlying language instead of the conservative approximation of inaccessibility, we are able to specify and prove the idea that type inference can be used to collect some objects that are accessible but never used.
Published Version: http://doi.acm.org/10.1145/224164.224182
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:3293156

Show full Dublin Core record

This item appears in the following Collection(s)

  • FAS Scholarly Articles [7362]
    Peer reviewed scholarly articles from the Faculty of Arts and Sciences of Harvard University
 
 

Search DASH


Advanced Search
 
 

Submitters