[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 23 from proof refine-rename-dir-dentry (previous step)

# links(m3, cache_dirs) = m12, # links(m, cache_dirs) = m9, # links(entries[str], cache_dirs) = m16, # links(entries1[str0], cache_dirs) = m1, cache_dirs[entries1[str0]] = mkdir(m0, md5, # links(entries1[str0], cache_dirs), m2, entries0), cache_dirs[entries[str]] = mkdir(m15, md3, # links(entries[str], cache_dirs), m17, ∅), cache_dirs[m] = mkdir(m8, md4, # links(m, cache_dirs), m10, entries), cache_dirs[m3] = mkdir(m7, md6, # links(m3, cache_dirs), m13, entries1), afs_dirs = cache_dirs, afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, err = err0, new_child_inode = mkinode(entries[str], md1, true, # links(entries[str], cache_dirs), m17, m15), new_dent = mkdentry(str, entries[str]), new_parent_inode = mkinode(m, md, true, # links(m, cache_dirs), m10, m8), old_child_inode = mkinode(entries1[str0], md2, true, # links(entries1[str0], cache_dirs), m2, m0), old_dent = mkdentry(str0, entries1[str0]), old_parent_inode = mkinode(m3, md0, true, # links(m3, cache_dirs), m13, m7), entries[str] ≠ ROOT_INO, afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons(cache_dirs, cache_files), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache), str ∈ entries, str0 ∈ entries1, entries[str] ∈ cache_dirs, entries1[str0] ∈ cache_dirs, m ∈ cache_dirs, m3 ∈ cache_dirs, m = m3 → md = md0, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO, links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO ⊦ ⟪cache_rename# (; old_parent_inode, new_parent_inode, old_child_inode, new_child_inode, old_dent, new_dent, err, cache_dirs, cache_files, cache_icache, cache_dcache, cache_asynced)⟫ ⟨new_dent0 := mkdentry(str, entries[str]); old_dent0 := mkdentry(str0, entries1[str0]); new_parent_inode0 := mkinode(m, md, true, m9, m10, m8); old_parent_inode0 := mkinode(m3, md0, true, m12, m13, m7); new_child_inode0 := mkinode(entries[str], md1, true, m16, m17, m15); old_child_inode0 := mkinode(entries1[str0], md2, true, m1, m2, m0); afs_rename# (; old_parent_inode0, new_parent_inode0, old_child_inode0, new_child_inode0, old_dent0, new_dent0, err0, afs_dirs, afs_files; afs_asynced)⟩ ( old_parent_inode = old_parent_inode0 ∧ new_parent_inode = new_parent_inode0 ∧ old_child_inode = old_child_inode0 ∧ new_child_inode = new_child_inode0 ∧ old_dent = old_dent0 ∧ new_dent = new_dent0 ∧ err = err0 ∧ afs_dirs = cache_dirs ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ cache_asynced))

User applied rule insert program lemma

And obtained the following new goals

Rule argument

spec: cache-asm name: inv-rename-dir-dentry seq: 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), valid-dentry(old_parent_inode.ino, old_dent, dirs, files), valid-dentry(new_parent_inode.ino, new_dent, dirs, files), valid-dir-inode(old_parent_inode, dirs, files), valid-dir-inode(new_parent_inode, dirs, files), valid-dir-inode(old_child_inode, dirs, files), valid-dir-inode(new_child_inode, dirs, files), new_parent_inode.ino = old_parent_inode.ino → new_parent_inode.meta = old_parent_inode.meta, old_child_inode.ino = old_dent.ino, new_child_inode.ino = new_dent.ino, new_dent.ino ≠ ROOT_INO ∧ dir-empty(new_dent.ino, dirs, files) ⊦ ⟪cache_rename# (; old_parent_inode, new_parent_inode, old_child_inode, new_child_inode, old_dent, new_dent, err, dirs, files, icache, dcache, asynced0)⟫ ( 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))) subst: [asynced0, dcache, icache, files, dirs, err, new_dent, old_dent, new_child_inode, old_child_inode, new_parent_inode, old_parent_inode, pcache, asynced] → [cache_asynced, cache_dcache, cache_icache, cache_files, cache_dirs, err, new_dent, old_dent, new_child_inode, old_child_inode, new_parent_inode, old_parent_inode, cache_pcache, cache_sync] flags: List([[1,0,0]])

Additional information

Used simplifier rules: ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)%⊦ valid-dentry(ino, dent, dirs, files) ↔ valid-parent-ino(ino, dirs, files) ∧ valid-ino(dent.ino, dirs, files) ∧ dent.name ∈ dirs[ino].entries ∧ dent.ino = dirs[ino].entries[dent.name] ∧ dent.dentry?; (s)%⊦ valid-parent-ino(ino, dirs, files) ↔ ino ∈ dirs ∧ (links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO); (s)% ⊦ mkdentry(str, m).ino = m; (s)% ⊦ valid-ino(ino, dirs, files) ↔ ino ∈ dirs ∨ ino ∈ files; (s)% ⊦ mkdentry(str, m).name = str; (s)% ⊦ mkdentry(str, m).dentry?; (s)%⊦ valid-dir-inode(inode, dirs, files) ↔ valid-dir-ino(inode.ino, dirs, files) ∧ inode.nlink = dirs[inode.ino].nlink ∧ inode.size = dirs[inode.ino].size ∧ inode.nsubdirs = dirs[inode.ino].nsubdirs ∧ inode.directory; (s)% ⊦ valid-dir-ino(ino, dirs, files) ↔ ino ∈ dirs; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nlink = m0; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nsubdirs = m1; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).directory ↔ boolvar; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)% ⊦ dir-empty(ino, dirs, files) ↔ dirs[ino].entries = ∅; (s)% ⊦ mkdir(m, md, m0, m1, entries).entries = entries; (s)% ⊦ mkdir(m, md, m0, m1, entries).nlink = m0; (s)% ⊦ mkdir(m, md, m0, m1, entries).size = m; (s)% ⊦ mkdir(m, md, m0, m1, entries).nsubdirs = m1; (s)