Talks and Poster Presentations (with Proceedings-Entry):
J. Wielemaker, U. Neumerkel:
"Precise Garbage Collection in Prolog";
Talk: Colloquium on Implementation of Constraint and LOgic Programming System,
- 2008-12-13; in: "Proceedings of the 2008 Colloquium on Implementation of Constraint and LOgic Programming Systems",
Paper ID 9,
In this paper we present a series of tiny programs that verify that a Prolog heap garbage collector can ﬁnd speciﬁc forms of garbage.
Only 2 out of our tested 7 Prolog systems pass all tests. Comparing
memory usage on realistic programs dealing with ﬁnite datastructures
using both poor and precise garbage collection shows only a small difference, providing a plausible explanation why many Prolog implementors did not pay much attention to this issue. Attributed variables allow for creating inﬁnite lazy datastructures. We prove that such datastructures have great practical value and their introduction requires `precise´ garbage collection. The Prolog community knows about three techniques to reach at precise garbage collection. We summarise these techniques and provide more details on scanning virtual machine instructions to infer reachability in a case study.
Electronic version of the publication:
Created from the Publication Database of the Vienna University of Technology.