[Imprint][Data Privacy Statement][E-Mail]

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,

Theorem base for Specification ring-buffer

This is a listing of all goals defined over the current specification. Axioms are yellow, proof obligations purple and theorems green. Click on individual names to get more information on the proof.

Name: Sequent: Type:
⊦ mk(ar, i, i0, i1) .len = i1 An Axiom
⊦ mk(ar, i, i0, i1) .first = i0 An Axiom
⊦ mk(ar, i, i0, i1) .size = i An Axiom
⊦ mk(ar, i, i0, i1) .data = ar An Axiom
⊦ mk(ar, i, i0, i1) = mk(ar0, i2, i3, i4) ↔ ar = ar0 ∧ i = i2 ∧ i0 = i3 ∧ i1 = i4 An Axiom
⊦ mk(buf .data, buf .size, buf .first, buf .len) = buf An Axiom
⊦ ar = buf .data ∧ i = buf .size ∧ i0 = buf .first ∧ i1 = buf .len ↔ buf = mk(ar, i, i0, i1) An Axiom
An Axiom
⊦ (buf .data:= ar) .data = ar An Axiom
⊦ (buf .size:= i) .data = buf .data An Axiom
⊦ (buf .first:= i0) .data = buf .data An Axiom
⊦ (buf .len:= i1) .data = buf .data An Axiom
⊦ (buf .data:= ar) .size = buf .size An Axiom
⊦ (buf .size:= i) .size = i An Axiom
⊦ (buf .first:= i0) .size = buf .size An Axiom
⊦ (buf .len:= i1) .size = buf .size An Axiom
⊦ (buf .data:= ar) .first = buf .first An Axiom
⊦ (buf .size:= i) .first = buf .first An Axiom
⊦ (buf .first:= i0) .first = i0 An Axiom
⊦ (buf .len:= i1) .first = buf .first An Axiom
⊦ (buf .data:= ar) .len = buf .len An Axiom
⊦ (buf .size:= i) .len = buf .len An Axiom
⊦ (buf .first:= i0) .len = buf .len An Axiom
⊦ (buf .len:= i1) .len = i1 An Axiom
⊦ mk(ar, i, i0, i1) .data:= ar0 = mk(ar0, i, i0, i1) An Axiom
⊦ mk(ar, i, i0, i1) .size:= i2 = mk(ar, i2, i0, i1) An Axiom
⊦ mk(ar, i, i0, i1) .first:= i3 = mk(ar, i, i3, i1) An Axiom
⊦ mk(ar, i, i0, i1) .len:= i4 = mk(ar, i, i0, i4) An Axiom