[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 lpt-free-unref
⊦ lpt-free-unref(lpt) ↔ (∀ n. n < # lpt ∧ lpt[n].flags = LP_FREE → lpt[n].ref-size = 0)
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
abs-gstore-crash
,
abs-istore-crash
,
free-unref-at
,
id-idx-lpt-free-unref
,
lpt-free-unref-cleanup-lpt
,
lpt-free-unref-remove-wbufs
,
lpt-free-unref-replay-log
,
lpt-free-unref-replay-lpt
,
lpt-free-unref-write
,
Used by units in proved state:
persistence-refine
,
persistence-asm
,
Proof exists?: No