[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 persistDependentReads-restrict-single-W
⊦ ((h | l) | t) | false = (W(t0, l0, v0), b) ' → ((persistDependentReads(l, h) | l) | t) | false = (W(t0, l0, v0), b) '
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
FLITPSCweak-refines-PLIB
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 30
Used lemmas:
persistDependentReads-otherread
,
persistDependentReads-read
,
persistDependentReads-otherwrite
,
persistDependentReads-nextwrite
,
hist-ind
,
restrict-vp
,
restrict-thread
,
restrict-loc
,
Used spec theorems:
Used simplifier rules:
list
/
e
filter-count
/
filter-base
list
/
a
filter-count
/
filter-append
RWevent
/
sel-W-dotl
filter-count
/
filter-rec
filter-count
/
filter-one
RWevent
/
sel-W-dott
list
/
Nil
RWevent
/
sel-R-dotl
RWevent
/
sel-R-dott
list
/
c
list
/
c-03
RWevent
/
disj-R-W