[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 7 from proof crash-neutral-write-buf (
previous step
)
# 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)
Heuristic symbolic execution applied rule assign right
And closed the goal!
Rule argument
Additional information