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

entries[str] ∈ dirs ↔ root[q + str '].dir?, dirs[ino1] = mkdir(# entries, md, # links(ino1, dirs), m1, entries), err = ESUCCESS, inode = mkinode(ino1, md, true, # links(ino1, dirs), m1, # entries), path' ≠ ε, root[q].dir?, root.dir?, dom of < ino0, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs, files), of-cons(of, dirs, files), px(user, md), px-parent(user, q, ROOT_INO, dirs, files), ino1 ∈ dirs, str ∈ entries, psynced → asynced, links(ino1, dirs) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ [afs_iget#(mkdentry(str, entries[str]).ino, dirs, files, asynced; inode, err); if err = ESUCCESS ∧ inode.directory then err := EISDIR; c_inode := inode; old_dent := mkdentry(str, dirs[ino1].entries[str]); err1 := err; if err1 = ESUCCESS then let ino = ROOT_INO, dent = negdentry(path'.last), path = parent(path') in {vfs_walk#(path, user, dirs, files, asynced; ino, err1); if err1 = ESUCCESS then vfs_may_create#(ino, dent, user, dirs, files, asynced; inode, err1); new_inode := inode, new_dent := dent}; if err1 = ESUCCESS then afs_check_commit#(dirs, files; err1; asynced); fs := abs-files(files); if err1 = ESUCCESS then afs_link#(old_dent; new_inode, c_inode, new_dent, err1, dirs, files; asynced)] ( of-cons(of, dirs, files) ∧ afs-cons(dirs, files) → ⟨posix_link#(q + str ', path', user, fs, abs-of(of); err0, root; psynced)⟩ (fs = abs-files(files) ∧ abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ err1 = err0))

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 110:
entries[str] ∈ dirs ↔ root[q + str '].dir?, dirs[ino1] = mkdir(# entries, md, # links(ino1, dirs), m1, entries), dirs[ino1] = mkdir(m, md0, m0, m2, entries0), err = ESUCCESS, inode = mkinode(ino1, md, true, # links(ino1, dirs), m1, # entries), root.dir?, root[q].dir?, dom of < ino0, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs, files), of-cons(of, dirs, files), px(user, md), px-parent(user, q, ROOT_INO, dirs, files), str ∈ entries, ino1 ∈ dirs, psynced → asynced, links(ino1, dirs) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ [afs_iget#(mkdentry(str, entries[str]).ino, dirs, files, asynced; inode, err); if err = ESUCCESS ∧ inode.directory then err := EISDIR; c_inode := inode; old_dent := mkdentry(str, entries0[str]); err1 := err; if err1 = ESUCCESS then let ino = ROOT_INO, dent = negdentry(path'.last), path = parent(path') in {vfs_walk#(path, user, dirs, files, asynced; ino, err1); if err1 = ESUCCESS then vfs_may_create#(ino, dent, user, dirs, files, asynced; inode, err1); new_inode := inode, new_dent := dent}; if err1 = ESUCCESS then afs_check_commit#(dirs, files; err1; asynced); fs := abs-files(files); if err1 = ESUCCESS then afs_link#(old_dent; new_inode, c_inode, new_dent, err1, dirs, files; asynced)] ( of-cons(of, dirs, files) ∧ afs-cons(dirs, files) → ⟨posix_link#(q + str ', path', user, fs, abs-of(of); err0, root; psynced)⟩ (fs = abs-files(files) ∧ abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ err1 = err0)), path' = ε

Rule argument

spec: abstract-dir name: elim seq: ⊦ ( ((m = ad.size ∧ md = ad.meta) ∧ m0 = ad.nlink) ∧ m1 = ad.nsubdirs) ∧ entries = ad.entries ↔ ad = mkdir(m, md, m0, m1, entries) subst: [ad, m, md, m0, m1, entries] → [dirs[ino1], m, md0, m0, m2, entries0]

Additional information

Used simplifier rules: ⊦ ( ((m = ad.size ∧ md = ad.meta) ∧ m0 = ad.nlink) ∧ m1 = ad.nsubdirs) ∧ entries = ad.entries ↔ ad = mkdir(m, md, m0, m1, entries); (elim) Used terms: dirs[ino1], m, md0, m0, m2, entries0