[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 1 from proof read-unknown (conclusion) (back to tree)

((r =>_ * hP))(h) ⊦ ⟪read(r, h; o)⟫ true

Heuristic weak unfold applied rule call right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: read(r, h; o){if ¬ r ∈ h then abort else o := h[r]};

Proof step 2 from proof read-unknown (previous step) (back to tree)

((r =>_ * hP))(h) ⊦ ⟪if ¬ r ∈ h then abort else o := h[r]⟫ true

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: sep-ass: ⊦ (hP0 * hP1) * hP2 = hP0 * hP1 * hP2; from specification heap-sep sep-com: ⊦ hP0 * hP1 = hP1 * hP0; from specification heap-sep ⊦ ((r =>_ * hP))(h) → r ∈ h; (s)

Proof step 3 from proof read-unknown (previous step) (back to tree)

((r =>_ * hP))(h) ⊦ ⟪o := h[r]⟫ true

Heuristic symbolic execution applied rule assign right

And closed the goal!

Rule argument

Additional information

Proof Tree for read-unknown (View conclusion)

The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.

the proof tree