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

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 base for Specification gc-heap-base

This is a listing of all goals defined over the current specification. Axioms are marked yellow, proved theorems green and unproved theorems blue. Click on individual names to get more information on the proof.

Name: Sequent: Type:
totality ⊦ key < key0 ∨ key = key0 ∨ key0 < key A Proof Obligation
transitivity ⊦ key < key0 ∧ key0 < key1 → key < key1 A Proof Obligation
irreflexivity ⊦ ¬ key < key A Proof Obligation
Uniform-elemjsubindex∀ n2, n3, lpf, m. Plprops(mklp(n2, n3, lpf, m)) ⊦ ∀ lp. Plprops(lp) A Proof Obligation
sel-01 ⊦ mklp(n2, n3, lpf, m).gcheapidx = m A Proof Obligation
sel-02-M01 ⊦ mklp(n2, n3, lpf, m).ref-size = n2 A Proof Obligation
sel-02-M02 ⊦ mklp(n2, n3, lpf, m).size = n3 A Proof Obligation
sel-02-M03 ⊦ mklp(n2, n3, lpf, m).flags = lpf A Proof Obligation
upd-01 ⊦ mklp(n2, n3, lpf, m).gcheapidx:= m0 = mklp(n2, n3, lpf, m0) A Proof Obligation
upd-02 ⊦ ((mklp(n2, n3, lpf, m).ref-size:= n8).size:= n9).flags:= lpf2 = mklp(n8, n9, lpf2, m) A Proof Obligation
updsel-01 ⊦ (lp.gcheapidx:= m).gcheapidx = m A Proof Obligation
updsel-02 ⊦ (((lp.ref-size:= n2).size:= n3).flags:= lpf).gcheapidx = lp.gcheapidx A Proof Obligation
updsel-03-M01 ⊦ (lp.gcheapidx:= m).ref-size = lp.ref-size A Proof Obligation
updsel-03-M02 ⊦ (lp.gcheapidx:= m).size = lp.size A Proof Obligation
updsel-03-M03 ⊦ (lp.gcheapidx:= m).flags = lp.flags A Proof Obligation
updsel-04-M01 ⊦ (((lp.ref-size:= n2).size:= n3).flags:= lpf).ref-size = n2 A Proof Obligation
updsel-04-M02 ⊦ (((lp.ref-size:= n2).size:= n3).flags:= lpf).size = n3 A Proof Obligation
updsel-04-M03 ⊦ (((lp.ref-size:= n2).size:= n3).flags:= lpf).flags = lpf A Proof Obligation
inj ⊦ mklp(n2, n3, lpf, m) = mklp(n8, n9, lpf2, m0) ↔ (n2 = n8 ∧ n3 = n9 ∧ lpf = lpf2) ∧ m = m0 A Proof Obligation
elim ⊦ (n2 = lp.ref-size ∧ n3 = lp.size ∧ lpf = lp.flags) ∧ m = lp.gcheapidx ↔ lp = mklp(n2, n3, lpf, m) A Proof Obligation