[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 replaylog-prog
ri0 = ri, err = ESUCCESS, replay-safe(ax, fs, ri) ⊦ ⟪aubifs_replaylog#(ax, fi, ro, fo, fs, log, boolvar; err, ri)⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → ri = replay-log(ax, fs, ri0)))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
replay-prog
,
Used by units in proved state:
aubifs-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 11
Used lemmas:
replayone-prog
,
replaylog
,
Used spec theorems:
Used simplifier rules:
list
/address-list-set/
app
list
/address-list-set/
app-05
aubifs-replay
/
replay-log-empty
list-data
/address-list-set/
elim-list-c
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
nat-basic
/
succ
list
/address-list-set/
len-05
aubifs-replay
/
replay-safe-rec
list
/address-list-set/
e-01
list
/address-list-set/
c
aubifs-replay
/
replay-safe-one
list
/address-list-set/
app-03
list
/address-list-set/
a
aubifs-replay
/
replay-log-split
aubifs-replay
/
replay-log-one
nat-basic
/
ref