On-the-fly garbage collection

DOI10.1145/359642.359655zbMath0386.68024OpenAlexW2158525816WikidataQ56287067 ScholiaQ56287067MaRDI QIDQ4167545

No author found.

Publication date: 1978

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

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Related Items (21)

A mechanically verified incremental garbage collector ⋮ Schedulable garbage collection in CLI virtual execution system ⋮ An incremental garbage collection algorithm for multi-mutator systems ⋮ Superposition refinement of reactive systems ⋮ Scheduling of hard real-time garbage collection ⋮ Verifying a concurrent garbage collector using a rely-guarantee methodology ⋮ Relaxed avl trees, main-memory databases and concurrency ⋮ Lock-free reference counting ⋮ Skip trees, an alternative data structure to skip lists in a concurrent approach ⋮ On-the-fly garbage collection for several mutators ⋮ Stop-and-copy and one-bit reference counting ⋮ fsh—A functional unix command interpreter ⋮ A verified generational garbage collector for CakeML ⋮ A verified generational garbage collector for CakeML ⋮ Simple concurrent garbage collection almost without synchronization ⋮ Global garbage collection for distributed heap storage systems ⋮ Fine-grained concurrency with separation logic ⋮ Verifying a concurrent garbage collector with a rely-guarantee methodology ⋮ A formal model of atomicity in asynchronous systems ⋮ The lifeness property of on-the-fly garbage collector - a proof ⋮ Real-time MLton: A Standard ML runtime for real-time functional programs

This page was built for publication: On-the-fly garbage collection