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