CoqUn2010- The document discusses garbage collection (GC) in Coq, including defining GC as a function that takes an initial and final memory state (m1 and m2) and exists an intermediate state (m) where the mark phase is applied to m1 and m and the sweep phase is applied from m to m2. - Safety properties are defined for memory states including disjointness of free and closed elements, and lemmas are proved
{{#tags}}- {{label}}
{{/tags}}