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

err = ESUCCESS, afs-cons(dirs, files), ispath(q, ROOT_INO, ino0, dirs, files), of-cons(of, dirs, files), px-parent(user, q, ROOT_INO, dirs, files) ⊦ ⟪vfs_may_create#(ino0, negdentry((q + str ').last), user, dirs, files, asynced; inode, err); if err = ESUCCESS then afs_check_commit#(dirs, files; err; asynced); if err = ESUCCESS then {dent := negdentry((q + str ').last); afs_create#(md; inode, c_inode, dent, err, dirs, files; asynced)}⟫ (of-cons(of, dirs, files) ∧ afs-cons(dirs, files))

User applied rule call right

And obtained the following new goals

Proof step 18:
⊦
Proof step 19:
dent = negdentry((q + str ').last), err = ESUCCESS, ino = ino0, afs-cons(dirs, files), ispath(q, ROOT_INO, ino0, dirs, files), of-cons(of, dirs, files), px-parent(user, q, ROOT_INO, dirs, files) ⊦ ⟪afs_iget#(ino, dirs, files, asynced; inode, err); if err = ESUCCESS then if ¬ inode.directory then err := ENOTDIR else if ¬ px(user, inode.meta) ∨ ¬ pw(user, inode.meta) then err := EACCESS else {afs_lookup#(ino, dirs, files, asynced; dent, err); if err = ESUCCESS then err := EEXISTS else if err = ENOENT then err := ESUCCESS}; if err = ESUCCESS then afs_check_commit#(dirs, files; err; asynced); if err = ESUCCESS then {dent := negdentry((q + str ').last); afs_create#(md; inode, c_inode, dent, err, dirs, files; asynced)}⟫ (of-cons(of, dirs, files) ∧ afs-cons(dirs, files)), q + str ' = ε

Rule argument

pos: right 1

Additional information

Used simplifier rules: may-create: ⊦ ;% ⊦ p + p0 = ε ↔ p = ε ∧ p0 = ε; (as)% ⊦ str ' ≠ ε; (s)%a: ⊦ (p + p0) + p1 = p + p0 + p1; from specification list[path]