[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 avol-cleanup-lpt-unchanged
⊦ avol-cleanup-lpt-unchanged(avol0, avol1, lpt) ↔ # avol0 = # avol1 ∧ # avol0 = # lpt ∧ (∀ n. n < # avol0 ∧ (lpt[n].ref-size ≠ 0 ∨ lpt[n].flags = LP_FREE) → avol0[n] = avol1[n])
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
abs-gstore-cleanup-lpt
,
abs-istore-cleanup-lpt
,
avol-cleanup-lpt-unchanged-extract-right
,
avol-cleanup-lpt-unchanged-refl
,
Used by units in proved state:
persistence-asm
,
Proof exists?: No