[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 PurgeTransNoInitialstate

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:
Securityprovedall subs proved lemma1, wf-purge, inv-run-gen, test,
lemma1provedall subs proved lemma1-gen,
lemma1-genprovedall subs proved purge-rec, run-rec, wf-rec, purge-base, run-base,
inv-run-genprovedall subs proved run-rec, wf-rec, run-base,
wf-purgeprovedall subs proved purge-rec, wf-rec, purge-base,
wf-recprovedall subs proved wf-def,
wf-defaxiom
purge-baseaxiom
purge-recaxiom
run-baseaxiom
run-recaxiom
testaxiom