[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 pathex-def
⊦ path∃(str, r, r0, st) ↔ (∃ refs. refs ≠ [] ∧ refs .first = r ∧ refs .last = r0 ∧ validrefs(str, refs, mkclasstype(`java.lang.Object' .class), st))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
okbar-nopath
,
pathex-addobj
,
pathex-def-simple
,
pathex-levelsubset
,
pathex-not-is-validref-02
,
pathex-null
,
pathex-one
,
pathex-putbyte-field
,
pathex-putbyteval-01
,
pathex-putshortfield
,
pathex-putstatfield
,
pathex-subset
,
pathex-subset-equiv
,
pathex-trans
,
pathex-validrefs-in
,
pathexplus-pathex
,
validref-nopath-superset
,
Used by units in proved state:
Proof exists?: No