[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Theorem create-gcheap

persistence_create_gcheap#(LOG; LPT, GCHEAP) {gc_heap_empty#(; GCHEAP); let N = 0 in while N < # LPT do {/* (prepost-create-gcheap : invariant N ≤ # LPT ∧ bin-heap-inv(GCHEAP, LPT) ∧ gc-heap(LPT, LOG, N) = keyset(GCHEAP) ∧ id-idx(LPT`, LPT) wfbound # LPT - N) */; if LPT[N].flags = LP_GROUP_NODES ∧ ¬ N ∈ LOG then let KI = key-index(LPT[N].ref-size, N) in gc_heap_insert#(KI; GCHEAP, LPT); N := N + 1} }