[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 allWritesOKInd-recW
⊦ allWritesOKInd(pending, persisted, (W(t, l, v), b) ' + h) ↔ ¬ pending(t) ∧ (b → persisted(l)) ∧ allWritesOKInd(pending(t := ¬ b), persisted(l := b), h)
Type: An axiom
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
allWritesOK-ind-filter-persisted
,
allWritesOK-ind-filter-persisted-upd-true
,
allwritesOK-ind-add-read
,
allwritesOK-ind-add-write
,
allwritesOK-ind-at-most-one-write
,
allwritesOK-ind-one
,
allwritesOK-ind-one-unpersisted-write-no-persisted-after
,
allwritesOK-ind-pending-zero-write
,
allwritesOK-ind-persist-dependent-reads
,
allwritesOK-ind-persist-one-write
,
allwritesOK-ind-swap-flags-persist-one-write
,
allwritesOK-ind-swap-to-non-pending
,
allwritesOK-ind-unpersisted-one-write
,
Used by units in proved state:
Proof exists?: No