[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 init-state-inv
( gs.pmem = (λ l. O) ∧ pcf = (λ tid. idle) ∧ gs.pq = (λ l. []) ∧ gs.fctr = (λ l. 0) ∧ gs.freaders = (λ l. ∅) ∧ gs.fwriters = (λ l. ∅) ∧ gs.bq = (λ t. []) ∧ gs.rfo = (λ t. [])) ∧ (∀ t. t = lsf(t).t) ⊦ FLITInv(gs, lsf, pcf)
Type: A proof obligation
Validity: The proof is valid.
Features:
Comment:
Used by:
FLITInv-thm
,
other-FLITLInv
,
rely-FLITLInv
,
stable-FLITLInv
,
step-FLITLInv
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 25
Used lemmas:
Used spec theorems:
FLIT
/
FLITInv
FLIT
/
FLITGInv
FLIT
/
FLITLInv
FLITPSC-preds
/
ctrok-def
FLIT-preds
/
writersOk
FLIT-preds
/
pendingOk
FLIT-preds
/
SFTrailing
FLIT-preds
/
readFOsOk
FLIT-preds
/
FOs
FLITPSC-preds
/
noWriter
FLIT-preds
/
noPending
Used simplifier rules:
list
/
in-empty
FLIT-preds
/
noPending-then-noPendingW
FLIT
/
disj-R4-idle
FLIT
/
disj-R3-idle
FLIT
/
disj-R2-idle
FLIT
/
disj-R1-idle
FLIT
/
disj-W2-idle
FLIT
/
disj-W7-idle
FLIT
/
disj-W1-idle
FLIT
/
disj-W6-idle
FLIT
/
disj-W5-idle
FLIT
/
disj-W4-idle
FLIT
/
disj-W3-idle
set-basic
/
Size-empty
FLIT-preds
/
restrict-l-empty
FLITPSC-preds
/
filter-tid-empty
FLITPSC-preds
/
filter-w-empty
set-basic
/
In-empty
nat-basic
/
c
nat-basic
/
a
list-data
/
size-nil
forall-indexWhere
/
forall-base