[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 absloc-recR
⊦ absloc(R(t, l, v) ' + el, rset, fowl) ↔ (¬ t ∈ rset → FO(t) ∈ fowl) ∧ absloc(el, rset, fowl)
Type: An axiom
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
abs-apply-firstPersistW
,
abs-firstPersistW-firstVolWrite-correct-loc
,
abs-firstPersistW-in-p-when-firstVolWrite-in-h
,
abs-firstPersistW-is-firstVolWrite
,
abs-firstPersistW-is-in-hist
,
abs-firstVolWrite-head
,
abs-leading-write-h-restricted-non-empty
,
abs-loc-no-w-no-fo-then-no-pending
,
absloc-addRead
,
absloc-addReadFO
,
absloc-addReadReader
,
absloc-addReader
,
absloc-addWrite
,
absloc-addWriteFO
,
absloc-nowritesp-nowritesh
,
absloc-persist-DependentReads
,
absloc-persist-firstPersistW
,
absloc-persistFO
,
absloc-persistWrite
,
absloc-persistfirstFO
,
absloc-prepend-FO
,
absloc-recR-one
,
Used by units in proved state:
Proof exists?: No