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

psynced0 ↔ psynced, m = LEB_SIZE ⊦ ⟪if m = LEB_SIZE then { root := dnode(md, ∅), fs := ∅, ofh := ∅, psynced := true, err0 := ESUCCESS or {root := ?, fs := ?, ofh := ?, psynced := ?; choose err with ⌊err⌋ in err0 := err}} else abort⟫ (err0 = ESUCCESS → psynced ∧ root.dir? ∧ fids-cons(root, fs, ofh))

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 4:
psynced0 ↔ psynced, m = LEB_SIZE ⊦ ⟪ root := dnode(md, ∅), fs := ∅, ofh := ∅, psynced := true, err0 := ESUCCESS or {root := ?, fs := ?, ofh := ?, psynced := ?; choose err with ⌊err⌋ in err0 := err}⟫ (err0 = ESUCCESS → psynced ∧ root.dir? ∧ fids-cons(root, fs, ofh))

Proof step 3 from proof inv-format (previous step)

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Rule argument

Additional information