[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 12 from proof synced-write-buf (previous step)

⟨awbuf_write_buf#(n, buf, adr, m, nx, lpt, ns, buffered(m1); avol, isbuf; err)⟩ (avol = avol1 ∧ (isbuf ↔ isbuf0) ∧ err = err0), # lpt = # avol, avol[m1] = mapped(buf0), isbuf, m1 < # avol, awbuf-inv(avol, buffered(m1)), avol0 ↓ avol1, # buf0 + n ≤ LEB_SIZE, n ≤ # buf, ¬ avol0 ↓ avol ⊦

Heuristic nonrecursive calls applied rule call left

And obtained the following new goals

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

Rule argument

pos: left 1

Additional information

Used simplifier rules: write-buf: ⊦ ;