[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 onePendingW
⊦ onePendingW(t, l, p) ↔ (∀ l0. l0 ≠ l → p(l0) |W | t = [])
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment: at most at one location l pending writes, together with pendingOk we have at most one write pending at l as well
Used by:
add-pending-w-one-pending
,
one-pending-add-stable
,
one-pending-no-fo-no-pending
,
relyp-one-pending-stable
,
Used by units in proved state:
FLITPSCweak-proofs
,
abs-FLITPSCweak-PLIB
,
FLITPSCweak-preds
,
Proof exists?: No