[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 6 from proof crash-neutral-write-buf (previous step)

# lpt = # avol, avol[n0] = mapped(buf0), n0 < # avol, awbuf-inv(avol, buffered(n0)), synced(avol0), avol0 ↓ avol, # buf0 + n ≤ LEB_SIZE, n ≤ # buf ⊦ ⟨if isbuf then err := EROFS else {fail_or_success#(; ; err); let m = buffered(n0).leb in if err = ESUCCESS then avol[m] := mapped(avol[m].data + subarray(buf, 0, n)) else { choose n1 with n1 ≠ 0 ∧ n1 < n ∧ is-aligned(# avol[m].data + n1, EB_PAGE_SIZE) in avol[m] := mapped(avol[m].data + subarray(buf, 0, n1)) ifnone skip or skip; isbuf := true}}⟩ (avol0 ↓ avol)

Heuristic conditional right split applied rule if right

And obtained the following new goals

Proof step 7:
# lpt = # avol, avol[n0] = mapped(buf0), isbuf, n0 < # avol, awbuf-inv(avol, buffered(n0)), synced(avol0), avol0 ↓ avol, n ≤ # buf, # buf0 + n ≤ LEB_SIZE ⊦ ⟨err := EROFS⟩ (avol0 ↓ avol)
Proof step 8:
# lpt = # avol, avol[n0] = mapped(buf0), ¬ isbuf, n0 < # avol, awbuf-inv(avol, buffered(n0)), synced(avol0), avol0 ↓ avol, n ≤ # buf, # buf0 + n ≤ LEB_SIZE ⊦ ⟨fail_or_success#(; ; err); let m = buffered(n0).leb in if err = ESUCCESS then avol[m] := mapped(avol[m].data + subarray(buf, 0, n)) else { choose n1 with n1 ≠ 0 ∧ n1 < n ∧ is-aligned(# avol[m].data + n1, EB_PAGE_SIZE) in avol[m] := mapped(avol[m].data + subarray(buf, 0, n1)) ifnone skip or skip; isbuf := true}⟩ (avol0 ↓ avol)

Rule argument

pos: right 1

Proof step 6 from proof crash-neutral-write-buf (previous step)

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

Additional information