[Imprint][Data Privacy Statement][E-Mail]

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,

Lemma dependency for Specification RG-I-n-Theory

A lemma (entry) may depend on lemmas (entries) below its position, but never on lemmas above its position. This means the list is a topological order of the dependency graph. An entry 'all subs proved' means that all used lemmas are (transitively) proved.

Name: Status: Subs proved? Used:
CSPAWN-sat-rely-guarprovedall subs proved CSPAWN-sat-rely-guar-ind,
CSPAWN-sat-rely-guar-indprovedall subs proved CRelytosucc-CRelyto, CRelytosucc-CRely, CInittosucc-Cinittp, RG-restr-ok, CInitto-Idle, CSEQ-sat-rely-guar,
fair-never-violates-right-relyprovedall subs proved CRelytosucc-CRelyto, CRelytosucc-CRely, RG-restr-ok,
fair-never-violates-left-relyprovedall subs proved CRelytosucc-CRelyto, CRelytosucc-CRely, RG-restr-ok,
fair-always-right-relyinvprovedall subs proved CRelytosucc-CRelyto, CRelytosucc-CRely, RG-restr-ok,
fair-always-right-relyprovedall subs proved CRelytosucc-CRelyto, CRelytosucc-CRely, RG-restr-ok,
fair-always-left-relyinvprovedall subs proved CRelytosucc-CRelyto, CRelytosucc-CRely, RG-restr-ok,
fair-always-left-relyprovedall subs proved CRelytosucc-CRelyto, CRelytosucc-CRely, RG-restr-ok,
CSEQ-sat-rely-guarprovedall subs proved CRely-refl, COP-sat-rely-guar,
RG-restr-okprovedall subs proved CRely-refl,
CRely-reflprovedall subs proved g-r,
CInitto-Idleprovedall subs proved
CInittosucc-Cinittpprovedall subs proved
CRelytosucc-CRelyprovedall subs proved
CRelytosucc-CRelytoprovedall subs proved
COP-sat-rely-guarprovedall subs proved
g-rprovedall subs proved