[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 abs-nodes-base
⊦ abs-nodes(buf, m, [], lax, weak) ↔ # buf = 0 ∧ lax = [] ∨ (∃ buf0, buf1. buf = buf0 + buf1 ∧ abs-padding(buf0) ∧ abs-nodes(buf1, m + # buf0, [], lax, weak)) ∨ weak ∧ abs-failed(buf) ∧ lax = []
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
abs-failed-abs-nodes-h
,
abs-nodes-add-crash-aligned-h
,
abs-nodes-aligned-2headersize-h
,
abs-nodes-aligned-headersize-h
,
abs-nodes-append-h
,
abs-nodes-case-distinction-h
,
abs-nodes-crash-h
,
abs-nodes-elems-adr-length-h
,
abs-nodes-emptyheader-h
,
abs-nodes-mkbuf0-empty-h
,
abs-nodes-nospace-h
,
abs-nodes-nospace-header-h
,
abs-nodes-notrailer-h
,
abs-nodes-padding-prefix
,
abs-nodes-prefix-h
,
abs-nodes-subarray-failed
,
abs-nodes-unique-strong-h
,
abs-nodes-unique-weak-h
,
abs-nodes-valid-node
,
abs-padding-abs-nodes-h
,
Used by units in proved state:
persistence-refine
,
Proof exists?: No