[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 21 from proof truncate-greater (previous step)

files[m0] = mkfile(m, md0, # links(m0, dirs), content0), buf-opt = none, content = files[inode.ino].content, files0 = files, ino = inode.ino, inode = mkinode(m0, md, false, # links(m0, dirs), 0, m3), old_ino = min(n, inode.size), old_ino0 = inode.size % VFS_PAGE_SIZE, old_ino1 = 0, old_ino2 = 0, pageno = m3 / VFS_PAGE_SIZE, m3 < n, afs-cons(dirs, files), pageno ∈ files[ino].content, m0 ∈ files, inode.size ≤ n, pageno ∈ content ∨ buf-opt.some? ⊦ [buf := fill(files[ino].content[pageno], zero, old_ino0, VFS_PAGE_SIZE - old_ino0); content[pageno] := buf; buf-opt := some(buf); files[ino].content := content upto old_ino; let new_inode = inode in {new_inode.size := n; afs_inode_sync#(new_inode; dirs, files)}; inode := getinode(inode.ino, dirs, files); err := ESUCCESS; asynced := ?] (err = ESUCCESS ⊃ files[inode.ino].content.stream to files[inode.ino].size = (files0[inode.ino].content.stream to m3) + (σ⊥ to (files[inode.ino].size - m3)) ∧ inode.ino ∈ files ∧ n = files[inode.ino].size ∧ files0[inode.ino].nlink = files[inode.ino].nlink ∧ files0 -- inode.ino = files -- inode.ino ;⌊err⌋ ∧ files0 = files ), VFS_PAGE_SIZE = 0, old_ino0 = 0

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information