Uniprocessor Garbage Collection Techniques.¶
Wilson, P. R. (1992). Uniprocessor Garbage Collection Techniques. Memory Management (IWMM '92).
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Garbage Collection
- Recognizing a problem as garbage collection unlocks a portable reasoning kit. Root identification comes first: whatever ambiguity exists in "what is garbage?" is concentrated in this single question. Reachability is transitive: if A is reachable and A points to B, then B is reachable — the same closure operation across all substrates, making the collector's correctness a fixed-point computation. Mark-and-sweep versus reference counting is a domain-independent design choice: tracing handles cycles but pauses; counting is incremental but cannot collect cycles unaided, and the same trade-off appears in legal claims, library curation, and organizational deprecation.
This sourceSurvey contrasting tracing (handles cycles, pauses) with reference counting (incremental, cannot collect cycles unaided).
Supported in partVerified against the publisher's abstract
Wilson's survey abstract names reference counting and mark-sweep and notes incremental collection shortens pauses, but never states cycle-collection limits or the cross-domain trade-off.
“We survey basic garbage collection algorithms, and variations such as incremental and generational collection. The basic algorithms include reference counting, mark-sweep, mark-compact, copying, and treadmill collection. Incremental techniques can keep garbage collection pause times short, by interleaving small amounts of collection work with program execution.”
- Recognizing a problem as garbage collection unlocks a portable reasoning kit. Root identification comes first: whatever ambiguity exists in "what is garbage?" is concentrated in this single question. Reachability is transitive: if A is reachable and A points to B, then B is reachable — the same closure operation across all substrates, making the collector's correctness a fixed-point computation. Mark-and-sweep versus reference counting is a domain-independent design choice: tracing handles cycles but pauses; counting is incremental but cannot collect cycles unaided, and the same trade-off appears in legal claims, library curation, and organizational deprecation.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:869c79499c2b · see in the full table