[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.mem = (λ l. O) ∧ pcf = (λ tid. idle) ∧ gs.p = (λ l. []) ∧ gs.ctr = (λ l. 0) ∧ gs.readers = (λ l. ∅) ∧ gs.writers = (λ l. ∅)) ∧ (∀ t. t = lsf(t).t) ⊦ FLITPSCInv(gs, lsf, pcf)
Type: A proof obligation
Validity: The proof is valid.
Features:
Comment:
Used by:
FLITPSCInv-thm
,
other-FLITPSCLInv
,
rely-FLITPSCLInv
,
stable-FLITPSCLInv
,
step-FLITPSCLInv
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 19
Used lemmas:
Used spec theorems:
FLITPSCweak
/
FLITPSCInv
FLITPSCweak
/
FLITPSCGInv
FLITPSCweak
/
FLITPSCLInv
FLITPSC-preds
/
ctrok-def
FLITPSC-preds
/
writersOk
FLITPSC-preds
/
pendingOk
FLITPSC-preds
/
noPending
FLITPSC-preds
/
noWriter
Used simplifier rules:
FLITPSC-preds
/
no-pending-w-no-pending
FLITPSCweak
/
disj-R4-idle
FLITPSCweak
/
disj-R3-idle
FLITPSCweak
/
disj-R2-idle
FLITPSCweak
/
disj-R1-idle
FLITPSCweak
/
disj-W5-idle
FLITPSCweak
/
disj-W4-idle
FLITPSCweak
/
disj-W7-idle
FLITPSCweak
/
disj-W6-idle
FLITPSCweak
/
disj-W3-idle
FLITPSCweak
/
disj-W2-idle
FLITPSCweak
/
disj-W1-idle
set-basic
/
Size-empty
FLITPSC-preds
/
filter-tid-empty
FLITPSC-preds
/
filter-w-empty
set-basic
/
In-empty
list-data
/
size-nil