[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 freelist-cons
⊦ freelist-cons(lpt, freelist) ↔ ¬ dups(freelist) ∧ (∀ n. n < # lpt ∧ lpt[n].flags = LP_FREE ↔ n ∈ freelist)
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
freelist-cons-add
,
freelist-cons-alloc
,
freelist-cons-first-free
,
freelist-cons-remove-wbufs
,
freelist-cons-write-lpt-other
,
id-idx-freelist-cons
,
Used by units in proved state:
persistence-asm
,
Proof exists?: No