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

¬ asynced, name = dent.name, afs-cons(dirs, files), dcache-cons(dcache, dirs, files), icache-cons(icache, dirs, files), pcache-cons(pcache, dirs, files), synced(dirs, icache, pcache), p_ino ∈ dirs, asynced1 → synced(files, icache, pcache), links(p_ino, dirs) ≠ ∅ ∨ p_ino = ROOT_INO ⊦ ⟪dcache_get#(p_ino, dent.name, dcache; asynced, dent, err); if ¬ asynced ∨ err ≠ ESUCCESS then {afs_lookup#(p_ino, dirs, files, asynced0; dent, err); if err = ESUCCESS then dcache_set#(p_ino, name, dent; err, dcache)}⟫ dcache-cons(dcache, dirs, files)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 8:
¬ asynced, name = dent.name, name0 = dent.name, afs-cons(dirs, files), dcache-cons(dcache, dirs, files), icache-cons(icache, dirs, files), pcache-cons(pcache, dirs, files), synced(dirs, icache, pcache), p_ino ∈ dirs, asynced1 → synced(files, icache, pcache), links(p_ino, dirs) ≠ ∅ ∨ p_ino = ROOT_INO ⊦ ⟪let key = dentrykey(p_ino, name) in if key ∈ dcache then {dent := dcache[key]; asynced := true} else asynced := false; err := ESUCCESS; if ¬ asynced ∨ err ≠ ESUCCESS then {afs_lookup#(p_ino, dirs, files, asynced0; dent, err); if err = ESUCCESS then dcache_set#(p_ino, name0, dent; err, dcache)}⟫ dcache-cons(dcache, dirs, files)

Rule argument

pos: right 1

Additional information

Used simplifier rules: dcache_get#(P_INO, NAME, DCACHE; HIT, DENT, ERR) {let KEY = dentrykey(P_INO, NAME) in if KEY ∈ DCACHE then {DENT := DCACHE[KEY]; HIT := true} else HIT := false; ERR := ESUCCESS };