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

buf = buf0, err = err0, n = n0, ofh = abs-of(of), root.dir?, dom of < ino, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), of-cons(of, dirs, files), n0 ≤ # buf0, psynced → asynced ⊦ [vfs_read#(fd, user, dirs, files, asynced; buf, n, err, of)] ( of-cons(of, dirs, files) ∧ dom of < ino → ⟨posix_read#(fd, user, root, abs-files(files); buf0, n0, err0, ofh)⟩ (ofh = abs-of(of) ∧ (psynced → asynced) ∧ buf = buf0 ∧ n = n0 ∧ err = err0))

Heuristic unfold applied rule call right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: vfs_read#(FD, USER, DIRS, FILES, ASYNCED; BUF, N, ERR, OF) {if N ≤ # BUF then {ERR := ESUCCESS; if ¬ FD ∈ OF then ERR := EBADFD else if OF[FD].mode ≠ MODE_R ∧ OF[FD].mode ≠ MODE_RW then ERR := EBADFD else choose INODE 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 START = OF[FD].pos, END = OF[FD].pos + N, TOTAL = 0 in if START ≤ INODE.size then {let DONE = false in vfs_read_loop# (START, END, INODE, DONE, DIRS, FILES, ASYNCED ; BUF, TOTAL, ERR); if TOTAL ≠ 0 then ERR := ESUCCESS; OF[FD].pos := OF[FD].pos + TOTAL; N := TOTAL} else N := 0}} else abort };