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

ino = ROOT_INO, dom of < ino1, afs-cons(dirs, files), of-cons(of, dirs, files) ⊦ [vfs_walk#(p, user, dirs, files, asynced; ino, err)] ( ⌊err⌋ ∨ err = ESUCCESS ∧ ispath(p, ROOT_INO, ino, dirs, files) ∧ px-parent(user, p, ROOT_INO, dirs, files) ∨ err = ENOENT ∧ ¬ ispath(p, ROOT_INO, dirs, files) ∨ err = EACCESS ∧ p ≠ ε ∧ (∃ p'. p' ⊑ parent(p) ∧ ispath(p', ROOT_INO, dirs, files) ∧ ¬ px(user, p', ROOT_INO, dirs, files)) → ⟪if err = ESUCCESS then let isdir = false in vfs_may_open#(ino, isdir, mode, user, dirs, files, asynced; inode, err); if err = ESUCCESS then {of[ino1] := mkfile(ino, mode, 0); fd := ino1; ino1 := ino1 + 1}⟫ (of-cons(of, dirs, files) ∧ dom of < ino1))

User applied rule skip call

And obtained the following new goals

Rule argument

pos: right 1

Additional information