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