[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 pendingOk
⊦ pendingOk(bq, p) ↔ (∀ l, t. #(p(l) |W | t) + #(bq(t) |WL l) ≤ 1)
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
pendingOk-add-FO
,
pendingOk-add-SF
,
pendingOk-add-pending
,
pendingOk-empty-bq
,
pendingOk-no-two-buffered-Ws
,
pendingOk-persist
,
pendingOk-prop-FO
,
pendingOk-prop-W
,
Used by units in proved state:
FLIT-proofs
,
Proof exists?: No