[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 ls-abs-node-buf-size
⊦ abs-node(buf, nd) → # buf = nd.alignedsize + 2 * NODE_HEADER_SIZE
Type: A user defined theorem
Validity: The proof is valid.
Features: localforward,
Comment:
Used by:
abs-nodes-add-crash-aligned
,
abs-nodes-add-crash-aligned-h
,
abs-nodes-add-crash-aligned-nodes
,
abs-nodes-aligned-2headersize-h
,
abs-nodes-aligned-headersize-h
,
abs-nodes-append-h
,
abs-nodes-at-least-flashsize
,
abs-nodes-before-no-address-h
,
abs-nodes-beyond-no-address-h
,
abs-nodes-case-distinction-h
,
abs-nodes-crash-h
,
abs-nodes-elems-adr-length-h
,
abs-nodes-emptyheader-h
,
abs-nodes-first-adr-explicit
,
abs-nodes-no-padding-last
,
abs-nodes-no-padding-one
,
abs-nodes-no-padding-rec
,
abs-nodes-nodups-h
,
abs-nodes-nospace-header-h
,
abs-nodes-notrailer-h
,
abs-nodes-one-abs-node
,
abs-nodes-one-h
,
abs-nodes-prefix-h
,
abs-nodes-split-h
,
abs-nodes-subarray-failed
,
abs-nodes-unique-strong-h
,
abs-nodes-unique-weak-h
,
abs-nodes-valid-node
,
abs-padding-abs-nodes-h
,
abs-split-by-address
,
abs-split-by-address-h
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 3
Used lemmas:
Used spec theorems:
abs-node
/
abs-node
Used simplifier rules:
array-splice
/buffer/
append-len
node-header-size
/
validtrailer-size
array-splice
/buffer/
append-a
nat-mult
/
numeral-19
nat-mult
/
one
nat-mult
/
mult-a
nat-mult
/
mult-c
nat-basic
/
a
nat-basic
/
c
abs-node
/
lfw-is-encoded-nodeheader-size
nat-basic
/
eq-01