[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 DQ-refines-DurQ

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:
refinesprovedall subs proved bwsim,
bwrefinesprovedall subs proved bwsim,
bwsimprovedall subs proved imfin-lemma, fininvdeq, DurQ-Automaton, aabs-callARun, aabs-AResEnq, aabs-AResDeq, aabs-AInvEnq, aabs-AInvDeq, aabs-ADoEnq, aabs-ADoDeq, aabs-DurQtau, aabs-Acrash, absa-def, bwsim-step, DQinit, DurQstep, DQINV-Step, DQstep, DurQinit, DQINV-Init, DQINV-def,
bwsim-stepprovedall subs proved bwsim-step-nontau, absa-def, bwsim-step-tau,
DQINV-Initprovedall subs proved fininvdeq, DQINV-def, DQinit,
DQINV-Stepprovedall subs proved fininvdeq, DQINV-def,
DurQ-Automatonprovedall subs proved DurQinit,
imfin-lemmaprovedall subs proved imfin-lemma-aux,
bwsim-step-tauprovedall subs proved absa-def,
bwsim-step-nontauprovedall subs proved absa-def,
DQ-Automatonprovedall subs proved DQinit,
imfin-lemma-auxprovedall subs proved
DurQinitaxiom
DQstepaxiom
DurQstepaxiom
aabs-Acrashaxiom
aabs-DurQtauaxiom
aabs-ADoDeqaxiom
aabs-ADoEnqaxiom
aabs-AInvDeqaxiom
aabs-AInvEnqaxiom
aabs-AResDeqaxiom
aabs-AResEnqaxiom
aabs-callARunaxiom
DQinitaxiom
DQINV-defaxiom
fininvdeqaxiom
absa-defaxiom