[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 wbuf-refine

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:
refine-read-bufprovedall subs proved nat1, nat0,
refine-add-log-lebprovedall subs proved abs-unbuffered,
refine-write-bufprovedall subs proved mod-to-aligndown-minus, nat1,
refine-move-bufprovedall subs proved abs-unbuffered,
nat0provedall subs proved
nat1provedall subs proved
mod-to-aligndown-minusprovedall subs proved
abs-unbufferedprovedall subs proved