Garbage collection in an uncooperative environment
Software—Practice & Experience
Experiences creating a portable cedar
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Guardians in a generation-based garbage collector
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
A real-time garbage collector based on the lifetimes of objects
Communications of the ACM
An efficient, incremental, automatic garbage collector
Communications of the ACM
A LISP garbage-collector for virtual-memory computer systems
Communications of the ACM
A method for overlapping and erasure of lists
Communications of the ACM
Revised report on the algorithmic language scheme
ACM SIGPLAN Lisp Pointers
The Java Language Specification
The Java Language Specification
Uniprocessor Garbage Collection Techniques
IWMM '92 Proceedings of the International Workshop on Memory Management
Finalization in the Collector Interface
IWMM '92 Proceedings of the International Workshop on Memory Management
Formal semantics of weak references
Proceedings of the 5th international symposium on Memory management
Collecting hollywood's garbage: avoiding space-leaks in composite events
Proceedings of the 2010 international symposium on Memory management
Trustworthy proxies: virtualizing objects with invariants
ECOOP'13 Proceedings of the 27th European conference on Object-Oriented Programming
| Hi-index | 0.00 |
Finalization occurs when a garbage collector informs an application that an object is "almost collectable." It is used to help an application maintain its invariants. To make finalization more useful, this paper defines "almost collectable" in terms of a new class of objects, called ephemerons. Ephemerons are similar to weak pairs, but an object in an ephemeron's key field may be classed as "almost collectable" even if it is reachable from the epehemeron's value fields.