[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 lebs-rec
⊦ n + m < # avol → lebs(avol, n, m + 1) = lebs(avol, n, m) + (avol[n + m].mapped? ⊃ avol[n + m].data + mkempbuf(LEB_SIZE - # avol[n + m].data);mkempbuf(LEB_SIZE))
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
lebs-crash
,
lebs-idexpt-below
,
lebs-range-eq
,
lebs-size
,
lebs-size-mappedfull
,
lebs-write-above
,
lebs-write-below
,
lebs-write-last
,
Used by units in proved state:
persistence-io-asm
,
Proof exists?: No