[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. 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,

Proof step 8 from proof inv-writepage (previous step)

# buf = VFS_PAGE_SIZE, boolvar0 ↔ boolvar2, boolvar, inode = mkinode(m, md, boolvar1, m0, m1, m2), fo.inodes?, ro.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(m) ∈ ri ⊦ ⟪let ino = inode.ino in {key := datakey(ino, pageno); nd := datanode(key, buf); aubifs_core_journal_add1#(nd, ri, fi, ro, fo; adr, fs, log; boolvar0, err); if err = ESUCCESS then aubifs_core_index_store#(key, adr, fi, ro, fo, fs, log, boolvar0; ri) else if ¬ boolvar then aubifs_core_index_remove#(key, fi, ro, fo, fs, log, boolvar0; ri)}⟫ (ubifs-cons(fs, ri, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro)), fs[ri[inodekey(m)]].directory

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 9:
# buf = VFS_PAGE_SIZE, ro.inodes?, fo.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(m) ∈ ri, ¬ fs[ri[inodekey(m)]].directory ⊦ ⟪let ino = m in {key := datakey(ino, pageno); nd := datanode(key, buf); aubifs_core_journal_add1#(nd, ri, fi, ro, fo; adr, fs, log; boolvar0, err); if err = ESUCCESS then aubifs_core_index_store#(key, adr, fi, ro, fo, fs, log, boolvar0; ri)}⟫ (ubifs-cons(fs, ri, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro))

Rule argument

Additional information

Used simplifier rules: ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)