[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 62 from proof pop-corr (previous step)

buf .len = 1 + n→i(# x), a ' + x = tolist(buf, i→n(buf .len)), inv(buf) ⊦ 〈get#(buf .first, buf .data; a0)〉〈buf0 := buf .first:= ((buf .first + 1) % buf .size) ; buf0 := buf0 .len:= (buf0 .len - 1)〉 (inv(buf0) ∧ abs(buf0, x) ∧ a = a0)

Heuristic weak unfold applied rule call right

And obtained the following new goals

Proof step 61:
buf .len = 1 + n→i(# x), a ' + x = tolist(buf, i→n(buf .len)), inv(buf) ⊦ 〈a1 := a0, ar := buf .data, i := buf .first〉〈if 0 ≤ i ∧ i < n→i(# ar) then a1 := ar[i→n(i)] else abort〉〈buf0 := buf .first:= ((buf .first + 1) % buf .size) ; buf0 := buf0 .len:= (buf0 .len - 1)〉 (inv(buf0) ∧ abs(buf0, x) ∧ a = a1)

Rule argument

[fmapos-arg: pos: right 1]

Additional information

[[CONCRETESIMPRULES : ([CSIMPDECL : get# (i, ar; a) { if 0 ≤ i ∧ i < n→i(# ar) then a := ar[i→n(i)] else abort }])]]