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

dirs0 = dirs, afs-cons(dirs, files), of-cons(of, dirs, files), n ≤ # buf ⊦ ⟪vfs_write#(fd, buf, user; n, err, of, dirs, files, asynced)⟫ (dirs0 = dirs)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 3:
⊦
Proof step 4:
dirs0 = dirs, afs-cons(dirs, files), of-cons(of, dirs, files), n ≤ # buf ⊦ ⟪if n ≤ # buf then {err := ESUCCESS; if ¬ fd ∈ of then err := EBADFD else if of[fd].mode ≠ MODE_W ∧ of[fd].mode ≠ MODE_RW then err := EBADFD else if n ≠ 0 then choose inode, isdir with true in {afs_iget#(of[fd].ino, dirs, files, asynced; inode, err); 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}}}} else abort⟫ (dirs0 = dirs)

Rule argument

pos: right 1

Additional information

Used simplifier rules: write: ⊦ ;