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

⟨let ino = inode.ino in if ino ∈ files then {files[ino].size := inode.size; files[ino].meta := inode.meta} else if ino ∈ dirs then dirs[ino].meta := inode.meta⟩ (dirs = dirs0 ∧ files = files0), ⟨if m0 % VFS_PAGE_SIZE ≠ 0 ∧ m0 / VFS_PAGE_SIZE ∈ content0 then {pageno := m0 / VFS_PAGE_SIZE; if buf-opt.some? then buf := buf-opt.buf else buf := files2[ino4].content[pageno]; buf := fill(buf, zero, m0 % VFS_PAGE_SIZE, VFS_PAGE_SIZE - m0 % VFS_PAGE_SIZE); content[pageno] := buf; buf-opt := some(buf)}⟩ (pageno = pageno1 ∧ buf = buf0 ∧ content = content1 ∧ buf-opt = buf-opt0), files2[ino4] = mkfile(m0, md, # links(ino4, dirs), content0), buf-opt = none, content = content0, files = files1, files1 = files2[ino4, mkfile(m0, md, # links(ino4, dirs), content1 upto m0)], inode = mkinode(ino4, md, false, # links(ino4, dirs), 0, m0), afs-cons(dirs, files2), afs-cons(dirs0, files0), files2 ~ files0, ino4 ∈ files2 ⊦ (ino4 ∈ dirs0 ⊃ mkinode(ino4, dirs0[ino4].meta, true, dirs0[ino4].nlink, dirs0[ino4].nsubdirs, dirs0[ino4].size) ;mkinode(ino4, files0[ino4].meta, false, files0[ino4].nlink, 0, files0[ino4].size) ) = mkinode(ino4, md, false, # links(ino4, dirs), 0, m0)

Heuristic symbolic execution applied rule let left

And obtained the following new goals

Rule argument

Additional information