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

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), ¬ fd ∈ of, psynced → asynced ⊦ ∃ err. pre-seek(fd, n, whence, err, user, root, abs-files(files), ofh) ∧ ⟨err0 := err; if err0 = ESUCCESS then let fh = ofh[fd] in let f = abs-files(files)[fh.fid] in {if whence = SEEK_CUR then n := fh.pos + n else if whence = SEEK_END then n := # f.content + n; ofh[fd] := mkfh(ofh[fd].fid, ofh[fd].mode, n)}⟩ (ofh = abs-of(of) ∧ (psynced → asynced) ∧ n0 = n ∧ EBADFD = err0)

Heuristic use patterns applied rule exists right

And obtained the following new goals

Proof step 12:
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), psynced → asynced ⊦ pre-seek(fd, n, whence, EBADFD, user, root, abs-files(files), ofh) ∧ ⟨err0 := EBADFD; if err0 = ESUCCESS then let fh = ofh[fd] in let f = abs-files(files)[fh.fid] in {if whence = SEEK_CUR then n := fh.pos + n else if whence = SEEK_END then n := # f.content + n; ofh[fd] := mkfh(ofh[fd].fid, ofh[fd].mode, n)}⟩ (ofh = abs-of(of) ∧ (psynced → asynced) ∧ n0 = n ∧ EBADFD = err0), fd ∈ of

Rule argument

pos: right 1 terms: EBADFD abort: T discard: T computed: F

Additional information

Used terms: EBADFD