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

root.dir?, dom of < ino, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), of-cons(of, dirs, files), psynced → asynced ⊦ ∃ err. pre-mkdir(ε, md, err, user, root, abs-files(files), abs-of(of)) ∧ ⟨err0 := err; if err0 = ESUCCESS then root := dnode(md, ∅); psynced := ?⟩ (abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ EEXISTS = err0)

Heuristic use patterns applied rule exists right

And obtained the following new goals

Proof step 13:
root.dir?, dom of < ino, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), of-cons(of, dirs, files), psynced → asynced ⊦ pre-mkdir(ε, md, EEXISTS, user, root, abs-files(files), abs-of(of)) ∧ ⟨err0 := EEXISTS; if err0 = ESUCCESS then root := dnode(md, ∅); psynced := ?⟩ (abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ EEXISTS = err0)

Rule argument

pos: right 1 terms: EEXISTS abort: T discard: T computed: F

Additional information

Used terms: EEXISTS