On-the-fly garbage collection

DOI10.1145/359642.359655zbMath0386.68024WikidataQ56287067 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

68Q60: Specification and verification (program logics, model checking, etc.)

68N25: Theory of operating systems

Related Items

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