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

err = ESUCCESS, dom of < ino1, afs-cons(dirs, files), ispath(p, ROOT_INO, ino0, dirs, files), of-cons(of, dirs, files), px-parent(user, p, ROOT_INO, dirs, files) ⊦ ⟪vfs_may_open#(ino0, false, mode, user, dirs, files, asynced; inode, err); if err = ESUCCESS then {of[ino1] := mkfile(ino0, mode, 0); fd := ino1; ino1 := ino1 + 1}⟫ (of-cons(of, dirs, files) ∧ dom of < ino1)

Heuristic weak unfold applied rule call right

And obtained the following new goals

Proof step 15:
⊦
Proof step 16:
isdir ↔ false, err = ESUCCESS, ino = ino0, dom of < ino1, afs-cons(dirs, files), ispath(p, ROOT_INO, ino0, dirs, files), of-cons(of, dirs, files), px-parent(user, p, ROOT_INO, dirs, files) ⊦ ⟪afs_iget#(ino, dirs, files, asynced; inode, err); if err = ESUCCESS then if ¬(inode.directory ↔ isdir) then err := (inode.directory ⊃ EISDIR;ENOTDIR) else if (mode = MODE_R ∨ mode = MODE_RW) ∧ ¬ pr(user, inode.meta) ∨ (mode = MODE_W ∨ mode = MODE_RW) ∧ ¬ pw(user, inode.meta) then err := EACCESS; if err = ESUCCESS then {of[ino1] := mkfile(ino0, mode, 0); fd := ino1; ino1 := ino1 + 1}⟫ (of-cons(of, dirs, files) ∧ dom of < ino1)

Rule argument

pos: right 1

Additional information

Used simplifier rules: may-open: ⊦ ;