An efficient, incremental, automatic garbage collector

DOI10.1145/360336.360345MaRDI QIDQ4095858zbMATH OpenOpenAlexFDO

Authors L. Peter Deutsch, Daniel G. Bobrow

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

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

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4095858)