Sciweavers

19 search results - page 1 / 4
» Local reasoning about a copying garbage collector
Sort
View
POPL
2004
ACM
14 years 5 months ago
Local reasoning about a copying garbage collector
Lars Birkedal, Noah Torp-Smith, John C. Reynolds
POPL
2009
ACM
14 years 6 months ago
Automated verification of practical garbage collectors
Garbage collectors are notoriously hard to verify, due to their lowlevel interaction with the underlying system and the general difficulty in reasoning about reachability in graph...
Chris Hawblitzel, Erez Petrank
OOPSLA
2004
Springer
13 years 10 months ago
The garbage collection advantage: improving program locality
As improvements in processor speed continue to outpace improvements in cache and memory speed, poor locality increasingly degrades performance. Because copying garbage collectors ...
Xianglong Huang, Stephen M. Blackburn, Kathryn S. ...
SIGMETRICS
2004
ACM
103views Hardware» more  SIGMETRICS 2004»
13 years 10 months ago
Myths and realities: the performance impact of garbage collection
This paper explores and quantifies garbage collection behavior for three whole heap collectors and generational counterparts: copying semi-space, mark-sweep, and reference counti...
Stephen M. Blackburn, Perry Cheng, Kathryn S. McKi...
CC
2001
Springer
121views System Software» more  CC 2001»
13 years 9 months ago
Constant-Time Root Scanning for Deterministic Garbage Collection
Root scanning is the task of identifying references to heap objects that are stored outside of the heap itself, in global and local variables and on the execution stack. Root scann...
Fridtjof Siebert