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

files[m0] = mkfile(m, md0, # links(m0, dirs), content), buf-opt = none, files0 = files, inode = mkinode(m0, md, false, # links(m0, dirs), 0, m3), old_ino = 0, old_ino0 = 0, pageno = m3 / VFS_PAGE_SIZE, m3 < n, afs-cons(dirs, files), m0 ∈ files ⊦ [ let ino = inode.ino, content = files[inode.ino].content, buf = ? in {old_ino0 := inode.size % VFS_PAGE_SIZE, old_ino := min(n, inode.size); asynced0 := inode.size ≤ n ∧ old_ino0 ≠ 0 ∧ (pageno ∈ content ∨ buf-opt.some?); if asynced0 then {if buf-opt.some? then buf := buf-opt.buf else buf := files[ino].content[pageno]; buf := fill(buf, 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} or fail#(; ; err); 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

Heuristic conditional right split applied rule or split right

And obtained the following new goals

Rule argument

Additional information