[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
,
Theorem crash-neutral-read
m < # pebs, ¬ pebs[m].bad, m0 + n ≤ PEB_SIZE, n0 + n ≤ # buf, mtd-cons(pebs), pebs0 = pebs ⊦ ⟨mtd_asm_read#(m, m0, n0, n, pebs; buf; bitflips, err)⟩ (pebs0 = pebs)
Type: A proof obligation
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 22
Used lemmas:
read
,
Used spec theorems:
Used simplifier rules:
peb
/
elim
peb
/
sel-05
error-class
/
eio
error
/
disj-66
nat
/
ge
nat
/
elim-sub
nat-basic
/
l-05
nat
/
fle-01
nat-basic
/
lf-02
nat-basic
/
f
nat
/
le-def
nat
/
ler
nat-basic
/
c
nat-basic
/
a
nat-basic
/
add-base
array-splice
/buffer/
range-eq-refl