[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 bleaf
⊦ bnode(rp, zbrar, m, len, nused, 0, dirty, ri, iast, as, alladrs) = ( ⌜m + len ≤ nused ∧ nused ≤ # zbrar ∧ # zbrar = BRANCH_SIZE⌝ ∧ ⌜sorted(zbrar, 0, nused)⌝ ∧ ⌜ri = payload(zbrar, m, len)⌝ ∧ ⌜as = ∅⌝ ∧ ⌜alladrs = ∅⌝ ∧ emp)
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
btree-adrs
,
btree-clean-adr-in
,
btree-clean-alladrs
,
btree-clean-fwd
,
btree-clean-fwd-strong
,
btree-dirty-adr-notin
,
btree-inv-format
,
btree-istore-reduce-refed
,
btree-leaf-adr
,
btree-mark-dirty
,
btree-refed-subseteq-alladrs
,
btree-repl-dirty-address
,
btree-ri-unique
,
btree-write-node
,
btree-write-other
,
Used by units in proved state:
Proof exists?: No