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

x = tolist(buf, i→n(buf .len)), buf .len < buf .size, inv(buf), 0 ≤ buf .len, 0 < buf .size ⊦ 〈push#(a; buf)〉 (inv(buf) ∧ abs(buf, x + a '))

User applied rule call right

And obtained the following new goals

Proof step 97:
x = tolist(buf, i→n(buf .len)), buf .len < buf .size, inv(buf), 0 ≤ buf .len, 0 < buf .size ⊦ 〈let j = (buf .first + buf .len) % buf .size in { buf0 := buf ; put#(j, a; buf0 .data) }〉〈buf0 := buf0 .len:= (buf0 .len + 1)〉 (inv(buf0) ∧ abs(buf0, x + a '))

Rule argument

[fmapos-arg: pos: right 1]

Additional information

[[CONCRETESIMPRULES : ([CSIMPDECL : push# (a; buf) { let j = ( buf .first + buf .len ) % buf .size in put#(j, a; buf .data) ; buf := buf .len:= (buf .len + 1) }])]]