[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 reorder-def
⊦ reorder(p, pq, rfo) ↔ (∀ l. reorder(l, p(l), pq(l), rfo))
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
reorder-firstPersistW-eq-lifted
,
reorder-firstPersistW-valid-lifted
,
reorder-fo-in-p-lifted
,
reorder-isPersistFO-exists-lifted
,
reorder-overwrite-p-eq-lifted
,
reorder-same-thread-events-lifted
,
reorder-same-writes-lifted
,
reorder-step-persistFO-lifted
,
reorder-step-persistW-lifted
,
reorder-step-propFO-lifted
,
reorder-step-propW-lifted
,
reorder-step-read-propFO-lifted
,
reorder-step-readPWB-lifted
,
Used by units in proved state:
FLIT-refines-FLITPSCweak
,
Proof exists?: No