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

⟨afs_lookup#(pageno, dirs1, files1, asynced0; dent, err)⟩ (dent = old_dent ∧ err = err0) ⊦ pageno ∈ dirs1 ∧ (links(pageno, dirs1) ≠ ∅ ∨ pageno = ROOT_INO)

Heuristic unfold applied rule call left

And obtained the following new goals

Proof step 36:
⟨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⟩ (dent = old_dent ∧ err = err0), asynced ↔ asynced0, dirs = dirs1, files = files1, p_ino = pageno ⊦ pageno ∈ dirs1 ∧ (links(pageno, dirs1) ≠ ∅ ∨ pageno = ROOT_INO)

Rule argument

pos: left 1

Additional information

Used simplifier rules: afs_lookup#(P_INO, DIRS, FILES, ASYNCED; DENT, ERR) {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 };