[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 24 from proof inv-rename-file-dentry (previous step)

asynced1 ↔ asynced0, dirs[m0] = mkdir(m6, md6, # links(m0, dirs), m9, entries0), files[entries0[str0]] = mkfile(m4, md4, # links(entries0[str0], dirs), content0), files[entries[str]] = mkfile(m1, md3, # links(entries[str], dirs), content), dirs[m] = mkdir(m5, md5, # links(m, dirs), m7, entries), new_child_inode = mkinode(entries[str], md, false, # links(entries[str], dirs), 0, m2), new_dent = mkdentry(str, entries[str]), new_parent_inode = mkinode(m, md1, true, # links(m, dirs), m7, m5), old_child_inode = mkinode(entries0[str0], md0, false, # links(entries0[str0], dirs), 0, m3), old_dent = mkdentry(str0, entries0[str0]), old_parent_inode = mkinode(m0, md2, true, # links(m0, dirs), m9, m6), afs-cons(dirs, files), dcache-cons(dcache, dirs, files), icache-cons(icache, dirs, files), pcache-cons(pcache, dirs, files), synced(dirs, icache, pcache), entries0[str0] ∈ files, entries[str] ∈ files, m0 ∈ dirs, m ∈ dirs, str0 ∈ entries0, str ∈ entries, asynced → synced(files, icache, pcache), m = m0 → md1 = md2, links(m0, dirs) ≠ ∅ ∨ m0 = ROOT_INO, links(m, dirs) ≠ ∅ ∨ m = ROOT_INO ⊦ ⟪if pre-rename(old_parent_inode, old_dent, old_child_inode, new_parent_inode, new_dent, new_child_inode, dirs, files) then let asynced0 = new_dent.dentry? in {afs_rename#(; old_parent_inode, new_parent_inode, old_child_inode, new_child_inode, old_dent, new_dent, err, dirs, files; asynced1); if err = ESUCCESS then let asynced = false in {icache_set#(old_parent_inode, asynced; err, icache); icache_set#(new_parent_inode, asynced; err, icache); if asynced0 then icache_set#(new_child_inode, asynced; err, icache); dcache_delete#(old_parent_inode.ino, old_dent.name; err, dcache); dcache_set#(new_parent_inode.ino, new_dent.name, new_dent; err, dcache)}} else abort⟫ ( icache-cons(icache, dirs, files) ∧ dcache-cons(dcache, dirs, files) ∧ pcache-cons(pcache, dirs, files) ∧ afs-cons(dirs, files) ∧ synced(dirs, icache, pcache) ∧ (asynced → synced(files, icache, pcache)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 25:
dirs[m] = mkdir(m5, md5, # links(m, dirs), m7, entries), files[entries[str]] = mkfile(m1, md3, # links(entries[str], dirs), content), files[entries0[str0]] = mkfile(m4, md4, # links(entries0[str0], dirs), content0), dirs[m0] = mkdir(m6, md6, # links(m0, dirs), m9, entries0), afs-cons(dirs, files), dcache-cons(dcache, dirs, files), icache-cons(icache, dirs, files), pcache-cons(pcache, dirs, files), synced(dirs, icache, pcache), str ∈ entries, str0 ∈ entries0, m ∈ dirs, m0 ∈ dirs, entries[str] ∈ files, entries0[str0] ∈ files, m = m0 → md1 = md2, asynced → synced(files, icache, pcache), links(m, dirs) ≠ ∅ ∨ m = ROOT_INO, links(m0, dirs) ≠ ∅ ∨ m0 = ROOT_INO ⊦ ⟪if pre-rename (mkinode(m0, md2, true, # links(m0, dirs), m9, m6), mkdentry(str0, entries0[str0]), mkinode(entries0[str0], md0, false, # links(entries0[str0], dirs), 0, m3), mkinode(m, md1, true, # links(m, dirs), m7, m5), mkdentry(str, entries[str]), mkinode(entries[str], md, false, # links(entries[str], dirs), 0, m2), dirs, files) then let asynced0 = true in {old_parent_inode := mkinode(m0, md2, true, # links(m0, dirs), m9, m6); old_dent := mkdentry(str0, entries0[str0]); old_child_inode := mkinode(entries0[str0], md0, false, # links(entries0[str0], dirs), 0, m3); new_parent_inode := mkinode(m, md1, true, # links(m, dirs), m7, m5); new_dent := mkdentry(str, entries[str]); new_child_inode := mkinode(entries[str], md, false, # links(entries[str], dirs), 0, m2); afs_rename#(; old_parent_inode, new_parent_inode, old_child_inode, new_child_inode, old_dent, new_dent, err, dirs, files; asynced1); if err = ESUCCESS then let asynced = false in {icache_set#(old_parent_inode, asynced; err, icache); icache_set#(new_parent_inode, asynced; err, icache); if asynced0 then icache_set#(new_child_inode, asynced; err, icache); dcache_delete#(old_parent_inode.ino, old_dent.name; err, dcache); dcache_set#(new_parent_inode.ino, new_dent.name, new_dent; err, dcache)}} else abort⟫ ( icache-cons(icache, dirs, files) ∧ dcache-cons(dcache, dirs, files) ∧ pcache-cons(pcache, dirs, files) ∧ afs-cons(dirs, files) ∧ synced(dirs, icache, pcache) ∧ (asynced → synced(files, icache, pcache)))

Rule argument

Additional information

Used simplifier rules: ⊦ mkdentry(str, m).dentry?; (s)