[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 aubifs-inv

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:
ubifs-dir-dataprovedall subs proved ubifs-file-in, ubifs-file-notdir,
datanode-pagesizeprovedall subs proved datakey-cons, node-closed, log-cons, ri-closed, ri-cons, ubifs-cons, ubifs-file-in, ubifs-file-notdir,
ubifs-file-inprovedall subs proved datanode-closed, datakey-cons, log-cons, ri-closed, ri-cons, ubifs-cons, ubifs-file-notdir,
ubifs-parent-dirprovedall subs proved dentrynode-closed, dentrykey-cons, inodenode-closed, inodekey-cons, log-cons, ri-closed, ri-cons, ubifs-cons, ubifs-parent-in,
ubifs-cons-notin-delsprovedall subs proved ubifs-adr-in-ri,
ubifs-cons-notin-delprovedall subs proved ubifs-adr-in-ri,
log-cons-copy-newprovedall subs proved key-cons, key-node-cons, log-cons, ri-cons,
ubifs-parent-inprovedall subs proved dentrynode-closed, dentrykey-cons, log-cons, ri-closed, ri-cons, ubifs-cons,
ubifs-adr-in-riprovedall subs proved ubifs-in-fs,
key-node-consprovedall subs proved dentrykey-cons, datakey-cons, inodekey-cons, node-cons,
ubifs-file-notdirprovedall subs proved datanode-closed, datakey-cons, inodekey-cons, log-cons, ri-closed, ri-cons, ubifs-cons,
ubifs-ro-dentryprovedall subs proved inodes-nodentry, ubifs-cons,
ubifs-ro-dataprovedall subs proved inodes-nodata, ubifs-cons,
ubifs-ri-consprovedall subs proved log-cons, ri-closed, ubifs-cons, ubifs-in-fs, ri-cons,
ubifs-cons-variant4provedall subs proved ubifs-log-nodups,
ubifs-cons-variant1provedall subs proved ubifs-cons-ino0,
ubifs-cons-ri-closedprovedall subs proved log-cons, ri-cons, ubifs-cons, ubifs-in-fs, ri-closed,
ubifs-cons-log-consprovedall subs proved ri-closed, ri-cons, ubifs-cons, ubifs-cons-logadr-in, log-cons,
ri-cons-variant1-01provedall subs proved ri-key-cons, ri-cons-in, ri-cons,
ri-cons-emptyprovedall subs proved ri-cons-empty-2,
ri-cons-del-orphansprovedall subs proved datakey-cons, ri-cons,
log-cons-variant1-01provedall subs proved log-node-cons, log-adr-in, log-cons,
inodes-putprovedall subs proved inodes-in, inode-set,
inodes-delprovedall subs proved inodes-in, inode-set,
datalkeys-drop-orphansprovedall subs proved inodes-nodata,
inodes-nodentryprovedall subs proved inode-set,
inodenode-closedprovedall subs proved node-closed,
dentrynode-closedprovedall subs proved node-closed,
datanode-closedprovedall subs proved node-closed,
ubifs-log-nodupsprovedall subs proved ubifs-cons,
ubifs-cons-ino0provedall subs proved ubifs-cons,
ubifs-cons-logadr-inprovedall subs proved log-cons, ri-closed, ri-cons, ubifs-cons,
ubifs-in-fsprovedall subs proved log-cons, ri-closed, ri-cons, ubifs-cons,
ri-cons-inprovedall subs proved ri-cons,
ri-key-consprovedall subs proved ri-cons,
ri-cons-empty-2provedall subs proved ri-cons,
log-adr-inprovedall subs proved log-cons,
log-node-consprovedall subs proved log-cons,
inodekey-consprovedall subs proved key-cons,
dentrykey-consprovedall subs proved key-cons,
inodes-inprovedall subs proved inode-set,
datakey-consprovedall subs proved key-cons,
inodes-nodataprovedall subs proved inode-set,
ubifs-ro-subsetprovedall subs proved log-cons, ri-closed, ri-cons, ubifs-cons,
ubifs-log-nodups-add5provedall subs proved log-cons, ri-closed, ri-cons, ubifs-cons,
ubifs-log-nodups-add4provedall subs proved log-cons, ri-closed, ri-cons, ubifs-cons,
ubifs-log-nodups-add3provedall subs proved log-cons, ri-closed, ri-cons, ubifs-cons,
ubifs-log-nodups-add2provedall subs proved log-cons, ri-closed, ri-cons, ubifs-cons,
ubifs-log-nodups-add1provedall subs proved log-cons, ri-closed, ri-cons, ubifs-cons,
ubifs-fo-subsetprovedall subs proved log-cons, ri-closed, ri-cons, ubifs-cons,
ubifs-cons-ro-inodesprovedall subs proved ubifs-cons,
ubifs-cons-ri-injprovedall subs proved key-cons, log-cons, ri-closed, ri-cons, ubifs-cons, ri-inj,
ubifs-cons-fo-inodesprovedall subs proved ubifs-cons,
ubifs-cons-dom-riprovedall subs proved ubifs-cons,
ubifs-cons-dom-fiprovedall subs proved ubifs-cons,
truncnode-consprovedall subs proved node-cons,
ri-inj-writeprovedall subs proved ri-inj,
ri-inj-variant1-01provedall subs proved ri-inj,
ri-inj-remprovedall subs proved ri-inj,
ri-inj-emptyprovedall subs proved ri-inj,
ri-inj-delprovedall subs proved ri-inj,
ri-cons-truncnodeprovedall subs proved key-cons, ri-cons,
ri-cons-range-riprovedall subs proved ri-cons,
ri-cons-keyprovedall subs proved key-cons, ri-cons,
ri-cons-injprovedall subs proved key-cons, ri-inj, ri-cons,
ri-cons-gc-oneprovedall subs proved ri-cons,
ri-cons-dropprovedall subs proved ri-cons,
ri-cons-copy-newprovedall subs proved ri-cons,
ri-cons-copyprovedall subs proved ri-cons,
ri-closed-variant1-01provedall subs proved ri-closed,
ri-closed-gc-oneprovedall subs proved node-closed, ri-closed, ri-cons,
ri-closed-dropprovedall subs proved node-closed, ri-closed,
read-lookup-copyprovedall subs proved ri-cons,
nodups-new-nodupsprovedall subs proved log-cons,
log-cons-oneprovedall subs proved log-cons,
log-cons-empprovedall subs proved log-cons,
log-cons-dropprovedall subs proved log-cons,
log-cons-copy-oldprovedall subs proved log-cons,
log-cons-appprovedall subs proved log-cons,
key-cons-keyprovedall subs proved key-cons,
inodenode-consprovedall subs proved node-cons,
index-update-domprovedall subs proved key-cons, ri-cons,
in-ri-update-in-riprovedall subs proved key-cons, ri-cons,
file-node-cons-variant1-01provedall subs proved file-node-cons,
empty-inodesprovedall subs proved inode-set,
dentrynode-consprovedall subs proved node-cons,
datanode-consprovedall subs proved node-cons,
ri-injaxiom
file-node-consaxiom
inode-setaxiom
ubifs-consaxiom
ri-consaxiom
ri-closedaxiom
log-consaxiom
node-consaxiom
node-closedaxiom
key-consaxiom