[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 4 from proof process-one (previous step)

((del-list(to_delete, n) * P))(H) ⊦ ⟪let r = to_delete.head in {to_delete := to_delete.tail; if H[r].nxt ≠ null then to_delete := H[r].nxt + to_delete; H := H -- r}⟫ ((1 ≤ n → ((del-list(to_delete, n - 1) * P))(H)) ∧ (n = 0 → to_delete = [] ∧ P(H))), to_delete = []

Heuristic symbolic execution applied rule let right

And obtained the following new goals

Proof step 5:
r = to_delete.head, ((del-list(to_delete, n) * P))(H) ⊦ ⟪to_delete := to_delete.tail; if H[r].nxt ≠ null then to_delete := H[r].nxt + to_delete; H := H -- r⟫ ((1 ≤ n → ((del-list(to_delete, n - 1) * P))(H)) ∧ (n = 0 → to_delete = [] ∧ P(H))), to_delete = []
Proof step 41:
to_delete = [], ((del-list(to_delete, n) * P))(H) ⊦ to_delete = []

Proof step 4 from proof process-one (previous step)

Heuristic symbolic execution applied rule let right

And obtained the following new goals

Rule argument

Additional information