[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.queue = [] ∧ pcf = (λ tid. idle)) ∧ (∀ tid. tid = lsf(tid).tid) ⊦ DurQInv(gs, lsf, pcf)
Type: A proof obligation
Validity: The proof is valid.
Features:
Comment:
Used by:
DurQInv-thm
,
other-DurQLInv
,
step-DurQLInv
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 13
Used lemmas:
Used spec theorems:
DurQ
/
DurQInv
DurQ
/
DurQGInv
DurQ
/
DurQLInv
Used simplifier rules:
DurQ
/
elim-mkgs
DurQ
/
elim-mkls
DurQ
/
sel-mkls-dottid