ACM Home Page
Please provide us with feedback. Feedback
Making the world safe for garbage collection
Full text PdfPdf (967 KB)
Source Annual Symposium on Principles of Programming Languages archive
Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents
Williamsburg, Virginia
Pages: 77 - 86  
Year of Publication: 1981
ISBN:0-89791-029-X
Author
Susan Owicki  Stanford University
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 15,   Citation Count: 4
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/567532.567539
What is a DOI?

ABSTRACT

This paper describes the formal specifications of garbage collection in the programming language Cedar Mesa. They were developed as part of the process of identifying a safe subset of Mesa for which garbage collection was possible. The purpose of the specifications was to provide a precise definition of safety, along with criteria for checking the safety of proposed language features. Thus the specifications had to characterize the "invisibility" of the collector, as well as describe the services it provides. A beneficial effect of the specification effort was that the process of constructing the specifications led to a number of discoveries that improved the quality of the language.


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
J. G. Mitchell et al., Mesa Language Manual, Report CSL-79-3, Xerox Palo Alto Research Center, April, 1979.
2
3
 
4
H. Bekic and K. Walk, "On formalization of storage properties," in E. Engeler, editor, Semantics of Algorithmic Languages, Springer Verlag Lecture Notes in Mathematics, vol 188, 1971.
 
5
K. Walk, "Modelling of storage properties of higher-level languages," International Journal of Computer and Information Sciences, 2:1 (March 1973) pp 1-24.
6
7
8