An efficient, incremental, automatic garbage collector

DOI10.1145/360336.360345zbMath0329.68033OpenAlexW2130376240MaRDI QIDQ4095858

Daniel G. Bobrow, L. Peter Deutsch

Publication date: 1976

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/360336.360345

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (5)

GC\(^{2}\): a generational conservative garbage collector for the ATERM library ⋮ Static analysis for optimizing reference counting ⋮ An efficient approach to cyclic reference counting based on a coarse-grained search ⋮ Reference counting as a computational interpretation of linear logic ⋮ Optimal real-time garbage collection for acyclic pointer structures

This page was built for publication: An efficient, incremental, automatic garbage collector