[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-better
⊦ hasSharing(r, st) ↔ (∃ sks1, sks2. fits(r, sks1, st) ∧ fits(r, sks2, st) ∧ sks1 ≠ sks2 ∧ st[r -- sks1] .refval ≠ jvmref ∧ st[r -- sks1] = st[r -- sks2])
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
addarray-disjoint-nosharing
,
addarray-disjoint-nosharing-01
,
hasSharing-addobj-same
,
hasSharing-put-index-refval
,
hasSharing-self
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 24
Used lemmas:
fits-append
,
fits-storekeys-empty
,
hasSharing-def
,
Used spec theorems:
storefuns
/
lookup-append
Used simplifier rules:
list
/storekeys/
app-02-ant
list
/storekeys/
a
list
/storekeys/
app-04
javavalue
/
inj-03
storefuns
/
lookup-empty
javavalue
/
sel-09
javavalue
/
test-19
valuefuns
/
refval-xtra
javavalue
/
elim-refval