The space cost of lazy reference counting

DOI10.1145/964001.964019zbMATH Open1325.68042OpenAlexW2091789752MaRDI QIDQ3452261FDOQ3452261

Authors: Hans-J. Boehm 

Publication date: 11 November 2015

Published in: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

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

Recommendations

• Cyclic reference counting with lazy mark-scan
• Verifying Reference Counting Implementations
• Cyclic reference counting
• scientific article; zbMATH DE number 1728241
• scientific article; zbMATH DE number 2017352

zbMATH Keywords

space complexitymemory allocationgarbage collectionreference counting

Mathematics Subject Classification ID

Theory of programming languages (68N15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (4)

• Stop-and-copy and one-bit reference counting
• Cyclic reference counting
• Quantifying and evaluating the space overhead for alternative C++ memory layouts
• Reference count analysis with shallow aliasing

This page was built for publication: The space cost of lazy reference counting

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