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

asynced ↔ cache_asynced, cache_dirs[p_ino] = mkdir(m, md, # links(p_ino, cache_dirs), m1, entries), dent = dent0, dent1 = negdentry(dent0.name), dirs = cache_dirs, err = err0, files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), 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), p_ino ∈ cache_dirs, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(p_ino, cache_dirs) ≠ ∅ ∨ p_ino = ROOT_INO ⊦ ⟨if pre-lookup(p_ino, dent, dirs, files) then { if dent.name ∈ dirs[p_ino].entries then {dent := mkdentry(dent.name, dirs[p_ino].entries[dent.name]); err := ESUCCESS} else {dent := negdentry(dent.name); err := ENOENT} or fail#(; ; err)} else abort⟩ (dent1 = dent ∧ ENOENT = err), dent0.name ∈ entries, dentrykey(p_ino, dent0.name) ∈ cache_dcache

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 79:
asynced ↔ cache_asynced, cache_dirs[p_ino] = mkdir(m, md, # links(p_ino, cache_dirs), m1, entries), dent = dent0, dent1 = negdentry(dent0.name), dirs = cache_dirs, err = err0, files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, 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), p_ino ∈ cache_dirs, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(p_ino, cache_dirs) ≠ ∅ ∨ p_ino = ROOT_INO ⊦ ⟨ if dent.name ∈ dirs[p_ino].entries then {dent := mkdentry(dent.name, dirs[p_ino].entries[dent.name]); err := ESUCCESS} else {dent := negdentry(dent.name); err := ENOENT} or fail#(; ; err)⟩ (dent1 = dent ∧ ENOENT = err), dentrykey(p_ino, dent0.name) ∈ cache_dcache, dent0.name ∈ entries

Rule argument

Additional information

Used simplifier rules: ⊦ pre-lookup(p_ino, dent, dirs, files) ↔ valid-parent-ino(p_ino, dirs, files); (s)%⊦ valid-parent-ino(ino, dirs, files) ↔ ino ∈ dirs ∧ (links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO); (s)