[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 COP-sat-rely-guar
CInv(n, Act, CS), Act(m), m ≤ n, Idle(m, CS) ⊦ [: Act, Inp, CS, Outp | CRely(m, Act', CS', Act'', CS'') , CGuar(m, Act, CS, Act', CS') , (CInv(n, Act, CS) ∧ Act(m)) , COP(m, Inp; CS, Outp) ] (CInv(n, Act, CS) ∧ Idle(m, CS) ∧ Act(m))
Type: A user defined theorem
Validity: The proof is valid.
Features: tl,
Comment:
Used by:
CSEQ-sat-rely-guar
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 18
Proof steps: 30
Used lemmas:
Used spec theorems:
CSPAWN+Preds
/
CGuar-def
CSPAWN+Preds
/
CRely-def
CSPAWN+Preds
/
CInv-def
Used simplifier rules:
RGI-Conds
/
COP-sat-rely-guar
nat-basic2
/
succ
nat-basic2
/
s
nat-basic1
/
ref-1
nat-basic2
/
a
nat-basic2
/
c
nat
/
fle-01
nat-basic1
/
f