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

# links(entries0[str], dirs0) = m2 + 1, files0[entries0[str]] = mkfile(m1, md1, m2 + 1, content0), dirs0[m] = mkdir(m0, md2, # links(m, dirs0), m4, entries0), dirs = dirs0[m, mkdir(m0 - 1, md2, # links(m, dirs0), m4, entries0 -- str)], files = files0[entries0[str], mkfile(m1, md1, m2, content0)], ino = inode.ino, inode = mkinode(m, md, true, # links(m, dirs0), m4, m0), afs-cons(dirs0, files0), dcache-cons(dcache, dirs0, files0), icache-cons(icache, dirs0, files0), pcache-cons(pcache, dirs0, files0), synced(dirs0, icache, pcache), entries0[str] ∈ files0, str ∈ entries0, m ∈ dirs0, 1 ≤ m0, asynced1 → synced(files0, icache, pcache), links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO ⊦ [if ino ∈ dirs then dirs[ino].meta := inode.meta; afs_inode_sync#(mkinode(entries0[str], md0, false, # links(entries0[str], dirs0), 0, m3); dirs, files); p_inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ); c_inode := getinode(entries0[str], dirs, files); err := ESUCCESS; asynced := ?] ( afs-cons(dirs, files) → ⟪if err = ESUCCESS then let asynced = false in {icache_set#(c_inode, asynced; err, icache); icache_set#(p_inode, asynced; err, icache); dcache_delete#(p_inode.ino, mkdentry(str, entries0[str]).name; err, dcache)}⟫ ( icache-cons(icache, dirs, files) ∧ dcache-cons(dcache, dirs, files) ∧ pcache-cons(pcache, dirs, files) ∧ synced(dirs, icache, pcache) ∧ (asynced1 → synced(files, icache, pcache)))), m0 = 0, ino ∈ files

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information