[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 hasSharing-def
⊦ hasSharing(r, st) ↔ (∃ sks1, sks2. fits(r, sks1, st) ∧ fits(r, sks2, st) ∧ sks1 ≠ sks2 ∧ sks1 ≠ [] ∧ sks2 ≠ [] ∧ st[r -- sks1] .refval ≠ jvmref ∧ st[r -- sks1] = st[r -- sks2])
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
addarray-disjoint-nosharing
,
addarray-disjoint-nosharing-01
,
hasSharing-addobj-same
,
hasSharing-array-forward
,
hasSharing-dd-help
,
hasSharing-def-better
,
hasSharing-dups-array
,
hasSharing-dups-object
,
hasSharing-object-rec
,
hasSharing-put-byteval
,
hasSharing-put-byteval-01
,
hasSharing-put-index-refval
,
hasSharing-put-shortval
,
hasSharing-put-statfield
,
hasSharing-putbar
,
hasSharing-subset
,
hassharing-bytearray
,
hassharing-validrefs-dups
,
nosharing-forward
,
sharing-pathex-field-self
,
sharing-pathex-field-self-01
,
sharing-twopaths
,
Used by units in proved state:
Proof exists?: No