[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 validrefs-put-badarrayfield
⊦ ¬ validrefs(str, refs, ty, st) ∧ ¬ junkref(str, refs .first, st) ∧ fs ' ≠ _type ∧ is_arraytype(st[r0 -- _type] .type) ∧ fs ' ≠ _length ∧ refs ≠ [] ∧ ¬ dups(refs .butlast) → ¬ validrefs(str, refs, ty, st[r0 -- fs ', val])
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
cyclic-put-badarrayfield
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 21
Proof steps: 44
Used lemmas:
validrefs-array
,
validrefs-class
,
validrefs-null-02
,
validrefs-is-junk
,
Used spec theorems:
junkrefs
/
junkref-is-junk
addfuns
/
is-valid-ref-stronger-def
okfuns
/
is_array-arraytype
store
/javastore/
At-other
junkrefs
/
junkref-class
addfuns
/
is_obj-classtype
junkrefs
/
junkref-array
Used simplifier rules:
javavalue
/
sel-09
javatype
/
sel-01
javavalue
/
test-19
javavalue
/
elim-13
javatype
/
test-09
javatype
/
diff-01
okfuns
/
is_array-arraytype
javatype
/
elim-01
list-data
/references/
elim-list-c
int-abs
/
lels-03
int-abs
/
lels-04
int-abs
/
forward-le-01
int-abs
/
forward-le-05
int-abs
/
lels
int-abs
/
lels-01
javastore
/
at-other-01
okfuns
/
is_array-put-field
okfuns
/
is_array-classtype
refkey
/
inj-01
refkey
/
inj
list-dup
/references/
dups-cons
list-last
/references/
bapp
addfuns
/
is_obj-arraytype
junkrefs
/
junkref-null
javastore
/
at-other-16
list
/references/
c-08
list
/references/
a
list
/references/
e-01
list
/references/
c