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

of[fd] = mkfile(m3, mode0, m4), files[m3] = mkfile(m1, md, m2, content), buf = buf0, err = ESUCCESS, ino3 = 0, root.dir?, dom of < ino2, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), of-cons(of, dirs, files), fd ∈ of, m4 ≤ m1, n0 ≤ # buf0, psynced → asynced ⊦ [vfs_read_loop#(m4, m4 + n0, mkinode(m3, md, false, m2, 0, m1), false, dirs, files, asynced; buf, ino3, err)] ( ⌊err⌋ ∨ err = ESUCCESS → [if ino3 ≠ 0 then err := ESUCCESS; of0 := of[fd, of[fd].pos:= (m4 + ino3)]; n := ino3] ( of-cons(of0, dirs, files) ∧ dom of0 < ino2 → ⟨ofh := abs-of(of); posix_read#(fd, user, root, abs-files(files); buf0, n0, err0, ofh)⟩ (ofh = abs-of(of0) ∧ (psynced → asynced) ∧ buf = buf0 ∧ n = n0 ∧ err = err0))), mode0 ≠ MODE_R ∧ mode0 ≠ MODE_RW

User applied rule insert program lemma

And obtained the following new goals

Rule argument

spec: vfs-contracts name: read-loop-inv seq: read-inv(n0, n1, inode, buf0, buf1, n, dirs, files) ⊦ [vfs_read_loop# (n0, n1, inode, bv, dirs, files, asynced; buf1, n, err)] read-inv(n0, n1, inode, buf0, buf1, n, dirs, files) subst: [asynced, files, dirs, bv, inode, n1, n0, err, n, buf1, buf0] → [asynced, files, dirs, false, mkinode(m3, md, false, m2, 0, m1), m4 + n0, m4, err, ino3, buf, buf0] flags: <all paths>

Additional information