Section INIT.
Variable bc: block_classification.
Hypothesis GMATCH: genv_match bc ge.
Definition initial_mem_match (bc: block_classification) (m: mem) (g: genv) :=
forall id b v,
Genv.find_symbol g id = Some b -> Genv.find_var_info g b = Some v ->
v.(gvar_volatile) = false -> v.(gvar_readonly) = true ->
bmatch bc m b (store_init_data_list (ablock_init Pbot) 0 v.(gvar_init)).
Definition romem_consistent (defmap: PTree.t (globdef fundef unit)) (rm: romem) :=
forall id ab,
rm!id = Some ab ->
exists v,
defmap!id = Some (Gvar v)
/\ v.(gvar_readonly) = true
/\ v.(gvar_volatile) = false
/\ definitive_initializer v.(gvar_init) = true
/\ ab = store_init_data_list (ablock_init Pbot) 0 v.(gvar_init).
End INIT.
End INITIAL.
Hint Resolve areg_sound aregs_sound: va.
(** * Interface with other optimizations *)
Ltac InvSoundState :=
match goal with
| H1: sound_state ?prog ?st, H2: linkorder ?cunit ?prog |- _ =>
let S := fresh "S" in generalize (sound_state_inv _ _ _ H1 H2); intros S; inv S
end.
Definition avalue (a: VA.t) (r: reg) : aval :=
match a with
| VA.Bot => Vbot
| VA.State ae am => AE.get r ae
end.

Lemma avalue_sound:
forall cunit prog s f sp pc e m r,
sound_state prog (State s f (Vptr sp Ptrofs.zero) pc e m) ->
linkorder cunit prog ->
exists bc,
vmatch bc e#r (avalue (analyze (romem_for cunit) f)!!pc r)
/\ genv_match bc (Genv.globalenv prog)
/\ bc sp = BCstack.