[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 validfield-def
⊦ validfield(str, r, sk, st) ↔ goodfieldandtype(r, sk, st) ∧ type∃(str, sk .fs .type) ∧ sk .fs .type ≠ void_type ∧ (is_reftype(sk .fs .type) → validrefval(str, st[r -- sk], sk .fs .type, st))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
initsubset-initerror-02
,
initsubset-put-statfield-int
,
validfield-levelsubset
,
validfield-one
,
validfield-put-statfield
,
validfield-superset
,
validstatfield-addclass-other
,
validstatfield-addclass-same
,
validstatfield-primtype-level
,
validstatfield-put-array-norefval
,
validstatfield-put-norefval
,
validstatfield-put-statfield
,
validstatfield-put-statfield-int
,
validstatfield-putbytearray-noreftype
,
validstatfield-putrkvs
,
validstatfield-throw-predef
,
validstatfield-union
,
validstatfields-addclass
,
Used by units in proved state:
Proof exists?: No