Title: A different look at garbage collection for the WAM
Authors: Demoen, Bart # ×
Issue Date: 2002
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:2401 pages:179-193
Conference: International Conference on Logic Programming location:Copenhagen, Denmark date:July 29 - August 1, 2002
Abstract: A non-algorithmic approach to garbage collection for the WAM heap is
developed. A set of garbage collections compatible with the WAM is
specified in two steps: the first step makes the useful data for
each continuation private and ensures that only useful terms
survive garbage collection. The second step completes garbage
collection by extending the intuitive notion of folding of identical
structures. The role of the
trail in the folding process is crucial and shown for the ordinary
WAM trail as well as for a value-trail. New and unexpected
opportunities for recovering memory are discovered to be compatible
with this view of garbage collection. This leads to better
understanding of the usefulness logic in the WAM, it is a good start
for the formal specification of the garbage collection process and
it shows a potential for new compile time analyses that can improve
run time memory management. Choice point trimming is used as a
vehicle to show selective liveness of data, so its relation to the
more common stack maps is established.
ISBN: 3-540-43930-7
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
chp%3A10.1007%2F3-540-45619-8_13.pdf Published 226KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science