[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 heap-add-log

persistence_gc_heap_add_log#(; LOG, LPT, GCHEAP) {while LOG ≠ [] do {/* (prepost-gcheap-add-log : invariant bin-heap-inv(GCHEAP, LPT) ∧ keyset(GCHEAP) = gc-heap(LPT, LOG) ∧ id-idx(LPT`, LPT) ∧ ¬ dups(LOG) ∧ (∀ n. n ∈ LOG → n < # LPT ∧ LPT[n].flags = LP_GROUP_NODES) wfbound # LOG) */; let LNUM = LOG.head in let KI = key-index(LPT[LNUM].ref-size, LNUM) in gc_heap_insert#(KI; GCHEAP, LPT); LOG := LOG.tail} }