An efficient machine-independent procedure for garbage collection in various list structures
From MaRDI portal
Publication:5528168
DOI10.1145/363534.363554zbMath0149.12608OpenAlexW2071455557MaRDI QIDQ5528168
Publication date: 1967
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/363534.363554
Related Items
Efficient pebbling for list traversal synopses with application to program rollback ⋮ Data structure and storage allocation ⋮ The Schorr-Waite graph marking algorithm ⋮ The rewriting logic semantics project: a progress report ⋮ Evalquote in simple Fortran: A tutorial on interpreting Lisp ⋮ The Schorr-Waite marking algorithm revisited ⋮ Implementing the ALGOL 68 heap ⋮ Invariant diagrams with data refinement ⋮ A Needed Rewriting Strategy for Data-Structures with Pointers ⋮ Data Refinement of Invariant Based Programs ⋮ Formal study of functional orbits in finite domains ⋮ Verification of the Schorr-Waite Algorithm – From Trees to Graphs ⋮ A bounded-space tree traversal algorithm ⋮ fsh—A functional unix command interpreter ⋮ Stack and locally finite transformations on structures with reversible transitions ⋮ Proving pointer programs in higher-order logic ⋮ Output driven interpretation of recursive programs, or writing creates and destroys data structures ⋮ The correctness of the Schorr-Waite list marking algorithm ⋮ Juggrnaut: using graph grammars for abstracting unbounded heap structures ⋮ Time required for garbage collection in retention block-structured languages ⋮ A term-graph clausal logic: completeness and incompleteness results ★ ⋮ Loop-free algorithms for traversing binary trees ⋮ New dimensions in heap profiling
