[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 noPending
⊦ noPending(t, bq, p) ↔ (∀ l. p(l) | t = [] ∧ bq(t) = [])
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
noPending-no-leading-bq-W
,
noPending-then-noPendingW
,
pendingOk-add-pending
,
rely-noPending-stable
,
rely-noPending-stable-strong
,
writersok-add-pending
,
writersok-rm-writer
,
Used by units in proved state:
FLIT-proofs
,
Proof exists?: No