[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 cache-contracts

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:
fsync-others-unchangedprovedall subs proved fsync-inode-others-unchanged, fsync-pages-others-unchanged,
fsync-keep-absprovedall subs proved fsync-inode-keep-abs, fsync-pages-keep-abs,
fsync-inode-others-unchangedprovedall subs proved at-icache-overwrite-other,
fsync-inode-keep-absprovedall subs proved at-icache-overwrite-other,
fsync-pages-overwriteprovedall subs proved trunc-def,
fsync-errprovedall subs proved fsync-inode-err, fsync-pages-err,
trunc-defaxiom
fsync-pages-others-unchangedprovedall subs proved
fsync-pages-keep-absprovedall subs proved
at-icache-overwrite-otherprovedall subs proved
fsync-pages-errprovedall subs proved
fsync-inode-errprovedall subs proved