[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 posix-base

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:
ofh-fids-modprovedall subs proved ofh-fids-new,
ofh-fids-newprovedall subs proved ofh-fids,
fids-empprovedall subs proved ofh-fids,
fids-cons-inprovedall subs proved ofh-fids, fids-cons,
crash-existsprovedall subs proved posix-crash, crash-exists-h,
fids-consaxiom
ofh-fidsaxiom
crash-exists-hprovedall subs proved
posix-crashaxiom