[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 67 from proof test (previous step)

buf0 = mk(mkarray(i→n(2)), 2, 0, 0) ⊦ ⟪push#(a; buf0)⟫ ⟪push#(b; buf0) ; pop#(; buf0, a0) ; assert#(a0 = a) ; push#(c; buf0) ; pop#(; buf0, a0) ; assert#(a0 = b) ; pop#(; buf0, a0) ; assert#(a0 = c)⟫ true

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 66:
buf0 = mk(mkarray(i→n(2)), 2, 0, 0) ⊦ ⟪let j = (buf0 .first + buf0 .len) % buf0 .size in { buf := buf0 ; put#(j, a; buf .data) }⟫ ⟪buf := buf .len:= (buf .len + 1)⟫ ⟪push#(b; buf) ; pop#(; buf, a0) ; assert#(a0 = a) ; push#(c; buf) ; pop#(; buf, a0) ; assert#(a0 = b) ; pop#(; buf, a0) ; assert#(a0 = c)⟫ true

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) }])]]