[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,

Proof step 20 from proof synced-remap (previous step)

# lpt = # avol, buffered(m2) ≠ bleb, m2 < # avol, awbuf-inv(avol, bleb), synced(avol), avol0 ↓ avol[m2, mapped(mkbuf(0))], ¬ mapped(mkbuf(0)) ↓ avol[m2] ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; if err = ESUCCESS then avol[m2] := mapped(mkbuf(0)) else {skip or avol[m2] := unmapped}⟩ (synced(avol) ∧ avol0 ↓ avol)

User applied rule exists right

And obtained the following new goals

Proof step 21:
# lpt = # avol, m2 < # avol, awbuf-inv(avol, bleb), synced(avol), avol0 ↓ avol[m2, mapped(mkbuf(0))] ⊦ (⌊ESUCCESS⌋ ∨ ESUCCESS = ESUCCESS) ∧ ⟨err := ESUCCESS; if err = ESUCCESS then avol[m2] := mapped(mkbuf(0)) else {skip or avol[m2] := unmapped}⟩ (synced(avol) ∧ avol0 ↓ avol), buffered(m2) = bleb, mapped(mkbuf(0)) ↓ avol[m2]

Rule argument

pos: right 1 terms: ESUCCESS abort: F discard: T computed: T

Additional information

Used terms: ESUCCESS