[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-ram-flash
⊦ lpt-ram-flash(lpt1, lpt0, nx) ↔ # lpt0 = # lpt1 ∧ (∀ n. n < # lpt1 ∧ lpt0[n].flags = LP_GROUP_NODES ∧ lpt1[n].flags = LP_GROUP_NODES ∧ ¬ n ∈ nx → lpt1[n].size = lpt0[n].size)
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
abs-gstore-crash
,
lpt-ram-flash-allocate
,
lpt-ram-flash-cleanup
,
lpt-ram-flash-commit
,
lpt-ram-flash-id-idx
,
lpt-ram-flash-refl
,
lpt-ram-flash-write-allocate
,
lpt-ram-flash-write-log
,
lpt-ram-flash-write-log-buf
,
lpt-ram-flash-write-non-group
,
lpt-ram-flash-write-same
,
Used by units in proved state:
persistence-asm
,
Proof exists?: No