[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 abs-istore-def
⊦ abs-istore(avol, lpt, istore) ↔ (∀ n. (n < # lpt ∧ lpt[n].flags = LP_INDEX_NODES ↔ n ∈ istore) ∧ (n ∈ istore → abs-leb(avol[n], istore[n], lpt[n]) ∧ lpt[n].ref-size = istore[n].ref-size))
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
abs-gstore-crash
,
abs-istore-avol-change-other
,
abs-istore-cleanup-lpt
,
abs-istore-crash
,
abs-istore-idcircle
,
abs-istore-lpt-change-other
,
abs-istore-reduce-write
,
abs-istore-reduce-write-idcircle
,
abs-istore-replay-lpt-unchanged
,
abs-istore-set-lebsize
,
abs-istore-set-refsize
,
id-idx-abs-istore
,
log-disjoint-istore
,
Used by units in proved state:
persistence-refine
,
Proof exists?: No