[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 heap-mod

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:
agree-rm-02provedall subs proved agree-sym, agree-rm-01,
modify-agreeprovedall subs proved modify+-sym, agree-rm-01, modify, agree, modify+,
agree-symprovedall subs proved agree,
agree-rm-01provedall subs proved agree,
modify+-symprovedall subs proved modify, modify+,
modify-footprintprovedall subs proved modify+, footprint,
footprintaxiom
agreeaxiom
modify+axiom
modifyaxiom