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

root.dir?, fids-cons(root, fs, ofh), posix-crash(root, fs, ofh, tree, fs0, ofh0), n ≤ # buf ⊦ ⟨n := ?; psynced := ?⟩ (psynced ∧ posix-crash(root, fs, ofh, tree, fs0, ofh0)), ∃ err. pre-write(fd, buf, n, err, user, root, fs, ofh) ∧ ⟨err0 := err; if err0 = ESUCCESS then let fh = ofh[fd] in let f = fs[fh.fid] in choose n1 with n1 ≤ n in {n := n1; f.content := splice(buf, 0, f.content, fh.pos, n); fs[fh.fid] := f; ofh[fd].pos := fh.pos + n} else n := ?; psynced := ?⟩ (psynced ∧ posix-crash(root, fs, ofh, tree, fs0, ofh0))

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 12:
root.dir?, fids-cons(root, fs, ofh), posix-crash(root, fs, ofh, tree, fs0, ofh0), n0 ≤ # buf ⊦ ∃ n. ⟨psynced := ?⟩ (psynced ∧ posix-crash(root, fs, ofh, tree, fs0, ofh0)), ∃ err. pre-write(fd, buf, n0, err, user, root, fs, ofh) ∧ ⟨err0 := err; if err0 = ESUCCESS then let fh = ofh[fd] in let f = fs[fh.fid] in choose n1 with n1 ≤ n0 in {n0 := n1; f.content := splice(buf, 0, f.content, fh.pos, n0); fs[fh.fid] := f; ofh[fd].pos := fh.pos + n0} else n0 := ?; psynced := ?⟩ (psynced ∧ posix-crash(root, fs, ofh, tree, fs0, ofh0))

Proof step 11 from proof crash-neutral-write (previous step)

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information