Correctness proof for Cminor generation.
Require Import Coq.Program.Equality FSets Permutation.
Require Import FSets FSetAVL Orders Mergesort.
Require Import Coqlib Maps Ordered Errors Integers Floats.
Require Intv.
Require Import AST Linking.
Require Import Values Memory Events Globalenvs Smallstep.
Require Import Csharpminor Switch Cminor Cminorgen.
Local Open Scope error_monad_scope.
Definition match_prog (
p:
Csharpminor.program) (
tp:
Cminor.program) :=
match_program (
fun cu f tf =>
transl_fundef f =
OK tf)
eq p tp.
Lemma transf_program_match:
forall p tp,
transl_program p =
OK tp ->
match_prog p tp.
Proof.
Section TRANSLATION.
Variable prog:
Csharpminor.program.
Variable tprog:
program.
Hypothesis TRANSL:
match_prog prog tprog.
Let ge :
Csharpminor.genv :=
Genv.globalenv prog.
Let tge:
genv :=
Genv.globalenv tprog.
Lemma symbols_preserved:
forall (
s:
ident),
Genv.find_symbol tge s =
Genv.find_symbol ge s.
Proof (
Genv.find_symbol_transf_partial TRANSL).
Lemma senv_preserved:
Senv.equiv ge tge.
Proof (
Genv.senv_transf_partial TRANSL).
Lemma function_ptr_translated:
forall (
b:
block) (
f:
Csharpminor.fundef),
Genv.find_funct_ptr ge b =
Some f ->
exists tf,
Genv.find_funct_ptr tge b =
Some tf /\
transl_fundef f =
OK tf.
Proof (
Genv.find_funct_ptr_transf_partial TRANSL).
Lemma functions_translated:
forall (
v:
val) (
f:
Csharpminor.fundef),
Genv.find_funct ge v =
Some f ->
exists tf,
Genv.find_funct tge v =
Some tf /\
transl_fundef f =
OK tf.
Proof (
Genv.find_funct_transf_partial TRANSL).
Lemma sig_preserved_body:
forall f tf cenv size,
transl_funbody cenv size f =
OK tf ->
tf.(
fn_sig) =
Csharpminor.fn_sig f.
Proof.
Lemma sig_preserved:
forall f tf,
transl_fundef f =
OK tf ->
Cminor.funsig tf =
Csharpminor.funsig f.
Proof.
Derived properties of memory operations
Lemma load_freelist:
forall fbl chunk m b ofs m',
(
forall b'
lo hi,
In (
b',
lo,
hi)
fbl ->
b' <>
b) ->
Mem.free_list m fbl =
Some m' ->
Mem.load chunk m'
b ofs =
Mem.load chunk m b ofs.
Proof.
induction fbl;
intros.
simpl in H0.
congruence.
destruct a as [[
b'
lo]
hi].
generalize H0.
simpl.
case_eq (
Mem.free m b'
lo hi);
try congruence.
intros m1 FR1 FRL.
transitivity (
Mem.load chunk m1 b ofs).
eapply IHfbl;
eauto.
intros.
eapply H.
eauto with coqlib.
eapply Mem.load_free;
eauto.
left.
apply not_eq_sym.
eapply H.
auto with coqlib.
Qed.
Lemma perm_freelist:
forall fbl m m'
b ofs k p,
Mem.free_list m fbl =
Some m' ->
Mem.perm m'
b ofs k p ->
Mem.perm m b ofs k p.
Proof.
induction fbl;
simpl;
intros until p.
congruence.
destruct a as [[
b'
lo]
hi].
case_eq (
Mem.free m b'
lo hi);
try congruence.
intros.
eauto with mem.
Qed.
Lemma nextblock_freelist:
forall fbl m m',
Mem.free_list m fbl =
Some m' ->
Mem.nextblock m' =
Mem.nextblock m.
Proof.
induction fbl;
intros until m';
simpl.
congruence.
destruct a as [[
b lo]
hi].
case_eq (
Mem.free m b lo hi);
intros;
try congruence.
transitivity (
Mem.nextblock m0).
eauto.
eapply Mem.nextblock_free;
eauto.
Qed.
Lemma free_list_freeable:
forall l m m',
Mem.free_list m l =
Some m' ->
forall b lo hi,
In (
b,
lo,
hi)
l ->
Mem.range_perm m b lo hi Cur Freeable.
Proof.
induction l;
simpl;
intros.
contradiction.
revert H.
destruct a as [[
b'
lo']
hi'].
caseEq (
Mem.free m b'
lo'
hi');
try congruence.
intros m1 FREE1 FREE2.
destruct H0.
inv H.
eauto with mem.
red;
intros.
eapply Mem.perm_free_3;
eauto.
exploit IHl;
eauto.
Qed.
Lemma nextblock_storev:
forall chunk m addr v m',
Mem.storev chunk m addr v =
Some m' ->
Mem.nextblock m' =
Mem.nextblock m.
Proof.
Correspondence between C#minor's and Cminor's environments and memory states
In C#minor, every variable is stored in a separate memory block.
In the corresponding Cminor code, these variables become sub-blocks
of the stack data block. We capture these changes in memory via a
memory injection f:
f b = Some(b', ofs) means that C#minor block b corresponds
to a sub-block of Cminor block b at offset ofs.
A memory injection f defines a relation Val.inject f between
values and a relation Mem.inject f between memory states. These
relations will be used intensively in our proof of simulation
between C#minor and Cminor executions.
Matching between Cshaprminor's temporaries and Cminor's variables
Definition match_temps (
f:
meminj) (
le:
Csharpminor.temp_env) (
te:
env) :
Prop :=
forall id v,
le!
id =
Some v ->
exists v',
te!(
id) =
Some v' /\
Val.inject f v v'.
Lemma match_temps_invariant:
forall f f'
le te,
match_temps f le te ->
inject_incr f f' ->
match_temps f'
le te.
Proof.
intros; red; intros. destruct (H _ _ H1) as [v' [A B]]. exists v'; eauto.
Qed.
Lemma match_temps_assign:
forall f le te id v tv,
match_temps f le te ->
Val.inject f v tv ->
match_temps f (
PTree.set id v le) (
PTree.set id tv te).
Proof.
intros;
red;
intros.
rewrite PTree.gsspec in *.
destruct (
peq id0 id).
inv H1.
exists tv;
auto.
eauto.
Qed.
Matching between C#minor's variable environment and Cminor's stack pointer
Inductive match_var (
f:
meminj) (
sp:
block):
option (
block *
Z) ->
option Z ->
Prop :=
|
match_var_local:
forall b sz ofs,
Val.inject f (
Vptr b Ptrofs.zero) (
Vptr sp (
Ptrofs.repr ofs)) ->
match_var f sp (
Some(
b,
sz)) (
Some ofs)
|
match_var_global:
match_var f sp None None.
Matching between a C#minor environment e and a Cminor
stack pointer sp. The lo and hi parameters delimit the range
of addresses for the blocks referenced from te.
Record match_env (
f:
meminj) (
cenv:
compilenv)
(
e:
Csharpminor.env) (
sp:
block)
(
lo hi:
block) :
Prop :=
mk_match_env {
C#minor local variables match sub-blocks of the Cminor stack data block.
me_vars:
forall id,
match_var f sp (
e!
id) (
cenv!
id);
lo, hi is a proper interval.
me_low_high:
Ple lo hi;
Every block appearing in the C#minor environment e must be
in the range lo, hi.
me_bounded:
forall id b sz,
PTree.get id e =
Some(
b,
sz) ->
Ple lo b /\
Plt b hi;
All blocks mapped to sub-blocks of the Cminor stack data must be
images of variables from the C#minor environment e
me_inv:
forall b delta,
f b =
Some(
sp,
delta) ->
exists id,
exists sz,
PTree.get id e =
Some(
b,
sz);
All C#minor blocks below lo (i.e. allocated before the blocks
referenced from e) must map to blocks that are below sp
(i.e. allocated before the stack data for the current Cminor function).
me_incr:
forall b tb delta,
f b =
Some(
tb,
delta) ->
Plt b lo ->
Plt tb sp
}.
Ltac geninv x :=
let H :=
fresh in (
generalize x;
intro H;
inv H).
Lemma match_env_invariant:
forall f1 cenv e sp lo hi f2,
match_env f1 cenv e sp lo hi ->
inject_incr f1 f2 ->
(
forall b delta,
f2 b =
Some(
sp,
delta) ->
f1 b =
Some(
sp,
delta)) ->
(
forall b,
Plt b lo ->
f2 b =
f1 b) ->
match_env f2 cenv e sp lo hi.
Proof.
intros. destruct H. constructor; auto.
intros. geninv (me_vars0 id); econstructor; eauto.
intros. eauto.
intros. rewrite H2 in H; eauto.
Qed.
match_env and external calls
Remark inject_incr_separated_same:
forall f1 f2 m1 m1',
inject_incr f1 f2 ->
inject_separated f1 f2 m1 m1' ->
forall b,
Mem.valid_block m1 b ->
f2 b =
f1 b.
Proof.
intros. case_eq (f1 b).
intros [b' delta] EQ. apply H; auto.
intros EQ. case_eq (f2 b).
intros [b'1 delta1] EQ1. exploit H0; eauto. intros [C D]. contradiction.
auto.
Qed.
Remark inject_incr_separated_same':
forall f1 f2 m1 m1',
inject_incr f1 f2 ->
inject_separated f1 f2 m1 m1' ->
forall b b'
delta,
f2 b =
Some(
b',
delta) ->
Mem.valid_block m1'
b' ->
f1 b =
Some(
b',
delta).
Proof.
intros. case_eq (f1 b).
intros [b'1 delta1] EQ. exploit H; eauto. congruence.
intros. exploit H0; eauto. intros [C D]. contradiction.
Qed.
Lemma match_env_external_call:
forall f1 cenv e sp lo hi f2 m1 m1',
match_env f1 cenv e sp lo hi ->
inject_incr f1 f2 ->
inject_separated f1 f2 m1 m1' ->
Ple hi (
Mem.nextblock m1) ->
Plt sp (
Mem.nextblock m1') ->
match_env f2 cenv e sp lo hi.
Proof.
match_env and allocations
Lemma match_env_alloc:
forall f1 id cenv e sp lo m1 sz m2 b ofs f2,
match_env f1 (
PTree.remove id cenv)
e sp lo (
Mem.nextblock m1) ->
Mem.alloc m1 0
sz = (
m2,
b) ->
cenv!
id =
Some ofs ->
inject_incr f1 f2 ->
f2 b =
Some(
sp,
ofs) ->
(
forall b',
b' <>
b ->
f2 b' =
f1 b') ->
e!
id =
None ->
match_env f2 cenv (
PTree.set id (
b,
sz)
e)
sp lo (
Mem.nextblock m2).
Proof.
intros until f2;
intros ME ALLOC CENV INCR SAME OTHER ENV.
exploit Mem.nextblock_alloc;
eauto.
intros NEXTBLOCK.
exploit Mem.alloc_result;
eauto.
intros RES.
inv ME;
constructor.
intros.
rewrite PTree.gsspec.
destruct (
peq id0 id).
subst id0.
rewrite CENV.
constructor.
econstructor.
eauto.
rewrite Ptrofs.add_commut;
rewrite Ptrofs.add_zero;
auto.
generalize (
me_vars0 id0).
rewrite PTree.gro;
auto.
intros M;
inv M.
constructor;
eauto.
constructor.
rewrite NEXTBLOCK;
extlia.
intros.
rewrite PTree.gsspec in H.
destruct (
peq id0 id).
inv H.
rewrite NEXTBLOCK;
extlia.
exploit me_bounded0;
eauto.
rewrite NEXTBLOCK;
extlia.
intros.
destruct (
eq_block b (
Mem.nextblock m1)).
subst b.
rewrite SAME in H;
inv H.
exists id;
exists sz.
apply PTree.gss.
rewrite OTHER in H;
auto.
exploit me_inv0;
eauto.
intros [
id1 [
sz1 EQ]].
exists id1;
exists sz1.
rewrite PTree.gso;
auto.
congruence.
intros.
rewrite OTHER in H.
eauto.
unfold block in *;
extlia.
Qed.
The sizes of blocks appearing in e are respected.
Definition match_bounds (
e:
Csharpminor.env) (
m:
mem) :
Prop :=
forall id b sz ofs p,
PTree.get id e =
Some(
b,
sz) ->
Mem.perm m b ofs Max p -> 0 <=
ofs <
sz.
Lemma match_bounds_invariant:
forall e m1 m2,
match_bounds e m1 ->
(
forall id b sz ofs p,
PTree.get id e =
Some(
b,
sz) ->
Mem.perm m2 b ofs Max p ->
Mem.perm m1 b ofs Max p) ->
match_bounds e m2.
Proof.
intros; red; intros. eapply H; eauto.
Qed.
Permissions on the Cminor stack block
The parts of the Cminor stack data block that are not images of
C#minor local variable blocks remain freeable at all times.
Inductive is_reachable_from_env (
f:
meminj) (
e:
Csharpminor.env) (
sp:
block) (
ofs:
Z) :
Prop :=
|
is_reachable_intro:
forall id b sz delta,
e!
id =
Some(
b,
sz) ->
f b =
Some(
sp,
delta) ->
delta <=
ofs <
delta +
sz ->
is_reachable_from_env f e sp ofs.
Definition padding_freeable (
f:
meminj) (
e:
Csharpminor.env) (
tm:
mem) (
sp:
block) (
sz:
Z) :
Prop :=
forall ofs,
0 <=
ofs <
sz ->
Mem.perm tm sp ofs Cur Freeable \/
is_reachable_from_env f e sp ofs.
Lemma padding_freeable_invariant:
forall f1 e tm1 sp sz cenv lo hi f2 tm2,
padding_freeable f1 e tm1 sp sz ->
match_env f1 cenv e sp lo hi ->
(
forall ofs,
Mem.perm tm1 sp ofs Cur Freeable ->
Mem.perm tm2 sp ofs Cur Freeable) ->
(
forall b,
Plt b hi ->
f2 b =
f1 b) ->
padding_freeable f2 e tm2 sp sz.
Proof.
intros;
red;
intros.
exploit H;
eauto.
intros [
A |
A].
left;
auto.
right.
inv A.
exploit me_bounded;
eauto.
intros [
D E].
econstructor;
eauto.
rewrite H2;
auto.
Qed.
Decidability of the is_reachable_from_env predicate.
Lemma is_reachable_from_env_dec:
forall f e sp ofs,
is_reachable_from_env f e sp ofs \/ ~
is_reachable_from_env f e sp ofs.
Proof.
Correspondence between global environments
Global environments match if the memory injection f leaves unchanged
the references to global symbols and functions.
Inductive match_globalenvs (
f:
meminj) (
bound:
block):
Prop :=
|
mk_match_globalenvs
(
DOMAIN:
forall b,
Plt b bound ->
f b =
Some(
b, 0))
(
IMAGE:
forall b1 b2 delta,
f b1 =
Some(
b2,
delta) ->
Plt b2 bound ->
b1 =
b2)
(
SYMBOLS:
forall id b,
Genv.find_symbol ge id =
Some b ->
Plt b bound)
(
FUNCTIONS:
forall b fd,
Genv.find_funct_ptr ge b =
Some fd ->
Plt b bound)
(
VARINFOS:
forall b gv,
Genv.find_var_info ge b =
Some gv ->
Plt b bound).
Remark inj_preserves_globals:
forall f hi,
match_globalenvs f hi ->
meminj_preserves_globals ge f.
Proof.
intros. inv H.
split. intros. apply DOMAIN. eapply SYMBOLS. eauto.
split. intros. apply DOMAIN. eapply VARINFOS. eauto.
intros. symmetry. eapply IMAGE; eauto.
Qed.
Invariant on abstract call stacks
Call stacks represent abstractly the execution state of the current
C#minor and Cminor functions, as well as the states of the
calling functions. A call stack is a list of frames, each frame
collecting information on the current execution state of a C#minor
function and its Cminor translation.
Inductive frame :
Type :=
Frame(
cenv:
compilenv)
(
tf:
Cminor.function)
(
e:
Csharpminor.env)
(
le:
Csharpminor.temp_env)
(
te:
Cminor.env)
(
sp:
block)
(
lo hi:
block).
Definition callstack :
Type :=
list frame.
Matching of call stacks imply:
-
matching of environments for each of the frames
-
matching of the global environments
-
separation conditions over the memory blocks allocated for C#minor local variables;
-
separation conditions over the memory blocks allocated for Cminor stack data;
-
freeable permissions on the parts of the Cminor stack data blocks
that are not images of C#minor local variable blocks.
(
f:
meminj) (
m:
mem) (
tm:
mem):
callstack ->
block ->
block ->
Prop :=
|
mcs_nil:
forall hi bound tbound,
match_globalenvs f hi ->
Ple hi bound ->
Ple hi tbound ->
match_callstack f m tm nil bound tbound
|
mcs_cons:
forall cenv tf e le te sp lo hi cs bound tbound
(
BOUND:
Ple hi bound)
(
TBOUND:
Plt sp tbound)
(
MTMP:
match_temps f le te)
(
MENV:
match_env f cenv e sp lo hi)
(
BOUND:
match_bounds e m)
(
PERM:
padding_freeable f e tm sp tf.(
fn_stackspace))
(
MCS:
match_callstack f m tm cs lo sp),
match_callstack f m tm (
Frame cenv tf e le te sp lo hi ::
cs)
bound tbound.
match_callstack implies match_globalenvs.
Lemma match_callstack_match_globalenvs:
forall f m tm cs bound tbound,
match_callstack f m tm cs bound tbound ->
exists hi,
match_globalenvs f hi.
Proof.
induction 1; eauto.
Qed.
Invariance properties for match_callstack.
Lemma match_callstack_invariant:
forall f1 m1 tm1 f2 m2 tm2 cs bound tbound,
match_callstack f1 m1 tm1 cs bound tbound ->
inject_incr f1 f2 ->
(
forall b ofs p,
Plt b bound ->
Mem.perm m2 b ofs Max p ->
Mem.perm m1 b ofs Max p) ->
(
forall sp ofs,
Plt sp tbound ->
Mem.perm tm1 sp ofs Cur Freeable ->
Mem.perm tm2 sp ofs Cur Freeable) ->
(
forall b,
Plt b bound ->
f2 b =
f1 b) ->
(
forall b b'
delta,
f2 b =
Some(
b',
delta) ->
Plt b'
tbound ->
f1 b =
Some(
b',
delta)) ->
match_callstack f2 m2 tm2 cs bound tbound.
Proof.
induction 1;
intros.
econstructor;
eauto.
inv H.
constructor;
intros;
eauto.
eapply IMAGE;
eauto.
eapply H6;
eauto.
extlia.
assert (
Ple lo hi)
by (
eapply me_low_high;
eauto).
econstructor;
eauto.
eapply match_temps_invariant;
eauto.
eapply match_env_invariant;
eauto.
intros.
apply H3.
extlia.
eapply match_bounds_invariant;
eauto.
intros.
eapply H1;
eauto.
exploit me_bounded;
eauto.
extlia.
eapply padding_freeable_invariant;
eauto.
intros.
apply H3.
extlia.
eapply IHmatch_callstack;
eauto.
intros.
eapply H1;
eauto.
extlia.
intros.
eapply H2;
eauto.
extlia.
intros.
eapply H3;
eauto.
extlia.
intros.
eapply H4;
eauto.
extlia.
Qed.
Lemma match_callstack_incr_bound:
forall f m tm cs bound tbound bound'
tbound',
match_callstack f m tm cs bound tbound ->
Ple bound bound' ->
Ple tbound tbound' ->
match_callstack f m tm cs bound'
tbound'.
Proof.
intros. inv H.
econstructor; eauto. extlia. extlia.
constructor; auto. extlia. extlia.
Qed.
Assigning a temporary variable.
Lemma match_callstack_set_temp:
forall f cenv e le te sp lo hi cs bound tbound m tm tf id v tv,
Val.inject f v tv ->
match_callstack f m tm (
Frame cenv tf e le te sp lo hi ::
cs)
bound tbound ->
match_callstack f m tm (
Frame cenv tf e (
PTree.set id v le) (
PTree.set id tv te)
sp lo hi ::
cs)
bound tbound.
Proof.
Preservation of match_callstack by freeing all blocks allocated
for local variables at function entry (on the C#minor side)
and simultaneously freeing the Cminor stack data block.
Lemma in_blocks_of_env:
forall e id b sz,
e!
id =
Some(
b,
sz) ->
In (
b, 0,
sz) (
blocks_of_env e).
Proof.
Lemma in_blocks_of_env_inv:
forall b lo hi e,
In (
b,
lo,
hi) (
blocks_of_env e) ->
exists id,
e!
id =
Some(
b,
hi) /\
lo = 0.
Proof.
Lemma match_callstack_freelist:
forall f cenv tf e le te sp lo hi cs m m'
tm,
Mem.inject f m tm ->
Mem.free_list m (
blocks_of_env e) =
Some m' ->
match_callstack f m tm (
Frame cenv tf e le te sp lo hi ::
cs) (
Mem.nextblock m) (
Mem.nextblock tm) ->
exists tm',
Mem.free tm sp 0
tf.(
fn_stackspace) =
Some tm'
/\
match_callstack f m'
tm'
cs (
Mem.nextblock m') (
Mem.nextblock tm')
/\
Mem.inject f m'
tm'.
Proof.
Preservation of match_callstack by external calls.
Lemma match_callstack_external_call:
forall f1 f2 m1 m2 m1'
m2',
Mem.unchanged_on (
loc_unmapped f1)
m1 m2 ->
Mem.unchanged_on (
loc_out_of_reach f1 m1)
m1'
m2' ->
inject_incr f1 f2 ->
inject_separated f1 f2 m1 m1' ->
(
forall b ofs p,
Mem.valid_block m1 b ->
Mem.perm m2 b ofs Max p ->
Mem.perm m1 b ofs Max p) ->
forall cs bound tbound,
match_callstack f1 m1 m1'
cs bound tbound ->
Ple bound (
Mem.nextblock m1) ->
Ple tbound (
Mem.nextblock m1') ->
match_callstack f2 m2 m2'
cs bound tbound.
Proof.
intros until m2'.
intros UNMAPPED OUTOFREACH INCR SEPARATED MAXPERMS.
induction 1;
intros.
apply mcs_nil with hi;
auto.
inv H.
constructor;
auto.
intros.
case_eq (
f1 b1).
intros [
b2'
delta']
EQ.
rewrite (
INCR _ _ _ EQ)
in H.
inv H.
eauto.
intro EQ.
exploit SEPARATED;
eauto.
intros [
A B].
elim B.
red.
extlia.
constructor.
auto.
auto.
eapply match_temps_invariant;
eauto.
eapply match_env_invariant;
eauto.
red in SEPARATED.
intros.
destruct (
f1 b)
as [[
b'
delta']|]
eqn:?.
exploit INCR;
eauto.
congruence.
exploit SEPARATED;
eauto.
intros [
A B].
elim B.
red.
extlia.
intros.
assert (
Ple lo hi)
by (
eapply me_low_high;
eauto).
destruct (
f1 b)
as [[
b'
delta']|]
eqn:?.
apply INCR;
auto.
destruct (
f2 b)
as [[
b'
delta']|]
eqn:?;
auto.
exploit SEPARATED;
eauto.
intros [
A B].
elim A.
red.
extlia.
eapply match_bounds_invariant;
eauto.
intros.
eapply MAXPERMS;
eauto.
red.
exploit me_bounded;
eauto.
extlia.
red;
intros.
destruct (
is_reachable_from_env_dec f1 e sp ofs).
inv H3.
right.
apply is_reachable_intro with id b sz delta;
auto.
exploit PERM;
eauto.
intros [
A|
A];
try contradiction.
left.
eapply Mem.perm_unchanged_on;
eauto.
red;
intros;
red;
intros.
elim H3.
exploit me_inv;
eauto.
intros [
id [
lv B]].
exploit BOUND0;
eauto.
intros C.
apply is_reachable_intro with id b0 lv delta;
auto;
lia.
eauto with mem.
eapply IHmatch_callstack;
eauto.
inv MENV;
extlia.
extlia.
Qed.
match_callstack and allocations
Lemma match_callstack_alloc_right:
forall f m tm cs tf tm'
sp le te cenv,
match_callstack f m tm cs (
Mem.nextblock m) (
Mem.nextblock tm) ->
Mem.alloc tm 0
tf.(
fn_stackspace) = (
tm',
sp) ->
Mem.inject f m tm ->
match_temps f le te ->
(
forall id,
cenv!
id =
None) ->
match_callstack f m tm'
(
Frame cenv tf empty_env le te sp (
Mem.nextblock m) (
Mem.nextblock m) ::
cs)
(
Mem.nextblock m) (
Mem.nextblock tm').
Proof.
Lemma match_callstack_alloc_left:
forall f1 m1 tm id cenv tf e le te sp lo cs sz m2 b f2 ofs,
match_callstack f1 m1 tm
(
Frame (
PTree.remove id cenv)
tf e le te sp lo (
Mem.nextblock m1) ::
cs)
(
Mem.nextblock m1) (
Mem.nextblock tm) ->
Mem.alloc m1 0
sz = (
m2,
b) ->
cenv!
id =
Some ofs ->
inject_incr f1 f2 ->
f2 b =
Some(
sp,
ofs) ->
(
forall b',
b' <>
b ->
f2 b' =
f1 b') ->
e!
id =
None ->
match_callstack f2 m2 tm
(
Frame cenv tf (
PTree.set id (
b,
sz)
e)
le te sp lo (
Mem.nextblock m2) ::
cs)
(
Mem.nextblock m2) (
Mem.nextblock tm).
Proof.
Correctness of stack allocation of local variables
This section shows the correctness of the translation of Csharpminor
local variables as sub-blocks of the Cminor stack data. This is the most difficult part of the proof.
Definition cenv_remove (
cenv:
compilenv) (
vars:
list (
ident *
Z)) :
compilenv :=
fold_right (
fun id_lv ce =>
PTree.remove (
fst id_lv)
ce)
cenv vars.
Remark cenv_remove_gso:
forall id vars cenv,
~
In id (
map fst vars) ->
PTree.get id (
cenv_remove cenv vars) =
PTree.get id cenv.
Proof.
induction vars;
simpl;
intros.
auto.
rewrite PTree.gro.
apply IHvars.
intuition.
intuition.
Qed.
Remark cenv_remove_gss:
forall id vars cenv,
In id (
map fst vars) ->
PTree.get id (
cenv_remove cenv vars) =
None.
Proof.
induction vars;
simpl;
intros.
contradiction.
rewrite PTree.grspec.
destruct (
PTree.elt_eq id (
fst a)).
auto.
destruct H.
intuition.
eauto.
Qed.
Definition cenv_compat (
cenv:
compilenv) (
vars:
list (
ident *
Z)) (
tsz:
Z) :
Prop :=
forall id sz,
In (
id,
sz)
vars ->
exists ofs,
PTree.get id cenv =
Some ofs
/\
Mem.inj_offset_aligned ofs sz
/\ 0 <=
ofs
/\
ofs +
Z.max 0
sz <=
tsz.
Definition cenv_separated (
cenv:
compilenv) (
vars:
list (
ident *
Z)) :
Prop :=
forall id1 sz1 ofs1 id2 sz2 ofs2,
In (
id1,
sz1)
vars ->
In (
id2,
sz2)
vars ->
PTree.get id1 cenv =
Some ofs1 ->
PTree.get id2 cenv =
Some ofs2 ->
id1 <>
id2 ->
ofs1 +
sz1 <=
ofs2 \/
ofs2 +
sz2 <=
ofs1.
Definition cenv_mem_separated (
cenv:
compilenv) (
vars:
list (
ident *
Z)) (
f:
meminj) (
sp:
block) (
m:
mem) :
Prop :=
forall id sz ofs b delta ofs'
k p,
In (
id,
sz)
vars ->
PTree.get id cenv =
Some ofs ->
f b =
Some (
sp,
delta) ->
Mem.perm m b ofs'
k p ->
ofs <=
ofs' +
delta <
sz +
ofs ->
False.
Lemma match_callstack_alloc_variables_rec:
forall tm sp tf cenv le te lo cs,
Mem.valid_block tm sp ->
fn_stackspace tf <=
Ptrofs.max_unsigned ->
(
forall ofs k p,
Mem.perm tm sp ofs k p -> 0 <=
ofs <
fn_stackspace tf) ->
(
forall ofs k p, 0 <=
ofs <
fn_stackspace tf ->
Mem.perm tm sp ofs k p) ->
forall e1 m1 vars e2 m2,
alloc_variables e1 m1 vars e2 m2 ->
forall f1,
list_norepet (
map fst vars) ->
cenv_compat cenv vars (
fn_stackspace tf) ->
cenv_separated cenv vars ->
cenv_mem_separated cenv vars f1 sp m1 ->
(
forall id sz,
In (
id,
sz)
vars ->
e1!
id =
None) ->
match_callstack f1 m1 tm
(
Frame (
cenv_remove cenv vars)
tf e1 le te sp lo (
Mem.nextblock m1) ::
cs)
(
Mem.nextblock m1) (
Mem.nextblock tm) ->
Mem.inject f1 m1 tm ->
exists f2,
match_callstack f2 m2 tm
(
Frame cenv tf e2 le te sp lo (
Mem.nextblock m2) ::
cs)
(
Mem.nextblock m2) (
Mem.nextblock tm)
/\
Mem.inject f2 m2 tm.
Proof.
intros until cs;
intros VALID REPRES STKSIZE STKPERMS.
induction 1;
intros f1 NOREPET COMPAT SEP1 SEP2 UNBOUND MCS MINJ.
simpl in MCS.
exists f1;
auto.
simpl in NOREPET.
inv NOREPET.
exploit (
COMPAT id sz).
auto with coqlib.
intros [
ofs [
CENV [
ALIGNED [
LOB HIB]]]].
exploit Mem.alloc_left_mapped_inject.
eexact MINJ.
eexact H.
eexact VALID.
instantiate (1 :=
ofs).
zify.
lia.
intros.
exploit STKSIZE;
eauto.
lia.
intros.
apply STKPERMS.
zify.
lia.
replace (
sz - 0)
with sz by lia.
auto.
intros.
eapply SEP2.
eauto with coqlib.
eexact CENV.
eauto.
eauto.
lia.
intros [
f2 [
A [
B [
C D]]]].
exploit (
IHalloc_variables f2);
eauto.
red;
intros.
eapply COMPAT.
auto with coqlib.
red;
intros.
eapply SEP1;
eauto with coqlib.
red;
intros.
exploit Mem.perm_alloc_inv;
eauto.
destruct (
eq_block b b1);
intros P.
subst b.
rewrite C in H5;
inv H5.
exploit SEP1.
eapply in_eq.
eapply in_cons;
eauto.
eauto.
eauto.
red;
intros;
subst id0.
elim H3.
change id with (
fst (
id,
sz0)).
apply in_map;
auto.
lia.
eapply SEP2.
apply in_cons;
eauto.
eauto.
rewrite D in H5;
eauto.
eauto.
auto.
intros.
rewrite PTree.gso.
eapply UNBOUND;
eauto with coqlib.
red;
intros;
subst id0.
elim H3.
change id with (
fst (
id,
sz0)).
apply in_map;
auto.
eapply match_callstack_alloc_left;
eauto.
rewrite cenv_remove_gso;
auto.
apply UNBOUND with sz;
auto with coqlib.
Qed.
Lemma match_callstack_alloc_variables:
forall tm1 sp tm2 m1 vars e m2 cenv f1 cs fn le te,
Mem.alloc tm1 0 (
fn_stackspace fn) = (
tm2,
sp) ->
fn_stackspace fn <=
Ptrofs.max_unsigned ->
alloc_variables empty_env m1 vars e m2 ->
list_norepet (
map fst vars) ->
cenv_compat cenv vars (
fn_stackspace fn) ->
cenv_separated cenv vars ->
(
forall id ofs,
cenv!
id =
Some ofs ->
In id (
map fst vars)) ->
Mem.inject f1 m1 tm1 ->
match_callstack f1 m1 tm1 cs (
Mem.nextblock m1) (
Mem.nextblock tm1) ->
match_temps f1 le te ->
exists f2,
match_callstack f2 m2 tm2 (
Frame cenv fn e le te sp (
Mem.nextblock m1) (
Mem.nextblock m2) ::
cs)
(
Mem.nextblock m2) (
Mem.nextblock tm2)
/\
Mem.inject f2 m2 tm2.
Proof.
Properties of the compilation environment produced by build_compilenv
Remark block_alignment_pos:
forall sz,
block_alignment sz > 0.
Proof.
Remark assign_variable_incr:
forall id sz cenv stksz cenv'
stksz',
assign_variable (
cenv,
stksz) (
id,
sz) = (
cenv',
stksz') ->
stksz <=
stksz'.
Proof.
Remark assign_variables_incr:
forall vars cenv sz cenv'
sz',
assign_variables (
cenv,
sz)
vars = (
cenv',
sz') ->
sz <=
sz'.
Proof.
Remark inj_offset_aligned_block:
forall stacksize sz,
Mem.inj_offset_aligned (
align stacksize (
block_alignment sz))
sz.
Proof.
Remark inj_offset_aligned_block':
forall stacksize sz,
Mem.inj_offset_aligned (
align stacksize (
block_alignment sz)) (
Z.max 0
sz).
Proof.
Lemma assign_variable_sound:
forall cenv1 sz1 id sz cenv2 sz2 vars,
assign_variable (
cenv1,
sz1) (
id,
sz) = (
cenv2,
sz2) ->
~
In id (
map fst vars) ->
0 <=
sz1 ->
cenv_compat cenv1 vars sz1 ->
cenv_separated cenv1 vars ->
cenv_compat cenv2 (
vars ++ (
id,
sz) ::
nil)
sz2
/\
cenv_separated cenv2 (
vars ++ (
id,
sz) ::
nil).
Proof.
unfold assign_variable;
intros until vars;
intros ASV NOREPET POS COMPAT SEP.
inv ASV.
assert (
LE:
sz1 <=
align sz1 (
block_alignment sz)).
apply align_le.
apply block_alignment_pos.
assert (
EITHER:
forall id'
sz',
In (
id',
sz') (
vars ++ (
id,
sz) ::
nil) ->
In (
id',
sz')
vars /\
id' <>
id \/ (
id',
sz') = (
id,
sz)).
intros.
rewrite in_app in H.
destruct H.
left;
split;
auto.
red;
intros;
subst id'.
elim NOREPET.
change id with (
fst (
id,
sz')).
apply in_map;
auto.
simpl in H.
destruct H.
auto.
contradiction.
split;
red;
intros.
apply EITHER in H.
destruct H as [[
P Q] |
P].
exploit COMPAT;
eauto.
intros [
ofs [
A [
B [
C D]]]].
exists ofs.
split.
rewrite PTree.gso;
auto.
split.
auto.
split.
auto.
zify;
lia.
inv P.
exists (
align sz1 (
block_alignment sz)).
split.
apply PTree.gss.
split.
apply inj_offset_aligned_block.
split.
lia.
lia.
apply EITHER in H;
apply EITHER in H0.
destruct H as [[
P Q] |
P];
destruct H0 as [[
R S] |
R].
rewrite PTree.gso in *;
auto.
eapply SEP;
eauto.
inv R.
rewrite PTree.gso in H1;
auto.
rewrite PTree.gss in H2;
inv H2.
exploit COMPAT;
eauto.
intros [
ofs [
A [
B [
C D]]]].
assert (
ofs =
ofs1)
by congruence.
subst ofs.
left.
zify;
lia.
inv P.
rewrite PTree.gso in H2;
auto.
rewrite PTree.gss in H1;
inv H1.
exploit COMPAT;
eauto.
intros [
ofs [
A [
B [
C D]]]].
assert (
ofs =
ofs2)
by congruence.
subst ofs.
right.
zify;
lia.
congruence.
Qed.
Lemma assign_variables_sound:
forall vars'
cenv1 sz1 cenv2 sz2 vars,
assign_variables (
cenv1,
sz1)
vars' = (
cenv2,
sz2) ->
list_norepet (
map fst vars' ++
map fst vars) ->
0 <=
sz1 ->
cenv_compat cenv1 vars sz1 ->
cenv_separated cenv1 vars ->
cenv_compat cenv2 (
vars ++
vars')
sz2 /\
cenv_separated cenv2 (
vars ++
vars').
Proof.
induction vars';
simpl;
intros.
rewrite app_nil_r.
inv H;
auto.
destruct a as [
id sz].
simpl in H0.
inv H0.
rewrite in_app in H6.
rewrite list_norepet_app in H7.
destruct H7 as [
P [
Q R]].
destruct (
assign_variable (
cenv1,
sz1) (
id,
sz))
as [
cenv'
sz']
eqn:?.
exploit assign_variable_sound.
eauto.
instantiate (1 :=
vars).
tauto.
auto.
auto.
auto.
intros [
A B].
exploit IHvars'.
eauto.
instantiate (1 :=
vars ++ ((
id,
sz) ::
nil)).
rewrite list_norepet_app.
split.
auto.
split.
rewrite map_app.
apply list_norepet_append_commut.
simpl.
constructor;
auto.
rewrite map_app.
simpl.
red;
intros.
rewrite in_app in H4.
destruct H4.
eauto.
simpl in H4.
destruct H4.
subst y.
red;
intros;
subst x.
tauto.
tauto.
generalize (
assign_variable_incr _ _ _ _ _ _ Heqp).
lia.
auto.
auto.
rewrite app_ass.
auto.
Qed.
Remark permutation_norepet:
forall (
A:
Type) (
l l':
list A),
Permutation l l' ->
list_norepet l ->
list_norepet l'.
Proof.
induction 1;
intros.
constructor.
inv H0.
constructor;
auto.
red;
intros;
elim H3.
apply Permutation_in with l';
auto.
apply Permutation_sym;
auto.
inv H.
simpl in H2.
inv H3.
constructor.
simpl;
intuition.
constructor.
intuition.
auto.
eauto.
Qed.
Lemma build_compilenv_sound:
forall f cenv sz,
build_compilenv f = (
cenv,
sz) ->
list_norepet (
map fst (
Csharpminor.fn_vars f)) ->
cenv_compat cenv (
Csharpminor.fn_vars f)
sz /\
cenv_separated cenv (
Csharpminor.fn_vars f).
Proof.
Lemma assign_variables_domain:
forall id vars cesz,
(
fst (
assign_variables cesz vars))!
id <>
None ->
(
fst cesz)!
id <>
None \/
In id (
map fst vars).
Proof.
induction vars;
simpl;
intros.
auto.
exploit IHvars;
eauto.
unfold assign_variable.
destruct a as [
id1 sz1].
destruct cesz as [
cenv stksz].
simpl.
rewrite PTree.gsspec.
destruct (
peq id id1).
auto.
tauto.
Qed.
Lemma build_compilenv_domain:
forall f cenv sz id ofs,
build_compilenv f = (
cenv,
sz) ->
cenv!
id =
Some ofs ->
In id (
map fst (
Csharpminor.fn_vars f)).
Proof.
Initialization of C#minor temporaries and Cminor local variables.
Lemma create_undef_temps_val:
forall id v temps, (
create_undef_temps temps)!
id =
Some v ->
In id temps /\
v =
Vundef.
Proof.
induction temps;
simpl;
intros.
rewrite PTree.gempty in H.
congruence.
rewrite PTree.gsspec in H.
destruct (
peq id a).
split.
auto.
congruence.
exploit IHtemps;
eauto.
tauto.
Qed.
Fixpoint set_params' (
vl:
list val) (
il:
list ident) (
te:
Cminor.env) :
Cminor.env :=
match il,
vl with
|
i1 ::
is,
v1 ::
vs =>
set_params'
vs is (
PTree.set i1 v1 te)
|
i1 ::
is,
nil =>
set_params'
nil is (
PTree.set i1 Vundef te)
|
_,
_ =>
te
end.
Lemma bind_parameters_agree_rec:
forall f vars vals tvals le1 le2 te,
bind_parameters vars vals le1 =
Some le2 ->
Val.inject_list f vals tvals ->
match_temps f le1 te ->
match_temps f le2 (
set_params'
tvals vars te).
Proof.
Opaque PTree.set.
induction vars;
simpl;
intros.
destruct vals;
try discriminate.
inv H.
auto.
destruct vals;
try discriminate.
inv H0.
simpl.
eapply IHvars;
eauto.
red;
intros.
rewrite PTree.gsspec in *.
destruct (
peq id a).
inv H0.
exists v';
auto.
apply H1;
auto.
Qed.
Lemma set_params'
_outside:
forall id il vl te, ~
In id il -> (
set_params'
vl il te)!
id =
te!
id.
Proof.
induction il;
simpl;
intros.
auto.
destruct vl;
rewrite IHil.
apply PTree.gso.
intuition.
intuition.
apply PTree.gso.
intuition.
intuition.
Qed.
Lemma set_params'
_inside:
forall id il vl te1 te2,
In id il ->
(
set_params'
vl il te1)!
id = (
set_params'
vl il te2)!
id.
Proof.
induction il;
simpl;
intros.
contradiction.
destruct vl;
destruct (
List.in_dec peq id il);
auto;
repeat rewrite set_params'
_outside;
auto;
assert (
a =
id)
by intuition;
subst a;
repeat rewrite PTree.gss;
auto.
Qed.
Lemma set_params_set_params':
forall il vl id,
list_norepet il ->
(
set_params vl il)!
id = (
set_params'
vl il (
PTree.empty val))!
id.
Proof.
induction il;
simpl;
intros.
auto.
inv H.
destruct vl.
rewrite PTree.gsspec.
destruct (
peq id a).
subst a.
rewrite set_params'
_outside;
auto.
rewrite PTree.gss;
auto.
rewrite IHil;
auto.
destruct (
List.in_dec peq id il).
apply set_params'
_inside;
auto.
repeat rewrite set_params'
_outside;
auto.
rewrite PTree.gso;
auto.
rewrite PTree.gsspec.
destruct (
peq id a).
subst a.
rewrite set_params'
_outside;
auto.
rewrite PTree.gss;
auto.
rewrite IHil;
auto.
destruct (
List.in_dec peq id il).
apply set_params'
_inside;
auto.
repeat rewrite set_params'
_outside;
auto.
rewrite PTree.gso;
auto.
Qed.
Lemma set_locals_outside:
forall e id il,
~
In id il -> (
set_locals il e)!
id =
e!
id.
Proof.
induction il;
simpl;
intros.
auto.
rewrite PTree.gso.
apply IHil.
tauto.
intuition.
Qed.
Lemma set_locals_inside:
forall e id il,
In id il -> (
set_locals il e)!
id =
Some Vundef.
Proof.
induction il;
simpl;
intros.
contradiction.
destruct H.
subst a.
apply PTree.gss.
rewrite PTree.gsspec.
destruct (
peq id a).
auto.
auto.
Qed.
Lemma set_locals_set_params':
forall vars vals params id,
list_norepet params ->
list_disjoint params vars ->
(
set_locals vars (
set_params vals params)) !
id =
(
set_params'
vals params (
set_locals vars (
PTree.empty val))) !
id.
Proof.
Lemma bind_parameters_agree:
forall f params temps vals tvals le,
bind_parameters params vals (
create_undef_temps temps) =
Some le ->
Val.inject_list f vals tvals ->
list_norepet params ->
list_disjoint params temps ->
match_temps f le (
set_locals temps (
set_params tvals params)).
Proof.
The main result in this section.
Theorem match_callstack_function_entry:
forall fn cenv tf m e m'
tm tm'
sp f cs args targs le,
build_compilenv fn = (
cenv,
tf.(
fn_stackspace)) ->
tf.(
fn_stackspace) <=
Ptrofs.max_unsigned ->
list_norepet (
map fst (
Csharpminor.fn_vars fn)) ->
list_norepet (
Csharpminor.fn_params fn) ->
list_disjoint (
Csharpminor.fn_params fn) (
Csharpminor.fn_temps fn) ->
alloc_variables Csharpminor.empty_env m (
Csharpminor.fn_vars fn)
e m' ->
bind_parameters (
Csharpminor.fn_params fn)
args (
create_undef_temps fn.(
fn_temps)) =
Some le ->
Val.inject_list f args targs ->
Mem.alloc tm 0
tf.(
fn_stackspace) = (
tm',
sp) ->
match_callstack f m tm cs (
Mem.nextblock m) (
Mem.nextblock tm) ->
Mem.inject f m tm ->
let te :=
set_locals (
Csharpminor.fn_temps fn) (
set_params targs (
Csharpminor.fn_params fn))
in
exists f',
match_callstack f'
m'
tm'
(
Frame cenv tf e le te sp (
Mem.nextblock m) (
Mem.nextblock m') ::
cs)
(
Mem.nextblock m') (
Mem.nextblock tm')
/\
Mem.inject f'
m'
tm'.
Proof.
Compatibility of evaluation functions with respect to memory injections.
Remark val_inject_val_of_bool:
forall f b,
Val.inject f (
Val.of_bool b) (
Val.of_bool b).
Proof.
intros; destruct b; constructor.
Qed.
Remark val_inject_val_of_optbool:
forall f ob,
Val.inject f (
Val.of_optbool ob) (
Val.of_optbool ob).
Proof.
intros; destruct ob; simpl. destruct b; constructor. constructor.
Qed.
Ltac TrivialExists :=
match goal with
| [ |-
exists y,
Some ?
x =
Some y /\
Val.inject _ _ _ ] =>
exists x;
split; [
auto |
try(
econstructor;
eauto)]
| [ |-
exists y,
_ /\
Val.inject _ (
Vint ?
x)
_ ] =>
exists (
Vint x);
split; [
eauto with evalexpr |
constructor]
| [ |-
exists y,
_ /\
Val.inject _ (
Vfloat ?
x)
_ ] =>
exists (
Vfloat x);
split; [
eauto with evalexpr |
constructor]
| [ |-
exists y,
_ /\
Val.inject _ (
Vlong ?
x)
_ ] =>
exists (
Vlong x);
split; [
eauto with evalexpr |
constructor]
|
_ =>
idtac
end.
Compatibility of eval_unop with respect to Val.inject.
Lemma eval_unop_compat:
forall f op v1 tv1 v,
eval_unop op v1 =
Some v ->
Val.inject f v1 tv1 ->
exists tv,
eval_unop op tv1 =
Some tv
/\
Val.inject f v tv.
Proof.
destruct op;
simpl;
intros.
inv H;
inv H0;
simpl;
TrivialExists.
inv H;
inv H0;
simpl;
TrivialExists.
inv H;
inv H0;
simpl;
TrivialExists.
inv H;
inv H0;
simpl;
TrivialExists.
inv H;
inv H0;
simpl;
TrivialExists.
inv H;
inv H0;
simpl;
TrivialExists.
inv H;
inv H0;
simpl;
TrivialExists.
inv H;
inv H0;
simpl;
TrivialExists.
inv H;
inv H0;
simpl;
TrivialExists.
inv H;
inv H0;
simpl;
TrivialExists.
inv H;
inv H0;
simpl;
TrivialExists.
inv H;
inv H0;
simpl;
TrivialExists.
inv H0;
simpl in H;
inv H.
simpl.
destruct (
Float.to_int f0);
simpl in *;
inv H1.
TrivialExists.
inv H0;
simpl in H;
inv H.
simpl.
destruct (
Float.to_intu f0);
simpl in *;
inv H1.
TrivialExists.
inv H0;
simpl in H;
inv H.
simpl.
TrivialExists.
inv H0;
simpl in H;
inv H.
simpl.
TrivialExists.
inv H0;
simpl in H;
inv H.
simpl.
destruct (
Float32.to_int f0);
simpl in *;
inv H1.
TrivialExists.
inv H0;
simpl in H;
inv H.
simpl.
destruct (
Float32.to_intu f0);
simpl in *;
inv H1.
TrivialExists.
inv H0;
simpl in H;
inv H.
simpl.
TrivialExists.
inv H0;
simpl in H;
inv H.
simpl.
TrivialExists.
inv H;
inv H0;
simpl;
TrivialExists.
inv H;
inv H0;
simpl;
TrivialExists.
inv H;
inv H0;
simpl;
TrivialExists.
inv H;
inv H0;
simpl;
TrivialExists.
inv H;
inv H0;
simpl;
TrivialExists.
inv H0;
simpl in H;
inv H.
simpl.
destruct (
Float.to_long f0);
simpl in *;
inv H1.
TrivialExists.
inv H0;
simpl in H;
inv H.
simpl.
destruct (
Float.to_longu f0);
simpl in *;
inv H1.
TrivialExists.
inv H0;
simpl in H;
inv H.
simpl.
TrivialExists.
inv H0;
simpl in H;
inv H.
simpl.
TrivialExists.
inv H0;
simpl in H;
inv H.
simpl.
destruct (
Float32.to_long f0);
simpl in *;
inv H1.
TrivialExists.
inv H0;
simpl in H;
inv H.
simpl.
destruct (
Float32.to_longu f0);
simpl in *;
inv H1.
TrivialExists.
inv H0;
simpl in H;
inv H.
simpl.
TrivialExists.
inv H0;
simpl in H;
inv H.
simpl.
TrivialExists.
Qed.
Compatibility of eval_binop with respect to Val.inject.
Lemma eval_binop_compat:
forall f op v1 tv1 v2 tv2 v m tm,
eval_binop op v1 v2 m =
Some v ->
Val.inject f v1 tv1 ->
Val.inject f v2 tv2 ->
Mem.inject f m tm ->
exists tv,
eval_binop op tv1 tv2 tm =
Some tv
/\
Val.inject f v tv.
Proof.
Correctness of Cminor construction functions
Correctness of the variable accessor var_addr
Lemma var_addr_correct:
forall cenv id f tf e le te sp lo hi m cs tm b,
match_callstack f m tm (
Frame cenv tf e le te sp lo hi ::
cs) (
Mem.nextblock m) (
Mem.nextblock tm) ->
eval_var_addr ge e id b ->
exists tv,
eval_expr tge (
Vptr sp Ptrofs.zero)
te tm (
var_addr cenv id)
tv
/\
Val.inject f (
Vptr b Ptrofs.zero)
tv.
Proof.
Semantic preservation for the translation
The proof of semantic preservation uses simulation diagrams of the
following form:
e, m1, s ----------------- sp, te1, tm1, ts
| |
t| |t
v v
e, m2, out --------------- sp, te2, tm2, tout
where
ts is the Cminor statement obtained by translating the
C#minor statement
s. The left vertical arrow is an execution
of a C#minor statement. The right vertical arrow is an execution
of a Cminor statement. The precondition (top vertical bar)
includes a
mem_inject relation between the memory states
m1 and
tm1,
and a
match_callstack relation for any callstack having
e,
te1,
sp as top frame. The postcondition (bottom vertical bar)
is the existence of a memory injection
f2 that extends the injection
f1 we started with, preserves the
match_callstack relation for
the transformed callstack at the final state, and validates a
outcome_inject relation between the outcomes
out and
tout.
Semantic preservation for expressions
Remark bool_of_val_inject:
forall f v tv b,
Val.bool_of_val v b ->
Val.inject f v tv ->
Val.bool_of_val tv b.
Proof.
intros. inv H0; inv H; constructor; auto.
Qed.
Lemma transl_constant_correct:
forall f sp cst v,
Csharpminor.eval_constant cst =
Some v ->
exists tv,
eval_constant tge sp (
transl_constant cst) =
Some tv
/\
Val.inject f v tv.
Proof.
destruct cst;
simpl;
intros;
inv H.
exists (
Vint i);
auto.
exists (
Vfloat f0);
auto.
exists (
Vsingle f0);
auto.
exists (
Vlong i);
auto.
Qed.
Lemma transl_expr_correct:
forall f m tm cenv tf e le te sp lo hi cs
(
MINJ:
Mem.inject f m tm)
(
MATCH:
match_callstack f m tm
(
Frame cenv tf e le te sp lo hi ::
cs)
(
Mem.nextblock m) (
Mem.nextblock tm)),
forall a v,
Csharpminor.eval_expr ge e le m a v ->
forall ta
(
TR:
transl_expr cenv a =
OK ta),
exists tv,
eval_expr tge (
Vptr sp Ptrofs.zero)
te tm ta tv
/\
Val.inject f v tv.
Proof.
induction 3;
intros;
simpl in TR;
try (
monadInv TR).
inv MATCH.
exploit MTMP;
eauto.
intros [
tv [
A B]].
exists tv;
split.
constructor;
auto.
auto.
eapply var_addr_correct;
eauto.
exploit transl_constant_correct;
eauto.
intros [
tv [
A B]].
exists tv;
split;
eauto.
constructor;
eauto.
exploit IHeval_expr;
eauto.
intros [
tv1 [
EVAL1 INJ1]].
exploit eval_unop_compat;
eauto.
intros [
tv [
EVAL INJ]].
exists tv;
split;
auto.
econstructor;
eauto.
exploit IHeval_expr1;
eauto.
intros [
tv1 [
EVAL1 INJ1]].
exploit IHeval_expr2;
eauto.
intros [
tv2 [
EVAL2 INJ2]].
exploit eval_binop_compat;
eauto.
intros [
tv [
EVAL INJ]].
exists tv;
split.
econstructor;
eauto.
auto.
exploit IHeval_expr;
eauto.
intros [
tv1 [
EVAL1 INJ1]].
exploit Mem.loadv_inject;
eauto.
intros [
tv [
LOAD INJ]].
exists tv;
split.
econstructor;
eauto.
auto.
Qed.
Lemma transl_exprlist_correct:
forall f m tm cenv tf e le te sp lo hi cs
(
MINJ:
Mem.inject f m tm)
(
MATCH:
match_callstack f m tm
(
Frame cenv tf e le te sp lo hi ::
cs)
(
Mem.nextblock m) (
Mem.nextblock tm)),
forall a v,
Csharpminor.eval_exprlist ge e le m a v ->
forall ta
(
TR:
transl_exprlist cenv a =
OK ta),
exists tv,
eval_exprlist tge (
Vptr sp Ptrofs.zero)
te tm ta tv
/\
Val.inject_list f v tv.
Proof.
induction 3;
intros;
monadInv TR.
exists (@
nil val);
split.
constructor.
constructor.
exploit transl_expr_correct;
eauto.
intros [
tv1 [
EVAL1 VINJ1]].
exploit IHeval_exprlist;
eauto.
intros [
tv2 [
EVAL2 VINJ2]].
exists (
tv1 ::
tv2);
split.
constructor;
auto.
constructor;
auto.
Qed.
Semantic preservation for statements and functions
Inductive match_cont:
Csharpminor.cont ->
Cminor.cont ->
compilenv ->
exit_env ->
callstack ->
Prop :=
|
match_Kstop:
forall cenv xenv,
match_cont Csharpminor.Kstop Kstop cenv xenv nil
|
match_Kseq:
forall s k ts tk cenv xenv cs,
transl_stmt cenv xenv s =
OK ts ->
match_cont k tk cenv xenv cs ->
match_cont (
Csharpminor.Kseq s k) (
Kseq ts tk)
cenv xenv cs
|
match_Kseq2:
forall s1 s2 k ts1 tk cenv xenv cs,
transl_stmt cenv xenv s1 =
OK ts1 ->
match_cont (
Csharpminor.Kseq s2 k)
tk cenv xenv cs ->
match_cont (
Csharpminor.Kseq (
Csharpminor.Sseq s1 s2)
k)
(
Kseq ts1 tk)
cenv xenv cs
|
match_Kblock:
forall k tk cenv xenv cs,
match_cont k tk cenv xenv cs ->
match_cont (
Csharpminor.Kblock k) (
Kblock tk)
cenv (
true ::
xenv)
cs
|
match_Kblock2:
forall k tk cenv xenv cs,
match_cont k tk cenv xenv cs ->
match_cont k (
Kblock tk)
cenv (
false ::
xenv)
cs
|
match_Kcall:
forall optid fn e le k tfn sp te tk cenv xenv lo hi cs sz cenv',
transl_funbody cenv sz fn =
OK tfn ->
match_cont k tk cenv xenv cs ->
match_cont (
Csharpminor.Kcall optid fn e le k)
(
Kcall optid tfn (
Vptr sp Ptrofs.zero)
te tk)
cenv'
nil
(
Frame cenv tfn e le te sp lo hi ::
cs).
Inductive match_states:
Csharpminor.state ->
Cminor.state ->
Prop :=
|
match_state:
forall fn s k e le m tfn ts tk sp te tm cenv xenv f lo hi cs sz
(
TRF:
transl_funbody cenv sz fn =
OK tfn)
(
TR:
transl_stmt cenv xenv s =
OK ts)
(
MINJ:
Mem.inject f m tm)
(
MCS:
match_callstack f m tm
(
Frame cenv tfn e le te sp lo hi ::
cs)
(
Mem.nextblock m) (
Mem.nextblock tm))
(
MK:
match_cont k tk cenv xenv cs),
match_states (
Csharpminor.State fn s k e le m)
(
State tfn ts tk (
Vptr sp Ptrofs.zero)
te tm)
|
match_state_seq:
forall fn s1 s2 k e le m tfn ts1 tk sp te tm cenv xenv f lo hi cs sz
(
TRF:
transl_funbody cenv sz fn =
OK tfn)
(
TR:
transl_stmt cenv xenv s1 =
OK ts1)
(
MINJ:
Mem.inject f m tm)
(
MCS:
match_callstack f m tm
(
Frame cenv tfn e le te sp lo hi ::
cs)
(
Mem.nextblock m) (
Mem.nextblock tm))
(
MK:
match_cont (
Csharpminor.Kseq s2 k)
tk cenv xenv cs),
match_states (
Csharpminor.State fn (
Csharpminor.Sseq s1 s2)
k e le m)
(
State tfn ts1 tk (
Vptr sp Ptrofs.zero)
te tm)
|
match_callstate:
forall fd args k m tfd targs tk tm f cs cenv
(
TR:
transl_fundef fd =
OK tfd)
(
MINJ:
Mem.inject f m tm)
(
MCS:
match_callstack f m tm cs (
Mem.nextblock m) (
Mem.nextblock tm))
(
MK:
match_cont k tk cenv nil cs)
(
ISCC:
Csharpminor.is_call_cont k)
(
ARGSINJ:
Val.inject_list f args targs),
match_states (
Csharpminor.Callstate fd args k m)
(
Callstate tfd targs tk tm)
|
match_returnstate:
forall v k m tv tk tm f cs cenv
(
MINJ:
Mem.inject f m tm)
(
MCS:
match_callstack f m tm cs (
Mem.nextblock m) (
Mem.nextblock tm))
(
MK:
match_cont k tk cenv nil cs)
(
RESINJ:
Val.inject f v tv),
match_states (
Csharpminor.Returnstate v k m)
(
Returnstate tv tk tm).
Remark val_inject_function_pointer:
forall bound v fd f tv,
Genv.find_funct ge v =
Some fd ->
match_globalenvs f bound ->
Val.inject f v tv ->
tv =
v.
Proof.
Lemma match_call_cont:
forall k tk cenv xenv cs,
match_cont k tk cenv xenv cs ->
match_cont (
Csharpminor.call_cont k) (
call_cont tk)
cenv nil cs.
Proof.
induction 1; simpl; auto; econstructor; eauto.
Qed.
Lemma match_is_call_cont:
forall tfn te sp tm k tk cenv xenv cs,
match_cont k tk cenv xenv cs ->
Csharpminor.is_call_cont k ->
exists tk',
star step tge (
State tfn Sskip tk sp te tm)
E0 (
State tfn Sskip tk'
sp te tm)
/\
is_call_cont tk'
/\
match_cont k tk'
cenv nil cs.
Proof.
induction 1;
simpl;
intros;
try contradiction.
econstructor;
split.
apply star_refl.
split.
exact I.
econstructor;
eauto.
exploit IHmatch_cont;
eauto.
intros [
tk' [
A B]].
exists tk';
split.
eapply star_left;
eauto.
constructor.
traceEq.
auto.
econstructor;
split.
apply star_refl.
split.
exact I.
econstructor;
eauto.
Qed.
Properties of switch compilation
Inductive lbl_stmt_tail:
lbl_stmt ->
nat ->
lbl_stmt ->
Prop :=
|
lstail_O:
forall sl,
lbl_stmt_tail sl O sl
|
lstail_S:
forall c s sl n sl',
lbl_stmt_tail sl n sl' ->
lbl_stmt_tail (
LScons c s sl) (
S n)
sl'.
Lemma switch_table_default:
forall sl base,
exists n,
lbl_stmt_tail sl n (
select_switch_default sl)
/\
snd (
switch_table sl base) = (
n +
base)%
nat.
Proof.
induction sl;
simpl;
intros.
-
exists O;
split.
constructor.
lia.
-
destruct o.
+
destruct (
IHsl (
S base))
as (
n &
P &
Q).
exists (
S n);
split.
constructor;
auto.
destruct (
switch_table sl (
S base))
as [
tbl dfl];
simpl in *.
lia.
+
exists O;
split.
constructor.
destruct (
switch_table sl (
S base))
as [
tbl dfl];
simpl in *.
auto.
Qed.
Lemma switch_table_case:
forall i sl base dfl,
match select_switch_case i sl with
|
None =>
switch_target i dfl (
fst (
switch_table sl base)) =
dfl
|
Some sl' =>
exists n,
lbl_stmt_tail sl n sl'
/\
switch_target i dfl (
fst (
switch_table sl base)) = (
n +
base)%
nat
end.
Proof.
induction sl;
simpl;
intros.
-
auto.
-
destruct (
switch_table sl (
S base))
as [
tbl1 dfl1]
eqn:
ST.
destruct o;
simpl.
rewrite dec_eq_sym.
destruct (
zeq i z).
exists O;
split;
auto.
constructor.
specialize (
IHsl (
S base)
dfl).
rewrite ST in IHsl.
simpl in *.
destruct (
select_switch_case i sl).
destruct IHsl as (
x &
P &
Q).
exists (
S x);
split.
constructor;
auto.
lia.
auto.
specialize (
IHsl (
S base)
dfl).
rewrite ST in IHsl.
simpl in *.
destruct (
select_switch_case i sl).
destruct IHsl as (
x &
P &
Q).
exists (
S x);
split.
constructor;
auto.
lia.
auto.
Qed.
Lemma switch_table_select:
forall i sl,
lbl_stmt_tail sl
(
switch_target i (
snd (
switch_table sl O)) (
fst (
switch_table sl O)))
(
select_switch i sl).
Proof.
Inductive transl_lblstmt_cont(
cenv:
compilenv) (
xenv:
exit_env):
lbl_stmt ->
cont ->
cont ->
Prop :=
|
tlsc_default:
forall k,
transl_lblstmt_cont cenv xenv LSnil k (
Kblock (
Kseq Sskip k))
|
tlsc_case:
forall i s ls k ts k',
transl_stmt cenv (
switch_env (
LScons i s ls)
xenv)
s =
OK ts ->
transl_lblstmt_cont cenv xenv ls k k' ->
transl_lblstmt_cont cenv xenv (
LScons i s ls)
k (
Kblock (
Kseq ts k')).
Lemma switch_descent:
forall cenv xenv k ls body s,
transl_lblstmt cenv (
switch_env ls xenv)
ls body =
OK s ->
exists k',
transl_lblstmt_cont cenv xenv ls k k'
/\ (
forall f sp e m,
plus step tge (
State f s k sp e m)
E0 (
State f body k'
sp e m)).
Proof.
induction ls;
intros.
-
monadInv H.
econstructor;
split.
econstructor.
intros.
eapply plus_two.
constructor.
constructor.
auto.
-
monadInv H.
exploit IHls;
eauto.
intros [
k' [
A B]].
econstructor;
split.
econstructor;
eauto.
intros.
eapply plus_star_trans.
eauto.
eapply star_left.
constructor.
apply star_one.
constructor.
reflexivity.
traceEq.
Qed.
Lemma switch_ascent:
forall f sp e m cenv xenv ls n ls',
lbl_stmt_tail ls n ls' ->
forall k k1,
transl_lblstmt_cont cenv xenv ls k k1 ->
exists k2,
star step tge (
State f (
Sexit n)
k1 sp e m)
E0 (
State f (
Sexit O)
k2 sp e m)
/\
transl_lblstmt_cont cenv xenv ls'
k k2.
Proof.
induction 1;
intros.
-
exists k1;
split;
auto.
apply star_refl.
-
inv H0.
exploit IHlbl_stmt_tail;
eauto.
intros (
k2 &
P &
Q).
exists k2;
split;
auto.
eapply star_left.
constructor.
eapply star_left.
constructor.
eexact P.
eauto.
auto.
Qed.
Lemma switch_match_cont:
forall cenv xenv k cs tk ls tk',
match_cont k tk cenv xenv cs ->
transl_lblstmt_cont cenv xenv ls tk tk' ->
match_cont (
Csharpminor.Kseq (
seq_of_lbl_stmt ls)
k)
tk'
cenv (
false ::
switch_env ls xenv)
cs.
Proof.
Lemma switch_match_states:
forall fn k e le m tfn ts tk sp te tm cenv xenv f lo hi cs sz ls body tk'
(
TRF:
transl_funbody cenv sz fn =
OK tfn)
(
TR:
transl_lblstmt cenv (
switch_env ls xenv)
ls body =
OK ts)
(
MINJ:
Mem.inject f m tm)
(
MCS:
match_callstack f m tm
(
Frame cenv tfn e le te sp lo hi ::
cs)
(
Mem.nextblock m) (
Mem.nextblock tm))
(
MK:
match_cont k tk cenv xenv cs)
(
TK:
transl_lblstmt_cont cenv xenv ls tk tk'),
exists S,
plus step tge (
State tfn (
Sexit O)
tk' (
Vptr sp Ptrofs.zero)
te tm)
E0 S
/\
match_states (
Csharpminor.State fn (
seq_of_lbl_stmt ls)
k e le m)
S.
Proof.
Lemma transl_lblstmt_suffix:
forall cenv xenv ls n ls',
lbl_stmt_tail ls n ls' ->
forall body ts,
transl_lblstmt cenv (
switch_env ls xenv)
ls body =
OK ts ->
exists body',
exists ts',
transl_lblstmt cenv (
switch_env ls'
xenv)
ls'
body' =
OK ts'.
Proof.
induction 1; intros.
- exists body, ts; auto.
- monadInv H0. eauto.
Qed.
Commutation between find_label and compilation
Section FIND_LABEL.
Variable lbl:
label.
Variable cenv:
compilenv.
Variable cs:
callstack.
Lemma transl_lblstmt_find_label_context:
forall xenv ls body ts tk1 tk2 ts'
tk',
transl_lblstmt cenv (
switch_env ls xenv)
ls body =
OK ts ->
transl_lblstmt_cont cenv xenv ls tk1 tk2 ->
find_label lbl body tk2 =
Some (
ts',
tk') ->
find_label lbl ts tk1 =
Some (
ts',
tk').
Proof.
induction ls; intros.
- monadInv H. inv H0. simpl. rewrite H1. auto.
- monadInv H. inv H0. simpl in H6. eapply IHls; eauto.
replace x with ts0 by congruence. simpl. rewrite H1. auto.
Qed.
Lemma transl_find_label:
forall s k xenv ts tk,
transl_stmt cenv xenv s =
OK ts ->
match_cont k tk cenv xenv cs ->
match Csharpminor.find_label lbl s k with
|
None =>
find_label lbl ts tk =
None
|
Some(
s',
k') =>
exists ts',
exists tk',
exists xenv',
find_label lbl ts tk =
Some(
ts',
tk')
/\
transl_stmt cenv xenv'
s' =
OK ts'
/\
match_cont k'
tk'
cenv xenv'
cs
end
with transl_lblstmt_find_label:
forall ls xenv body k ts tk tk1,
transl_lblstmt cenv (
switch_env ls xenv)
ls body =
OK ts ->
match_cont k tk cenv xenv cs ->
transl_lblstmt_cont cenv xenv ls tk tk1 ->
find_label lbl body tk1 =
None ->
match Csharpminor.find_label_ls lbl ls k with
|
None =>
find_label lbl ts tk =
None
|
Some(
s',
k') =>
exists ts',
exists tk',
exists xenv',
find_label lbl ts tk =
Some(
ts',
tk')
/\
transl_stmt cenv xenv'
s' =
OK ts'
/\
match_cont k'
tk'
cenv xenv'
cs
end.
Proof.
intros.
destruct s;
try (
monadInv H);
simpl;
auto.
exploit (
transl_find_label s1).
eauto.
eapply match_Kseq.
eexact EQ1.
eauto.
destruct (
Csharpminor.find_label lbl s1 (
Csharpminor.Kseq s2 k))
as [[
s'
k'] | ].
intros [
ts' [
tk' [
xenv' [
A [
B C]]]]].
exists ts';
exists tk';
exists xenv'.
intuition.
rewrite A;
auto.
intro.
rewrite H.
apply transl_find_label with xenv;
auto.
exploit (
transl_find_label s1).
eauto.
eauto.
destruct (
Csharpminor.find_label lbl s1 k)
as [[
s'
k'] | ].
intros [
ts' [
tk' [
xenv' [
A [
B C]]]]].
exists ts';
exists tk';
exists xenv'.
intuition.
rewrite A;
auto.
intro.
rewrite H.
apply transl_find_label with xenv;
auto.
apply transl_find_label with xenv.
auto.
econstructor;
eauto.
simpl.
rewrite EQ;
auto.
apply transl_find_label with (
true ::
xenv).
auto.
constructor;
auto.
simpl in H.
destruct (
switch_table l O)
as [
tbl dfl].
monadInv H.
exploit switch_descent;
eauto.
intros [
k' [
A B]].
eapply transl_lblstmt_find_label.
eauto.
eauto.
eauto.
reflexivity.
destruct o;
monadInv H;
auto.
destruct (
ident_eq lbl l).
exists x;
exists tk;
exists xenv;
auto.
apply transl_find_label with xenv;
auto.
intros.
destruct ls;
monadInv H;
simpl.
inv H1.
rewrite H2.
auto.
inv H1.
simpl in H7.
exploit (
transl_find_label s).
eauto.
eapply switch_match_cont;
eauto.
destruct (
Csharpminor.find_label lbl s (
Csharpminor.Kseq (
seq_of_lbl_stmt ls)
k))
as [[
s'
k''] | ].
intros [
ts' [
tk' [
xenv' [
A [
B C]]]]].
exists ts';
exists tk';
exists xenv';
intuition.
eapply transl_lblstmt_find_label_context;
eauto.
simpl.
replace x with ts0 by congruence.
rewrite H2.
auto.
intro.
eapply transl_lblstmt_find_label.
eauto.
auto.
eauto.
simpl.
replace x with ts0 by congruence.
rewrite H2.
auto.
Qed.
End FIND_LABEL.
Lemma transl_find_label_body:
forall cenv xenv size f tf k tk cs lbl s'
k',
transl_funbody cenv size f =
OK tf ->
match_cont k tk cenv xenv cs ->
Csharpminor.find_label lbl f.(
Csharpminor.fn_body) (
Csharpminor.call_cont k) =
Some (
s',
k') ->
exists ts',
exists tk',
exists xenv',
find_label lbl tf.(
fn_body) (
call_cont tk) =
Some(
ts',
tk')
/\
transl_stmt cenv xenv'
s' =
OK ts'
/\
match_cont k'
tk'
cenv xenv'
cs.
Proof.
The simulation diagram.
Fixpoint seq_left_depth (
s:
Csharpminor.stmt) :
nat :=
match s with
|
Csharpminor.Sseq s1 s2 =>
S (
seq_left_depth s1)
|
_ =>
O
end.
Definition measure (
S:
Csharpminor.state) :
nat :=
match S with
|
Csharpminor.State fn s k e le m =>
seq_left_depth s
|
_ =>
O
end.
Lemma transl_step_correct:
forall S1 t S2,
Csharpminor.step ge S1 t S2 ->
forall T1,
match_states S1 T1 ->
(
exists T2,
plus step tge T1 t T2 /\
match_states S2 T2)
\/ (
measure S2 <
measure S1 /\
t =
E0 /\
match_states S2 T1)%
nat.
Proof.
Lemma match_globalenvs_init:
forall m,
Genv.init_mem prog =
Some m ->
match_globalenvs (
Mem.flat_inj (
Mem.nextblock m)) (
Mem.nextblock m).
Proof.
Lemma transl_initial_states:
forall S,
Csharpminor.initial_state prog S ->
exists R,
Cminor.initial_state tprog R /\
match_states S R.
Proof.
Lemma transl_final_states:
forall S R r,
match_states S R ->
Csharpminor.final_state S r ->
Cminor.final_state R r.
Proof.
intros. inv H0. inv H. inv MK. inv RESINJ. constructor.
Qed.
Theorem transl_program_correct:
forward_simulation (
Csharpminor.semantics prog) (
Cminor.semantics tprog).
Proof.
End TRANSLATION.