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

of[fd] = mkfile(m, mode, m0), err = ESUCCESS, dom of < ino, afs-cons(dirs, files), of-cons(of, dirs, files), fd ∈ of, n ≤ # buf, mode ≠ MODE_R → fd ∈ of ⊦ ⟪afs_iget#(m, dirs, files, asynced; inode, err); if err = ESUCCESS then if inode.directory then err := EISDIR else let ino1 = m0, ino0 = m0 + n, ino = 0 in if ino1 ≤ inode.size then {let isdir = false in vfs_read_loop#(ino1, ino0, inode, isdir, dirs, files, asynced; buf, ino, err); if ino ≠ 0 then err := ESUCCESS; of[fd].pos := of[fd].pos + ino; n := ino} else n := 0⟫ (of-cons(of, dirs, files) ∧ dom of < ino), mode ≠ MODE_R ∧ mode ≠ MODE_RW

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 14:
of[fd] = mkfile(m, mode, m0), err = ESUCCESS, ino = m, dom of < ino2, afs-cons(dirs, files), of-cons(of, dirs, files), fd ∈ of, n ≤ # buf, mode ≠ MODE_R → fd ∈ of ⊦ ⟪if pre-iget(ino, dirs, files) then {{inode := getinode(ino, dirs, files); err := ESUCCESS} or fail#(; ; err)} else abort; if err = ESUCCESS then if inode.directory then err := EISDIR else let ino1 = m0, ino0 = m0 + n, ino = 0 in if ino1 ≤ inode.size then {let isdir = false in vfs_read_loop#(ino1, ino0, inode, isdir, dirs, files, asynced; buf, ino, err); if ino ≠ 0 then err := ESUCCESS; of[fd].pos := of[fd].pos + ino; n := ino} else n := 0⟫ (of-cons(of, dirs, files) ∧ dom of < ino2), mode ≠ MODE_R ∧ mode ≠ MODE_RW

Rule argument

pos: right 1

Additional information

Used simplifier rules: afs_iget#(INO, DIRS, FILES, ASYNCED; INODE, ERR) {if pre-iget(INO, DIRS, FILES) then { {INODE := getinode(INO, DIRS, FILES); ERR := ESUCCESS} or fail#(; ; ERR)} else abort };