[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 5 from proof write-inode-inv (previous step)

files1[ino].meta = md, write-inv(n0, n1, mkinode(ino, files1[ino].meta, false, m, n0, m0), buf, n, dirs, files0, files1), ino ∈ files1 ⊦ [afs_write_inode#(mkinode(ino, files1[ino].meta, false, m, n0, m0 + n); err, dirs, files1; asynced)] [if err = ESUCCESS then files0[ino].size := m0 + n] write-inv(n0, n1, mkinode(ino, md, false, m, n0, files0[ino].size), buf, n, dirs, files0, files1)

Heuristic weak unfold applied rule call right

And obtained the following new goals

Proof step 6:
files1[ino].meta = md, files = files1, inode = mkinode(ino, files1[ino].meta, false, m, n0, m0 + n), write-inv(n0, n1, mkinode(ino, files1[ino].meta, false, m, n0, m0), buf, n, dirs, files0, files1), ino ∈ files1 ⊦ [if pre-write-inode(inode, dirs, files) then { {if inode.directory then dirs[inode.ino].meta := inode.meta else {files[inode.ino].meta := inode.meta; files[inode.ino].size := inode.size}; err := ESUCCESS} or fail#(; ; err); asynced := ?} else abort; if err = ESUCCESS then files0[ino].size := m0 + n] write-inv(n0, n1, mkinode(ino, md, false, m, n0, files0[ino].size), buf, n, dirs, files0, files)

Rule argument

pos: right 1

Additional information

Used simplifier rules: afs_write_inode#(INODE; ERR, DIRS, FILES; ASYNCED) {if pre-write-inode(INODE, DIRS, FILES) then { {if INODE.directory then DIRS[INODE.ino].meta := INODE.meta else {FILES[INODE.ino].meta := INODE.meta; FILES[INODE.ino].size := INODE.size}; ERR := ESUCCESS} or fail#(; ; ERR); ASYNCED := ?} else abort };