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

⟨ let ino = inode.ino, content = files[inode.ino].content, buf = ? in {ino1 := inode.size % VFS_PAGE_SIZE, ino0 := min(n, inode.size); isdir := inode.size ≤ n ∧ ino1 ≠ 0 ∧ (pageno ∈ content ∨ buf-opt.some?); if isdir 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} or fail#(; ; err); asynced := ?⟩ ( inode = inode0 ∧ buf-opt = buf-opt1 ∧ ino1 = ino2 ∧ ino0 = ino3 ∧ (isdir ↔ isdir0) ∧ err = err0 ∧ dirs = dirs0 ∧ files = files0 ∧ (asynced ↔ asynced1)), files1[ino4] = mkfile(m0, md, # links(ino4, dirs), content0), buf-opt = none, files = files1, ino = 0, ino0 = ino, ino1 = ino5, ino5 = 0, inode = mkinode(ino4, md, false, # links(ino4, dirs), 0, m0), n = m0, pageno = m0 / VFS_PAGE_SIZE, afs-cons(dirs, files1), afs-cons(dirs0, files0), files1 ~ files0, ino4 ∈ files1, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ VFS_PAGE_SIZE = 0, (err0 = ESUCCESS ⊃ files0[ino4].content.stream from m0 = σ⊥ ∧ (n0 ≤ # buf → ino4 ∈ files0 ∧ files0[ino4].size = m0) ∧ files1 -- ino4 = files0 -- ino4 ;⌊err0⌋ ) ∧ inode0 = mkinode(ino4, md, false, # links(ino4, dirs), 0, m0)

Heuristic split applied rule split left

And obtained the following new goals

Rule argument

pos: left 1

Additional information