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

err = ESUCCESS, n ≠ 0, dom of < ino, afs-cons(dirs, files), of-cons(of, dirs, files), fd ∈ of, n ≤ # buf ⊦ [afs_iget#(of[fd].ino, dirs, files, asynced; inode, err); dirs1 := dirs; if err = ESUCCESS then if inode.directory then err := EISDIR else let ino2 = of[fd].pos, ino1 = of[fd].pos + n, ino0 = 0, pageno = 0, buf-opt = none in {if err = ESUCCESS then pageno := inode.size / VFS_PAGE_SIZE; if err = ESUCCESS then afs_truncate#(inode.size, pageno; buf-opt, inode, isdir, err, dirs, files, asynced); if err = ESUCCESS then vfs_write_loop#(ino2, inode, ino1, buf, dirs; ino0, err, files, asynced); if ino0 ≠ 0 then err := ESUCCESS; if err = ESUCCESS then let ino = inode.size in {n := ino0, ino1 := ino2 + ino0; if ino0 ≠ 0 ∧ ino < ino1 then {inode.size := ino1; afs_check_commit#(dirs, files; err; asynced); if err = ESUCCESS then afs_write_inode#(inode; err, dirs, files; asynced)}; if err ≠ ESUCCESS then n := (ino2 ≤ ino ⊃ ino - ino2;0), err := ESUCCESS; of[fd].pos := ino2 + n}}] (dirs1 = dirs → of-cons(of, dirs, files) ∧ dom of < ino ∧ afs-cons(dirs, files)), of[fd].mode ≠ MODE_W ∧ of[fd].mode ≠ MODE_RW

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 18:
of[fd] = mkfile(m, mode, m0), err = ESUCCESS, dom of < ino, afs-cons(dirs, files), of-cons(of, dirs, files), fd ∈ of, n ≤ # buf ⊦ [afs_iget#(m, dirs, files, asynced; inode, err); dirs1 := dirs; if err = ESUCCESS then if inode.directory then err := EISDIR else let ino2 = m0, ino1 = m0 + n, ino0 = 0, pageno = 0, buf-opt = none in {if err = ESUCCESS then pageno := inode.size / VFS_PAGE_SIZE; if err = ESUCCESS then afs_truncate#(inode.size, pageno; buf-opt, inode, isdir, err, dirs, files, asynced); if err = ESUCCESS then vfs_write_loop#(ino2, inode, ino1, buf, dirs; ino0, err, files, asynced); if ino0 ≠ 0 then err := ESUCCESS; if err = ESUCCESS then let ino = inode.size in {n := ino0, ino1 := ino2 + ino0; if ino0 ≠ 0 ∧ ino < ino1 then {inode.size := ino1; afs_check_commit#(dirs, files; err; asynced); if err = ESUCCESS then afs_write_inode#(inode; err, dirs, files; asynced)}; if err ≠ ESUCCESS then n := (ino2 ≤ ino ⊃ ino - ino2;0), err := ESUCCESS; of[fd].pos := ino2 + n}}] (dirs1 = dirs → of-cons(of, dirs, files) ∧ dom of < ino ∧ afs-cons(dirs, files)), n = 0, mode ≠ MODE_W ∧ mode ≠ MODE_RW

Rule argument

spec: file name: elim seq: ⊦ (m = file.ino ∧ mode = file.mode) ∧ m0 = file.pos ↔ file = mkfile(m, mode, m0) subst: [file, m, mode, m0] → [of[fd], m, mode, m0]

Additional information

Used simplifier rules: ⊦ (m = file.ino ∧ mode = file.mode) ∧ m0 = file.pos ↔ file = mkfile(m, mode, m0); (elim) Used terms: of[fd], m, mode, m0