Theoretical Computer Science
Compile-time garbage collection by sharing analysis
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Lively linear Lisp: “look ma, no garbage!”
ACM SIGPLAN Notices
Stop-and-copy and one-bit reference counting
Information Processing Letters
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Static and dynamic partitioning of pointers as links and threads
Proceedings of the first ACM SIGPLAN international conference on Functional programming
LogP: a practical model of parallel computation
Communications of the ACM
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Research Demonstration of a Hardware Reference-Counting Heap
Lisp and Symbolic Computation
Variations on strictness analysis
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
Analysis of pointer “rotation”
Communications of the ACM
Shifting garbage collection overhead to compile time
Communications of the ACM
An exercise in proving parallel programs correct
Communications of the ACM
An efficient, incremental, automatic garbage collector
Communications of the ACM
Symbol manipulation by threaded lists
Communications of the ACM
A method for overlapping and erasure of lists
Communications of the ACM
Communications of the ACM
Data Structures and Their Algorithms
Data Structures and Their Algorithms
Functional Programming and Parallel Graph Rewriting
Functional Programming and Parallel Graph Rewriting
Uniprocessor Garbage Collection Techniques
IWMM '92 Proceedings of the International Workshop on Memory Management
Some practical methods for rapid combinator reduction
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
An on-the-fly reference counting garbage collector for Java
OOPSLA '01 Proceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
The space cost of lazy reference counting
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 4th international symposium on Memory management
An energy efficient garbage collector for java embedded devices
LCTES '05 Proceedings of the 2005 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
On designing a low-power garbage collector for java embedded devices: a case study
Proceedings of the 2005 ACM symposium on Applied computing
An on-the-fly reference-counting garbage collector for java
ACM Transactions on Programming Languages and Systems (TOPLAS)
Clustering the heap in multi-threaded applications for improved garbage collection
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Integrating generations with advanced reference counting garbage collectors
CC'03 Proceedings of the 12th international conference on Compiler construction
Derivation and evaluation of concurrent collectors
ECOOP'05 Proceedings of the 19th European conference on Object-Oriented Programming
Hi-index | 0.00 |
Stoye's one-bit reference tagging scheme can be extended to local counts of two or more via two strategies. The first, suited to pure register transactions, is a cache of referents to two shared references. The analog of Deutsch's and Bobrow's multiple-reference table, this cache is sufficient to manage small counts across successive assignment statements. Thus, accurate reference counts above one can be tracked for short intervals, like those bridging one function's environment to its successor's.The second, motivated by runtime stacks that duplicate references, avoids counting any references from the stack. It requires a local pointer-inversion protocol in the mutator, but one still local to the referent and the stack frame. Thus, an accurate reference count of one can be maintained regardless of references from the recursion stack.