[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 gc-step
aubifs_core_gc_copy#(; RI, FS, LOG) {choose KX, AX with ¬ dups(KX) ∧ ¬ dups(AX) ∧ new(AX, FS) ∧ KX.toSet ⊆ dom RI ∧ # KX = # AX ∧ AX.toSet ∩ LOG.toSet = ∅ in {FS[AX] := FS[RI[KX]], LOG := LOG + AX; RI[KX] := AX} }
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
crash-neutral-gc
,
inv-gc
,
Used by units in proved state:
gjournal-refine
,
Proof exists?: No