[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
,
Theorem process-one
tree_buffer_heap_process_one#(; H, to_delete) {if to_delete ≠ [] then 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} }
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
implementation-refines-caterpillar
,
Proof exists?: No