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

files[entries0[str]] = mkfile(m, md, # links(entries0[str], dirs), content), dirs[ino0] = mkdir(m0, md0, # links(ino0, dirs), m3, entries0), p ≠ ε, afs-cons(dirs, files), ispath(q, ROOT_INO, ino0, dirs, files), ispath(parent(p), ROOT_INO, ino1, dirs, files), of-cons(of, dirs, files), px(user, md0), px-parent(user, q, ROOT_INO, dirs, files), px-parent(user, parent(p), ROOT_INO, dirs, files), str ∈ entries0, entries0[str] ∈ files, ino0 ∈ dirs, ¬ entries0[str] ∈ dirs, links(ino0, dirs) ≠ ∅ ∨ ino0 = ROOT_INO, ino1 ∈ dirs ∨ ino1 ∈ files ⊦ ⟪fail#(; ; err); inode := mkinode(entries0[str], md, false, # links(entries0[str], dirs), 0, m); if err = ESUCCESS then if ¬ inode.directory then err := ENOTDIR else if ¬ px(user, inode.meta) ∨ ¬ pw(user, inode.meta) then err := EACCESS else {dent := negdentry(p.last); afs_lookup#(ino1, dirs, files, asynced; dent, err); if err = ESUCCESS then err := EEXISTS else if err = ENOENT then err := ESUCCESS}; new_inode := inode, new_dent := negdentry(p.last); err0 := err; if err0 = ESUCCESS then afs_check_commit#(dirs, files; err0; asynced); if err0 = ESUCCESS then {c_inode := getinode(mkdentry(str, entries0[str]).ino, dirs, files); afs_link#(mkdentry(str, entries0[str]); new_inode, c_inode, new_dent, err0, dirs, files; asynced)}⟫ (of-cons(of, dirs, files) ∧ afs-cons(dirs, files))

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 241:
dirs[ino0] = mkdir(m0, md0, # links(ino0, dirs), m3, entries0), files[entries0[str]] = mkfile(m, md, # links(entries0[str], dirs), content), afs-cons(dirs, files), ispath(parent(p), ROOT_INO, ino1, dirs, files), ispath(q, ROOT_INO, ino0, dirs, files), of-cons(of, dirs, files), px(user, md0), px-parent(user, parent(p), ROOT_INO, dirs, files), px-parent(user, q, ROOT_INO, dirs, files), ino0 ∈ dirs, entries0[str] ∈ files, str ∈ entries0, ino1 ∈ dirs ∨ ino1 ∈ files, links(ino0, dirs) ≠ ∅ ∨ ino0 = ROOT_INO ⊦ ⟪choose err0 with ⌊err0⌋ in err := err0; inode := mkinode(entries0[str], md, false, # links(entries0[str], dirs), 0, m); if err = ESUCCESS then if ¬ inode.directory then err := ENOTDIR else if ¬ px(user, inode.meta) ∨ ¬ pw(user, inode.meta) then err := EACCESS else {dent := negdentry(p.last); afs_lookup#(ino1, dirs, files, asynced; dent, err); if err = ESUCCESS then err := EEXISTS else if err = ENOENT then err := ESUCCESS}; new_inode := inode, new_dent := negdentry(p.last); err0 := err; if err0 = ESUCCESS then afs_check_commit#(dirs, files; err0; asynced); if err0 = ESUCCESS then {c_inode := getinode(mkdentry(str, entries0[str]).ino, dirs, files); afs_link#(mkdentry(str, entries0[str]); new_inode, c_inode, new_dent, err0, dirs, files; asynced)}⟫ (of-cons(of, dirs, files) ∧ afs-cons(dirs, files)), p = ε, entries0[str] ∈ dirs

Rule argument

pos: right 1

Additional information

Used simplifier rules: fail#(; ; ERR){choose ERR0 with ⌊ERR0⌋ in ERR := ERR0};