Programmed deallocation without dangling reference

DOI10.1016/0020-0190(84)90108-XzbMATH Open0541.68007OpenAlexW2044642242MaRDI QIDQ794425FDOQ794425

Authors: Gianna Cioni, Antoni Kreczmar 

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90108-x

Recommendations

• An efficient reference counting solution to the distributed garbage collection problem
• Typing Safe Deallocation
• Region-based memory management
• Avoid a void: The eradication of null dereferencing
• Lock-free reference counting

zbMATH Keywords

parallelismdynamic programming languagesprogrammed deallocationrun-time systems

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25)

Cites Work

• Title not available (Why is that?)
• Multiprocessing compactifying garbage collection
• The programming language Pascal
• CLU reference manual
• Title not available (Why is that?)
• Referencing and Retention in Block-Structured Coroutines
• Time required for garbage collection in retention block-structured languages

This page was built for publication: Programmed deallocation without dangling reference

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