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

files[ino2] = mkfile(m0, md0, # links(ino2, dirs), content0), buf-opt = none, content = files[inode.ino].content, err = ESUCCESS, fs = abs-files(files), ino = inode.ino, ino0 = min(n, inode.size), ino1 = inode.size % VFS_PAGE_SIZE, ino4 = 0, ino5 = 0, ino6 = ino4, ino7 = ino5, inode = mkinode(ino2, md0, false, # links(ino2, dirs), 0, m0), pageno = m0 / VFS_PAGE_SIZE, root.dir?, dom of < ino3, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), ispath(path, ROOT_INO, ino2, dirs, files), of-cons(of, dirs, files), pw(user, md0), px-parent(user, path, ROOT_INO, dirs, files), ROOT_INO ∈ dirs, ino2 ∈ files, psynced → asynced0 ⊦ [if inode.size ≤ n ∧ ino1 ≠ 0 ∧ (pageno ∈ content ∨ buf-opt.some?) then {if buf-opt.some? then buf := buf-opt.buf else buf := files[ino].content[pageno]; buf := fill(buf, zero, ino1, VFS_PAGE_SIZE - ino1); content[pageno] := buf; buf-opt := some(buf)}; files[ino].content := content upto ino0; 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 := ?] ( of-cons(of, dirs, files) ∧ afs-cons(dirs, files) → ⟨posix_truncate#(path, n, user, root, abs-of(of); err1, fs; psynced)⟩ (fs = abs-files(files) ∧ abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ err = err1)), VFS_PAGE_SIZE = 0, root[path].dir?, ino2 ∈ dirs

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information