[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 valid-eraseqw
⊦ valid-eraseq(wlar, q) ↔ (∀ n. n ∈ q ↔ n < # wlar ∧ wlar[n].status = erasing)
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
valid-eraseq-array-0
,
valid-eraseq-next-erasing
,
valid-eraseq-prev-erasing
,
valid-eraseqp-in
,
valid-eraseqp-in0
,
valid-eraseqw-free
,
valid-eraseqw-free-in
,
valid-eraseqw-size-left
,
valid-eraseqw-size-middle
,
valid-eraseqw-subarray-shift
,
valid-eraseqw-unmap
,
valid-eraseqw-update-ec
,
valid-eraseqw-use
,
Used by units in proved state:
ubi-asm
,
ubi-crash-recovery-base
,
Proof exists?: No