[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 6 from proof crash-neutral-unlink (previous step)

root.dir?, fids-cons(root, fs, ofh), posix-crash(root, fs, ofh, tree, fs0, ofh0) ⊦ ∃ err. pre-unlink(path, err, user, root, fs, ofh) ∧ ⟨err0 := err; if err0 = ESUCCESS then let fid = root[path].fid in {root := root -- path; if ¬ fid ∈ ofh.fids ∧ ¬ fid ∈ root.fids then fs := fs -- fid}; psynced := ?⟩ (psynced ∧ posix-crash(root, fs, ofh, tree, fs0, ofh0))

Heuristic use patterns applied rule exists right

And obtained the following new goals

Proof step 7:
root.dir?, fids-cons(root, fs, ofh), posix-crash(root, fs, ofh, tree, fs0, ofh0) ⊦ pre-unlink(path, EFAIL, user, root, fs, ofh) ∧ ⟨err0 := EFAIL; if err0 = ESUCCESS then let fid = root[path].fid in {root := root -- path; if ¬ fid ∈ ofh.fids ∧ ¬ fid ∈ root.fids then fs := fs -- fid}; psynced := ?⟩ (psynced ∧ posix-crash(root, fs, ofh, tree, fs0, ofh0)), ∃ err. pre-unlink(path, err, user, root, fs, ofh) ∧ ⟨err0 := err; if err0 = ESUCCESS then let fid = root[path].fid in {root := root -- path; if ¬ fid ∈ ofh.fids ∧ ¬ fid ∈ root.fids then fs := fs -- fid}; psynced := ?⟩ (psynced ∧ posix-crash(root, fs, ofh, tree, fs0, ofh0))

Rule argument

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

Additional information

Used terms: EFAIL