[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-beyond-no-address-h
⊦ abs-nodes(buf, m, x, lax, boolvar) ∧ # buf + m ≤ m0 → ¬ @(m0, m1) ∈ lax
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
abs-nodes-atend-no-address
,
abs-nodes-beyond-no-address
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 18
Used lemmas:
abs-nodes-nospace-h
,
ls-abs-node-buf-size
,
abs-nodes-rec
,
abs-nodes-elems-empty-adr-empty-h
,
Used spec theorems:
Used simplifier rules:
list
/
c
list
/laddress-list/
in-empty
list-data
/laddress-list/
elim-list-c
list
/laddress-list/
e-01
list
/laddress-list/
c
laddress
/
elim
list
/laddress-list/
in-rec
list
/laddress-list/
a
nat-basic
/
add-base
abs-node
/
abs-padding-mkbuf0
laddress
/
inj
nat-basic
/
zero
nat-basic
/
a
nat-basic
/
c
array-splice
/buffer/
append-len
array-splice
/buffer/
append-a
nat
/
lels
nat
/
le-add
abs-node
/
buf-size-zero
array
/buffer/
Size-mkarray
nat-basic
/
z-01
nat-mult
/
two-zero-01
node-header-size
/
nodeheader-notzero
nat-mult
/
mult-a
nat-mult
/
mult-c