source: LTS/Vm.ma @ 3489

Last change on this file since 3489 was 3489, checked in by sacerdot, 5 years ago

Second daemon closed.

File size: 42.7 KB
Line 
1include "costs.ma".
2include "basics/lists/list.ma".
3include "../src/utilities/option.ma".
4include "basics/jmeq.ma".
5
6lemma bind_inversion : ∀A,B : Type[0].∀m : option A.
7∀f : A → option B.∀y : B.
8! x ← m; f x = return y →
9∃ x.(m = return x) ∧ (f x = return y).
10#A #B * [| #a] #f #y normalize #EQ [destruct]
11%{a} %{(refl …)} //
12qed.
13
14record assembler_params : Type[1] ≝
15{ seq_instr : Type[0]
16; jump_condition : Type[0]
17; io_instr : Type[0] }.
18
19inductive AssemblerInstr (p : assembler_params) : Type[0] ≝
20| Seq : seq_instr p → option (NonFunctionalLabel) →  AssemblerInstr p
21| Ijmp: ℕ → AssemblerInstr p
22| CJump : jump_condition p → ℕ → NonFunctionalLabel → NonFunctionalLabel → AssemblerInstr p
23| Iio : NonFunctionalLabel → io_instr p → NonFunctionalLabel → AssemblerInstr p
24| Icall: FunctionName → AssemblerInstr p
25| Iret: AssemblerInstr p.
26
27definition labels_pc_of_instr : ∀p.AssemblerInstr p → ℕ → list (CostLabel × ℕ) ≝
28λp,i,program_counter.
29match i with
30  [ Seq _ opt_l ⇒ match opt_l with
31                  [ Some lbl ⇒ [〈(a_non_functional_label lbl),S program_counter〉]
32                  | None ⇒ [ ]
33                  ]
34  | Ijmp _ ⇒ [ ]
35  | CJump _ newpc ltrue lfalse ⇒ [〈(a_non_functional_label ltrue),newpc〉;
36                                  〈(a_non_functional_label lfalse),S program_counter〉]
37  | Iio lin _ lout ⇒ [〈(a_non_functional_label lin),program_counter〉;
38                      〈(a_non_functional_label lout),S program_counter〉]
39  | Icall f ⇒ [ ]
40  | Iret ⇒ [ ]
41  ].
42
43let rec labels_pc (p : assembler_params)
44(prog : list (AssemblerInstr p)) (call_label_fun : list (ℕ × CallCostLabel))
45              (return_label_fun : list (ℕ × ReturnPostCostLabel)) (i_act : NonFunctionalLabel)
46              (program_counter : ℕ) on prog : list (CostLabel × ℕ) ≝
47match prog with
48[ nil ⇒ [〈a_non_functional_label (i_act),O〉] @
49        map … (λx.let〈y,z〉 ≝ x in 〈(a_call z),y〉) (call_label_fun) @
50        map … (λx.let〈y,z〉 ≝ x in 〈(a_return_post z),y〉) (return_label_fun)
51| cons i is ⇒ (labels_pc_of_instr … i program_counter)@labels_pc p is call_label_fun return_label_fun i_act (S program_counter)
52].
53
54include "basics/lists/listb.ma".
55
56(*doppione da mettere a posto*)
57let rec no_duplicates (A : DeqSet) (l : list A) on l : Prop ≝
58match l with
59[ nil ⇒ True
60| cons x xs ⇒ ¬ (bool_to_Prop (x ∈ xs)) ∧ no_duplicates … xs
61].
62
63
64record AssemblerProgram (p : assembler_params) : Type[0] ≝
65{ instructions : list (AssemblerInstr p)
66; endmain : ℕ
67; endmain_ok : endmain < |instructions|
68; entry_of_function : FunctionName → ℕ
69; call_label_fun : list (ℕ × CallCostLabel)
70; return_label_fun : list (ℕ × ReturnPostCostLabel)
71; in_act : NonFunctionalLabel
72; asm_no_duplicates : no_duplicates … (map ?? \fst … (labels_pc … instructions call_label_fun return_label_fun in_act O))
73}.
74
75
76definition fetch: ∀p.AssemblerProgram p → ℕ → option (AssemblerInstr p) ≝
77 λp,l,n. nth_opt ? n (instructions … l).
78
79definition stackT: Type[0] ≝ list (nat).
80
81record sem_params (p : assembler_params) : Type[1] ≝
82{ m : monoid
83; asm_store_type : Type[0]
84; eval_asm_seq : seq_instr p → asm_store_type → option asm_store_type
85; eval_asm_cond : jump_condition p → asm_store_type → option bool
86; eval_asm_io : io_instr p → asm_store_type → option asm_store_type
87; cost_of_io : io_instr p → asm_store_type → m
88; cost_of : AssemblerInstr p → asm_store_type →  m
89}.
90
91record vm_state (p : assembler_params) (p' : sem_params p) : Type[0] ≝
92{ pc : ℕ
93; asm_stack : stackT
94; asm_store : asm_store_type … p'
95; asm_is_io : bool
96; cost : m … p'
97}.
98
99definition label_of_pc ≝ λL.λl.λpc.find …
100   (λp.let 〈x,y〉 ≝ p in if eqb x pc then Some L y else None ? ) l.
101   
102definition option_pop ≝
103  λA.λl:list A. match l with
104  [ nil ⇒ None ?
105  | cons a tl ⇒ Some ? (〈a,tl〉) ].
106
107
108inductive vmstep (p : assembler_params) (p' : sem_params p)
109   (prog : AssemblerProgram p)  :
110      ActionLabel → relation (vm_state p p') ≝
111| vm_seq : ∀st1,st2 : vm_state p p'.∀i,l.
112           fetch … prog (pc … st1) = return (Seq p i l) →
113           asm_is_io … st1 = false →
114           eval_asm_seq p p' i (asm_store … st1) = return asm_store … st2 → 
115           asm_stack … st1 = asm_stack … st2 →
116           asm_is_io … st1 = asm_is_io … st2 →
117           S (pc … st1) = pc … st2 →
118           op … (cost … st1) (cost_of p p' (Seq p i l) (asm_store … st1)) = cost … st2 →
119           vmstep … (cost_act l) st1 st2
120| vm_ijump : ∀st1,st2 : vm_state p p'.∀new_pc : ℕ.
121           fetch … prog (pc … st1) = return (Ijmp p new_pc) →
122           asm_is_io … st1 = false →
123           asm_store … st1 = asm_store … st2 →
124           asm_stack … st1 = asm_stack … st2 →
125           asm_is_io … st1 = asm_is_io … st2 →
126           new_pc = pc … st2 →
127           op … (cost … st1) (cost_of p p' (Ijmp … new_pc) (asm_store … st1)) = cost … st2 →
128           vmstep … (cost_act (None ?)) st1 st2
129| vm_cjump_true :
130           ∀st1,st2 : vm_state p p'.∀cond,new_pc,ltrue,lfalse.
131           eval_asm_cond p p' cond (asm_store … st1) = return true→
132           fetch … prog (pc … st1) = return (CJump p cond new_pc ltrue lfalse) →
133           asm_is_io … st1 = false →
134           asm_store … st1 = asm_store … st2 →
135           asm_stack … st1 = asm_stack … st2 →
136           asm_is_io … st1 = asm_is_io … st2 →
137           pc … st2 = new_pc →
138           op … (cost … st1) (cost_of p p' (CJump p cond new_pc ltrue lfalse) (asm_store … st1)) = cost … st2 →
139           vmstep … (cost_act (Some ? ltrue)) st1 st2
140| vm_cjump_false :
141           ∀st1,st2 : vm_state p p'.∀cond,new_pc,ltrue,lfalse.
142           eval_asm_cond p p' cond (asm_store … st1) = return false→
143           fetch … prog (pc … st1) = return (CJump p cond new_pc ltrue lfalse) →
144           asm_is_io … st1 = false →
145           asm_store … st1 = asm_store … st2 →
146           asm_stack … st1 = asm_stack … st2 →
147           asm_is_io … st1 = asm_is_io … st2 →
148           S (pc … st1) = pc … st2 →
149           op … (cost … st1) (cost_of p p' (CJump … cond new_pc ltrue lfalse) (asm_store … st1)) = cost … st2 →
150           vmstep … (cost_act (Some ? lfalse)) st1 st2
151| vm_io_in : 
152           ∀st1,st2 : vm_state p p'.∀lin,io,lout.
153           fetch … prog (pc … st1) = return (Iio p lin io lout) →
154           asm_is_io … st1 = false →
155           asm_store … st1 = asm_store … st2 →
156           asm_stack … st1 = asm_stack … st2 →
157           true = asm_is_io … st2 →
158           pc … st1 = pc … st2 →
159           cost … st1 = cost … st2 →
160           vmstep … (cost_act (Some ? lin)) st1 st2
161| vm_io_out :
162           ∀st1,st2 : vm_state p p'.∀lin,io,lout.
163           fetch … prog (pc … st1) = return (Iio p lin io lout) →
164           asm_is_io … st1 = true →
165           eval_asm_io … io (asm_store … st1) = return asm_store … st2 →
166           asm_stack … st1 = asm_stack … st2 →
167           false = asm_is_io … st2 →
168           S (pc … st1) = pc … st2 →
169           op … (cost … st1) (cost_of_io p p' io (asm_store … st1)) = cost … st2 →
170           vmstep … (cost_act (Some ? lout)) st1 st2
171| vm_call :
172           ∀st1,st2 : vm_state p p'.∀f,lbl.
173           fetch … prog (pc … st1) = return (Icall p f) →
174           asm_is_io … st1 = false →
175           asm_store … st1 = asm_store … st2 →
176           S (pc … st1) ::  asm_stack … st1 = asm_stack … st2 →
177           asm_is_io … st1 = asm_is_io … st2 →
178           entry_of_function … prog f = pc … st2 →
179           op … (cost … st1) (cost_of p p' (Icall p f) (asm_store … st1)) = cost … st2 →
180           label_of_pc ? (call_label_fun … prog) (entry_of_function … prog f) = return lbl →
181           vmstep … (call_act f lbl) st1 st2
182| vm_ret :
183          ∀st1,st2 : vm_state p p'.∀newpc,lbl.
184           fetch … prog (pc … st1) = return (Iret p) →
185           asm_is_io … st1 = false →
186           asm_store … st1 = asm_store … st2 →
187           asm_stack … st1 = newpc ::  asm_stack … st2  →
188           asm_is_io … st1 = asm_is_io … st2 →
189           newpc = pc … st2 →
190           label_of_pc ? (return_label_fun … prog) newpc = return lbl →
191           op … (cost … st1) (cost_of p p' (Iret p) (asm_store … st1)) = cost … st2 →
192           vmstep … (ret_act (Some ? lbl)) st1 st2.
193
194definition eval_vmstate : ∀p : assembler_params.∀p' : sem_params p.
195AssemblerProgram p → vm_state p p' → option (ActionLabel × (vm_state p p')) ≝
196λp,p',prog,st.
197! i ← fetch … prog (pc … st);
198match i with
199[ Seq x opt_l ⇒
200   if asm_is_io … st then
201     None ?
202   else
203     ! new_store ← eval_asm_seq p p' x (asm_store … st);
204     return 〈cost_act opt_l,
205             mk_vm_state ?? (S (pc … st)) (asm_stack … st) new_store false
206                (op … (cost … st) (cost_of p p' (Seq p x opt_l) (asm_store … st)))〉
207| Ijmp newpc ⇒
208   if asm_is_io … st then
209     None ?
210   else
211     return 〈cost_act (None ?),
212             mk_vm_state ?? newpc (asm_stack … st) (asm_store … st) false
213                (op … (cost … st) (cost_of p p' (Ijmp … newpc) (asm_store … st)))〉
214| CJump cond newpc ltrue lfalse ⇒
215   if asm_is_io … st then
216     None ?
217   else
218     ! b ← eval_asm_cond p p' cond (asm_store … st);
219     if b then
220       return 〈cost_act (Some ? ltrue),
221               mk_vm_state ?? newpc (asm_stack … st) (asm_store … st) false
222                (op … (cost … st) (cost_of p p' (CJump … cond newpc ltrue lfalse) (asm_store … st)))〉
223     else
224       return 〈cost_act (Some ? lfalse),
225               mk_vm_state ?? (S (pc … st)) (asm_stack … st) (asm_store … st) false
226                (op … (cost … st) (cost_of p p' (CJump … cond newpc ltrue lfalse) (asm_store … st)))〉
227| Iio lin io lout ⇒
228              if asm_is_io … st then
229                 ! new_store ← eval_asm_io … io (asm_store … st);
230                 return 〈cost_act (Some ? lout),
231                         mk_vm_state ?? (S (pc … st)) (asm_stack … st)
232                         new_store false
233                         (op … (cost … st)
234                               (cost_of_io p p' io (asm_store … st)))〉   
235              else
236                return 〈cost_act (Some ? lin),
237                        mk_vm_state ?? (pc … st) (asm_stack … st) (asm_store … st)
238                                    true (cost … st)〉
239| Icall f ⇒
240    if asm_is_io … st then
241      None ?
242    else
243      ! lbl ← label_of_pc ? (call_label_fun … prog) (entry_of_function … prog f);
244      return 〈call_act f lbl,
245              mk_vm_state ?? (entry_of_function … prog f)
246                             ((S (pc … st)) :: (asm_stack … st))
247                             (asm_store … st) false
248                             (op … (cost … st) (cost_of p p' (Icall p f) (asm_store … st)))〉
249| Iret ⇒ if asm_is_io … st then
250            None ?
251         else
252            ! 〈newpc,tl〉 ← option_pop … (asm_stack … st);
253            ! lbl ← label_of_pc ? (return_label_fun … prog) newpc;
254            return 〈ret_act (Some ? lbl),
255                    mk_vm_state ?? newpc tl (asm_store … st) false   
256                     (op … (cost … st) (cost_of p p' (Iret p) (asm_store … st)))〉
257].
258
259lemma eval_vmstate_to_Prop : ∀p,p',prog,st1,st2,l.
260eval_vmstate p p' prog st1 = return 〈l,st2〉 → vmstep … prog l st1 st2.
261#p #p' #prog #st1 #st2 #l whd in match eval_vmstate; normalize nodelta
262#H cases(bind_inversion ????? H) -H * normalize nodelta
263[ #seq #opt_l * #EQfetch inversion(asm_is_io ???) normalize nodelta
264  [ #_ whd in ⊢ (??%% → ?); #EQ destruct] #EQio #H cases(bind_inversion ????? H)
265  #newstore * #EQnewstore whd in ⊢ (??%% → ?); #EQ destruct
266  @vm_seq //
267| #newpc * #EQfetch inversion(asm_is_io ???) normalize nodelta #EQio
268  [ whd in ⊢ (??%% → ?); #EQ destruct] whd in ⊢ (??%% → ?); #EQ destruct
269  @vm_ijump //
270| #cond #new_pc #ltrue #lfase * #EQfetch inversion(asm_is_io ???) normalize nodelta
271  [ #_ whd in ⊢ (??%% → ?); #EQ destruct] #EQio #H cases(bind_inversion ????? H) -H
272  * normalize nodelta * #EQcond whd in ⊢ (??%% → ?); #EQ destruct
273  [ @(vm_cjump_true … EQfetch) // | @(vm_cjump_false … EQfetch) //]
274| #lin #io #lout * #EQfetch inversion(asm_is_io ???) normalize nodelta #EQio
275  [ #H cases(bind_inversion ????? H) -H #newstore * #EQnewstore ]
276  whd in ⊢ (??%% → ?); #EQ destruct
277  [ @(vm_io_out … EQfetch) // | @(vm_io_in … EQfetch) // ]
278| #f * #EQfetch inversion(asm_is_io ???) #EQio normalize nodelta
279  [ whd in ⊢ (??%% → ?); #EQ destruct ] #H cases (bind_inversion ????? H) -H
280  #lbl * #EQlb whd in ⊢ (??%% → ?); #EQ destruct @(vm_call … EQfetch) //
281| * #EQfetch inversion(asm_is_io ???) normalize nodelta #EQio
282  [ whd in ⊢ (??%% → ?); #EQ destruct] #H cases(bind_inversion ????? H) -H
283  * #newpc #tl * whd in match option_pop; normalize nodelta inversion(asm_stack ???)
284  normalize nodelta [#_ whd in ⊢ (??%% → ?); #EQ destruct] #newpc1 #tl1 #_
285  #EQstack whd in ⊢ (??%% → ?); #EQ destruct #H cases(bind_inversion ????? H) #lbl
286  * #EQlbl whd in ⊢ (??%% → ?); #EQ destruct @vm_ret //
287]
288qed.
289
290 
291lemma vm_step_to_eval : ∀p,p',prog,st1,st2,l.vmstep … prog l st1 st2 →
292eval_vmstate p p' prog st1 = return 〈l,st2〉.
293#p #p' #prog * #pc1 #stack1 #store1 #io1 #cost1
294* #pc2 #stack2 #store2 #io2 #cost2 #l #H inversion H
295[ #s1 #s2 #i #opt_l #EQfetch #EQio #EQstore #EQstack #EQio1 #EQpc #EQcost
296  #EQ1 #EQ2 #EQ3 #EQ4 destruct whd in match eval_vmstate; normalize nodelta   
297  >EQfetch >m_return_bind normalize nodelta >EQio normalize nodelta >EQstore
298  >m_return_bind <EQio1 >EQio <EQpc >EQstack >EQcost %
299| #s1 #s2 #newpc #EQfetch #EQio1 #EQstore #EQstack #EQio2 #EQnewpc #EQcost
300  #EQ1 #EQ2 #EQ3 #EQ4 destruct whd in match eval_vmstate; normalize nodelta
301  >EQfetch >m_return_bind normalize nodelta >EQio1 normalize nodelta <EQio2 >EQio1
302  >EQstore >EQstack <EQcost >EQstore %
303|3,4: #s1 #s2 #cond #newoc #ltrue #lfalse #EQev_cond #EQfetch #EQio1 #EQstore
304  #EQstack #EQio2 #EQnewoc #EQcost #EQ1 #EQ2 #EQ3 #EQ4 destruct
305  whd in match eval_vmstate; normalize nodelta >EQfetch >m_return_bind
306  normalize nodelta >EQio1 normalize nodelta >EQev_cond >m_return_bind
307  normalize nodelta <EQio1 >EQio2 >EQstore >EQstack <EQcost >EQstore [%] >EQnewoc %
308|5,6: #s1 #s2 #lin #io #lout #EQfetch #EQio1 #EQstore #EQstack #EQio2 #EQpc
309   #EQcost #EQ1 #EQ2 #EQ3 #EQ4 destruct whd in match eval_vmstate;
310   normalize nodelta >EQfetch >m_return_bind normalize nodelta >EQio1
311   normalize nodelta >EQstack <EQpc >EQcost [ >EQstore <EQio2 %]
312   >EQstore >m_return_bind <EQpc <EQio2 %
313| #s1 #s2 #f #lbl #EQfetch #EQio1 #EQstore #EQstack #EQio2 #EQentry
314  #EQcost #EQlab_pc #EQ1 #EQ2 #EQ3 #EQ4 destruct whd in match eval_vmstate;
315  normalize nodelta >EQfetch >m_return_bind normalize nodelta >EQio1
316  normalize nodelta >EQlab_pc >m_return_bind >EQentry >EQcost <EQio2 >EQio1
317  <EQstack >EQstore %
318| #s1 #s2 #newpc #lbl #EQfetch #EQio1 #EQstore #EQstack #EQio2 #EQnewpc
319  #EQlab_pc #EQcosts #EQ1 #EQ2 #EQ3 #EQ4 destruct whd in match eval_vmstate;
320  normalize nodelta >EQfetch >m_return_bind normalize nodelta >EQio1 normalize nodelta
321  >EQstack whd in match option_pop; normalize nodelta >m_return_bind
322  >EQlab_pc >m_return_bind >EQcosts >EQstore  <EQio2 >EQio1 %
323]
324qed.
325
326coercion vm_step_to_eval.
327
328include "../src/utilities/hide.ma".
329
330discriminator option.
331
332inductive vm_ass_state  (p : assembler_params) (p' : sem_params p) : Type[0] ≝
333| INITIAL : vm_ass_state p p'
334| FINAL : vm_ass_state p p'
335| STATE : vm_state p p' → vm_ass_state p p'.
336
337definition asm_operational_semantics : ∀p.sem_params p → AssemblerProgram p →  abstract_status ≝
338λp,p',prog.let init_act ≝ cost_act (Some ? (in_act … prog)) in
339           let end_act ≝ cost_act (Some ? (in_act … prog)) in
340    mk_abstract_status
341                (vm_ass_state p p')
342                (λl.λs1,s2 : vm_ass_state p p'.
343                    match s1 with
344                    [ STATE st1 ⇒
345                        match s2 with
346                        [ STATE st2 ⇒ 
347                            (eqb (pc ?? st1) (endmain … prog)) = false ∧ vmstep p p' prog l st1 st2
348                        | INITIAL ⇒ False
349                        | FINAL ⇒ eqb (pc … st1) (endmain … prog) = true ∧ l = end_act
350                        ]
351                    | INITIAL ⇒ match s2 with
352                                [ STATE st2 ⇒ eqb (pc … st2) O = true ∧ l = init_act
353                                | _ ⇒ False
354                                ]
355                    | FINAL ⇒ False
356                    ])
357                (λ_.λ_.True)
358                (λst.match st with
359                    [ INITIAL ⇒ cl_other | FINAL ⇒ cl_other |
360                     STATE s ⇒
361                      match fetch … prog (pc … s) with
362                      [ Some i ⇒ match i with
363                               [ Seq _ _ ⇒ cl_other
364                               | Ijmp _ ⇒ cl_other
365                               | CJump _ _ _ _ ⇒ cl_jump
366                               | Iio _ _ _ ⇒ if asm_is_io … s then cl_io else cl_other
367                               | Icall _ ⇒ cl_other
368                               | Iret ⇒ cl_other
369                               ]
370                     | None ⇒ cl_other
371                     ]
372                    ]
373                )
374                (λ_.true)
375                (λs.match s with [ INITIAL ⇒ true | _ ⇒ false])
376                (λs.match s with [ FINAL ⇒ true | _ ⇒ false])
377                ???.
378@hide_prf
379[ #s1 #s2 #l
380 cases s1 normalize nodelta [1,2: #abs destruct] -s1 #s1
381 cases s2 normalize nodelta [1: #_ * |2: #_ * #_ #EQ >EQ normalize /2/ ] #s2 
382 inversion(fetch ???) normalize nodelta
383  [ #_ #EQ destruct] * normalize nodelta
384  [ #seq #lbl #_
385  | #n #_
386  | #cond #newpc #ltrue #lfalse #EQfetch
387  | #lin #io #lout #_ cases (asm_is_io ??) normalize nodelta
388  | #f #_
389  | #_
390  ]
391  #EQ destruct * #_ #H lapply(vm_step_to_eval … H) whd in match eval_vmstate;
392  normalize nodelta >EQfetch >m_return_bind normalize nodelta cases(asm_is_io ??)
393  normalize nodelta [ whd in ⊢ (??%% → ?); #EQ destruct] #H cases(bind_inversion ????? H) -H
394  * * #_ normalize nodelta whd in ⊢ (??%% → ?); #EQ destruct % //
395| #s1 #s2 #l
396  cases s1 normalize nodelta [2: #_ * |3: #s1 ]
397  cases s2 normalize nodelta [1,2,4,5: #abs destruct ] #s2 [2: #_ * #_ /2/ ]
398  inversion(fetch ???) normalize nodelta
399  [ #_ #EQ destruct] * normalize nodelta
400  [ #seq #lbl #_
401  | #n #_
402  | #cond #newpc #ltrue #lfalse #_
403  | #lin #io #lout #EQfetch inversion (asm_is_io ??) #EQio normalize nodelta
404  | #f #_
405  | #_
406  ]
407  #EQ destruct * #_ #H lapply(vm_step_to_eval … H) whd in match eval_vmstate;
408  normalize nodelta #H cases(bind_inversion ????? H) -H *
409  [ #seq1 #lbl1
410  | #n1
411  | #cond1 #newpc1 #ltrue1 #lfalse1
412  | #lin1 #io1 #lout1
413  | #f
414  |
415  ]
416  normalize nodelta * #_ cases(asm_is_io ??) normalize nodelta
417  [1,3,5,9,11: whd in ⊢ (??%% → ?); #EQ destruct
418  |2,6,7,10,12: #H cases(bind_inversion ????? H) -H #x * #_
419    [2: cases x normalize nodelta
420    |5: #H cases(bind_inversion ????? H) -H #y * #_
421    ]
422  ]
423  whd in ⊢ (??%% → ?); #EQ destruct destruct % //
424| #s1 #s2 #l
425  cases s1 normalize nodelta [1,2: #abs destruct ] #s1
426  cases s2 normalize nodelta [ #_ * | #_ * /2/ ] #s2
427  inversion(fetch ???) normalize nodelta
428  [ #_ #EQ destruct] * normalize nodelta
429  [ #seq #lbl #_
430  | #n #_
431  | #cond #newpc #ltrue #lfalse #_
432  | #lin #io #lout #EQfetch inversion(asm_is_io ??) normalize nodelta #EQio
433  | #f #_
434  | #_
435  ]
436  #EQ destruct * #_ #H lapply(vm_step_to_eval … H) whd in match eval_vmstate;
437  normalize nodelta  >EQfetch >m_return_bind normalize nodelta >EQio
438  normalize nodelta #H cases(bind_inversion ????? H) -H #x * #_
439  whd in ⊢ (??%% → ?); #EQ destruct % //
440qed.
441
442definition asm_concrete_trans_sys ≝
443λp,p',prog.mk_concrete_transition_sys …
444             (asm_operational_semantics p p' prog) (m … p')
445             (λs.match s with [STATE st ⇒ cost … st | _ ⇒ e …] ).
446
447definition emits_labels ≝
448λp.λinstr : AssemblerInstr p.match instr with
449        [ Seq _ opt_l ⇒ match opt_l with
450                        [ None ⇒ Some ? (λpc.S pc)
451                        | Some _ ⇒ None ?
452                        ]
453        | Ijmp newpc ⇒ Some ? (λ_.newpc)
454        | _ ⇒ None ?
455        ].
456
457definition fetch_state : ∀p,p'.AssemblerProgram p → vm_state p p' → option (AssemblerInstr p) ≝
458λp,p',prog,st.fetch … prog (pc … st).
459
460definition asm_static_analisys_data ≝ λp,p',prog,abs_t,instr_m.
461mk_static_analysis_data (asm_concrete_trans_sys p p' prog) abs_t
462 … (λs.match s with [ STATE st ⇒ fetch_state p p' prog st | _ ⇒ None ? ]) instr_m.
463
464definition non_empty_list : ∀A.list A → bool ≝
465λA,l.match l with [ nil ⇒ false | _ ⇒  true ].
466
467let rec block_cost (p : assembler_params)
468 (prog: AssemblerProgram p) (abs_t : monoid)
469 (instr_m : AssemblerInstr p → abs_t)
470 (prog_c: option ℕ)
471    (program_size: ℕ)
472        on program_size: option abs_t ≝
473match prog_c with
474[ None ⇒ return e … abs_t
475| Some program_counter ⇒
476  match program_size with
477    [ O ⇒ None ?
478    | S program_size' ⇒
479       if eqb program_counter (endmain … prog) then
480        return e … abs_t
481      else
482      ! instr ← fetch … prog program_counter;
483      ! n ← (match emits_labels … instr with
484            [ Some f ⇒ block_cost … prog abs_t instr_m (Some ? (f program_counter)) program_size'
485            | None ⇒ return e …
486            ]);
487      return (op … abs_t (instr_m … instr) n)
488    ]
489].
490
491
492record cost_map_T (dom : DeqSet) (codom : Type[0]) : Type[1] ≝
493{ map_type :> Type[0]
494; empty_map : map_type
495; get_map : map_type → dom → option codom
496; set_map : map_type → dom → codom → map_type
497; get_set_hit : ∀k,v,m.get_map (set_map m k v) k = return v
498; get_set_miss : ∀k1,k2,v,m.(k1 == k2) = false → get_map (set_map m k1 v) k2 = get_map m k2
499}.
500
501
502
503lemma labels_pc_ok : ∀p,prog,l1,l2,i_act,i,lbl,pc,m.
504nth_opt ? pc prog = return i →
505mem ? lbl (labels_pc_of_instr … i (m+pc)) →
506mem ? lbl (labels_pc p prog l1 l2 i_act m).
507#p #instrs #l1 #l2 #iact #i #lbl #pc
508whd in match fetch; normalize nodelta lapply pc -pc
509elim instrs
510[ #pc #m whd in ⊢ (??%% → ?); #EQ destruct]
511#x #xs #IH * [|#pc'] #m  whd in ⊢ (??%% → ?);
512[ #EQ destruct #lbl_addr whd in match (labels_pc ???);
513  /2 by mem_append_l1/
514| #EQ #H2 whd in match (labels_pc ???); @mem_append_l2 @(IH … EQ) //
515]
516qed.
517
518lemma labels_pf_in_act: ∀p,prog,pc.
519  mem CostLabel (in_act p prog)
520  (map (CostLabel×ℕ) CostLabel \fst
521   (labels_pc p (instructions p prog) (call_label_fun p prog)
522    (return_label_fun p prog) (in_act p prog) pc)).
523 #p #prog elim (instructions p prog) normalize /2/
524qed.
525
526lemma labels_pc_return: ∀p,prog,l1,l2,iact,x1,x2.
527 label_of_pc ReturnPostCostLabel l2 x1=return x2 →
528 ∀m.
529   mem … 〈(a_return_post x2),x1〉 (labels_pc p prog l1 l2 iact m).
530 #p #l #l1 #l2 #iact whd in match (labels_pc ???); #x1 #x2 #H elim l
531[ #m @mem_append_l2 @mem_append_l2 whd in H:(??%?);
532  elim l2 in H; [ whd in ⊢ (??%% → ?); #EQ destruct]
533  * #x #y #tl #IH whd in ⊢ (??%? → %); normalize nodelta @eqb_elim
534  normalize nodelta
535  [ #EQ whd in ⊢ (??%% → ?); #EQ2 destruct /2/
536  | #NEQ #H2 %2 @IH // ]
537| #hd #tl #IH #m @mem_append_l2 @IH ]
538qed.
539
540lemma labels_pc_call: ∀p,prog,l1,l2,iact,x1,x2.
541 label_of_pc CallCostLabel l1 x1=return x2 →
542 ∀m.
543   mem … 〈(a_call x2),x1〉 (labels_pc p prog l1 l2 iact m).
544 #p #l #l1 #l2 #iact whd in match (labels_pc ???); #x1 #x2 #H elim l
545[ #m @mem_append_l2 @mem_append_l1 whd in H:(??%?);
546  elim l1 in H; [ whd in ⊢ (??%% → ?); #EQ destruct]
547  * #x #y #tl #IH whd in ⊢ (??%? → %); normalize nodelta @eqb_elim
548  normalize nodelta
549  [ #EQ whd in ⊢ (??%% → ?); #EQ2 destruct /2/
550  | #NEQ #H2 %2 @IH // ]
551| #hd #tl #IH #m @mem_append_l2 @IH ]
552qed.
553
554(*
555lemma labels_pc_bounded : ∀p.∀prog : AssemblerProgram p.∀lbl,pc.∀m.
556mem ? 〈lbl,pc〉 (labels_pc p (instructions … prog) m) →
557(m + pc) < (|(instructions … prog)|).
558#p * #instr #endmain #_  #H1 #H2 elim instr
559[ #H3 @⊥ /2/ ] #x #xs #IH #_ #lbl #pc #m whd in match (labels_pc ???);
560#H cases(mem_append ???? H) -H
561[ whd in match labels_pc_of_instr; normalize nodelta
562  cases x normalize nodelta
563  [ #seq * [|#lab]
564  | #newpc
565  | #cond #newpc #ltrue #lfalse
566  | #lin #io #lout
567  | #f
568  |
569  ]
570  normalize [1,3,6,7: *] * [2,4,6: * [2,4:*] ]
571  #EQ destruct
572*) 
573
574let rec m_foldr (M : Monad) (X,Y : Type[0]) (f : X→Y→M Y) (l : list X) (y : Y) on l : M Y ≝
575match l with
576[ nil ⇒ return y
577| cons x xs ⇒ ! z ← m_foldr M X Y f xs y; f x z
578].
579
580definition static_analisys : ∀p : assembler_params.∀abs_t : monoid.(AssemblerInstr p → abs_t) →
581∀mT : cost_map_T DEQCostLabel abs_t.AssemblerProgram p → option mT ≝
582λp,abs_t,instr_m,mT,prog.
583let prog_size ≝ S (|instructions … prog|) in
584m_foldr Option ?? (λx,m.let 〈z,w〉≝ x in ! k ← block_cost p prog abs_t instr_m (Some ? w) prog_size; 
585                               return set_map … m z k) (labels_pc … (instructions … prog)
586                                         (call_label_fun … prog) (return_label_fun … prog) (in_act … prog) O)
587      (empty_map ?? mT).
588     
589
590(*falso: necessita di no_duplicates*)
591
592definition eq_deq_prod : ∀D1,D2 : DeqSet.D1 × D2 → D1 × D2 → bool ≝
593λD1,D2,x,y.\fst x == \fst y ∧ \snd x == \snd y.
594
595definition DeqProd ≝ λD1 : DeqSet.λD2 : DeqSet.
596mk_DeqSet (D1 × D2) (eq_deq_prod D1 D2) ?.
597@hide_prf
598* #x1 #x2 * #y1 #y2 whd in match eq_deq_prod; normalize nodelta
599% [2: #EQ destruct @andb_Prop >(\b (refl …)) %]
600inversion (? ==?) #EQ1 whd in match (andb ??); #EQ2 destruct
601>(\P EQ1) >(\P EQ2) %
602qed.
603(*
604unification hint  0 ≔ D1,D2 ;
605    X ≟ DeqProd D1 D2
606(* ---------------------------------------- *) ⊢
607    D1 × D2 ≡ carr X.
608
609
610unification hint  0 ≔ D1,D2,p1,p2;
611    X ≟ DeqProd D1 D2
612(* ---------------------------------------- *) ⊢
613    eq_deq_prod D1 D2 p1 p2 ≡ eqb X p1 p2.
614   
615definition deq_prod_to_prod : ∀D1,D2 : DeqSet.DeqProd D1 D2 → D1 × D2 ≝
616λD1,D2,x.x.
617
618coercion deq_prod_to_prod.
619*)
620
621lemma map_mem : ∀A,B,f,l,a.mem A a l → ∃b : B.mem B b (map A B f l)
622∧ b = f a.
623#A #B #f #l elim l [ #a *] #x #xs #IH #a *
624[ #EQ destruct %{(f x)} % // % // | #H cases(IH … H)
625  #b * #H1 #EQ destruct %{(f a)} % // %2 //
626]
627qed.
628
629lemma static_analisys_ok : ∀p,abs_t,instr_m,mT,prog,lbl,pc,map.
630static_analisys p abs_t instr_m mT prog = return map →
631mem … 〈lbl,pc〉 (labels_pc … (instructions … prog) (call_label_fun … prog)
632                   (return_label_fun … prog) (in_act … prog) O) →
633get_map … map lbl =
634block_cost … prog abs_t instr_m (Some ? pc) (S (|(instructions … prog)|)) ∧
635block_cost … prog abs_t instr_m (Some ? pc) (S (|(instructions … prog)|)) ≠ None ?.
636#p #abs_t #instr_m #mT * #prog whd in match static_analisys; normalize nodelta
637#endmain #Hendmain #entry_fun #call_label_fun #return_label_fun #inact
638#nodup generalize in match nodup in ⊢ (∀_.∀_.∀_. (??(????%??)?) → %); #Hnodup lapply nodup -nodup
639lapply (labels_pc ??????) #l elim l [ #x #y #z #w #h * ]
640* #hd1 #hd2 #tl #IH * #H1 #H2 #lbl #pc #map #H
641cases(bind_inversion ????? H) -H #map1 * #EQmap1 normalize nodelta #H
642cases(bind_inversion ????? H) -H #elem * #EQelem whd in ⊢ (??%% → ?); #EQ
643destruct *
644[ #EQ destruct % [ >get_set_hit >EQelem % | >EQelem % whd in ⊢ (??%% → ?); #EQ destruct]
645| #H %
646  [ >get_set_miss [ @(proj1 … (IH …)) //] inversion (? == ?) [2: #_ %]
647    #ABS cases H1 -H1 #H1 @⊥ @H1 >(\P ABS) >mem_to_memb //
648    cases(map_mem … \fst … H) #z1 * #Hz1 #EQ destruct @Hz1
649  | @(proj2 … (IH …)) //
650  ]
651]
652qed.
653
654include "Simulation.ma".
655
656definition terminated_trace : ∀S : abstract_status.∀s1,s3 : S.raw_trace … s1 s3 → Prop ≝
657λS,s1,s3,t.bool_to_Prop (as_final … s3) ∨
658       ∃s2: S.∃t1 : raw_trace … s1 s2.∃ l,prf.t = t1 @ (t_ind ? s2 s3 s3 l prf … (t_base … s3))
659∧ ((is_costlabelled_act l ∨ is_labelled_ret_act l) ∧
660   (is_call_act l → bool_to_Prop (is_call_post_label … s2))).
661
662definition big_op: ∀M: monoid. list M → M ≝
663 λM. foldl … (op … M) (e … M).
664
665lemma big_op_associative:
666 ∀M:monoid. ∀l1,l2.
667  big_op M (l1@l2) = op M (big_op … l1) (big_op … l2).
668 #M #l1 whd in match big_op; normalize nodelta
669 generalize in match (e M) in ⊢ (? → (??%(??%?))); elim l1
670 [ #c #l2 whd in match (append ???); normalize lapply(neutral_r … c)
671   generalize in match c in ⊢ (??%? → ???%); lapply c -c lapply(e M)
672   elim l2 normalize
673   [ #c #c1 #c2 #EQ @sym_eq //
674   | #x #xs #IH #c1 #c2 #c3 #EQ <EQ <IH [% | <is_associative % |]
675   ]
676 | #x #xs #IH #c #l2 @IH
677 ]
678qed.
679
680lemma act_big_op : ∀M,B. ∀act : monoid_action M B.
681 ∀l1,l2,x.
682   act (big_op M (l1@l2)) x = act (big_op … l2) (act (big_op … l1) x).
683 #M #B #act #l1 elim l1
684 [ #l2 #x >act_neutral //
685 | #hd #tl #IH #l2 #x change with ([?]@(tl@l2)) in match ([?]@(tl@l2));
686   >big_op_associative >act_op >IH change with ([hd]@tl) in match ([hd]@tl);
687   >big_op_associative >act_op in ⊢ (???%); %
688 ]
689qed.
690
691lemma monotonicity_of_block_cost : ∀p,prog,abs_t,instr_m,pc,size,k.
692block_cost p prog abs_t instr_m (Some ? pc) size = return k →
693∀size'.size ≤ size' →
694block_cost p prog abs_t instr_m (Some ? pc) size' = return k.
695#p #prog #abs_t #instr_m #pc #size lapply pc elim size
696[ #pc #k whd in ⊢ (??%% → ?); #EQ destruct]
697#n #IH #pc #k whd in ⊢ (??%% → ?); @eqb_elim
698[ #EQ destruct normalize nodelta whd in ⊢ (??%% → ?); #EQ destruct
699  #size' * [2: #m #_] whd in ⊢ (??%%); @eqb_elim try( #_ %) * #H @⊥ @H %
700| #Hpc normalize nodelta #H cases(bind_inversion ????? H) -H #i
701  * #EQi #H cases(bind_inversion ????? H) -H #elem * #EQelem whd in ⊢ (??%% → ?);
702  #EQ destruct #size' *
703  [ whd in ⊢ (??%?); @eqb_elim
704    [ #EQ @⊥ @(absurd ?? Hpc) assumption ]
705    #_ normalize nodelta >EQi >m_return_bind >EQelem %
706  | #m #Hm whd in ⊢ (??%?); @eqb_elim
707    [ #EQ @⊥ @(absurd ?? Hpc) assumption ]
708    #_ normalize nodelta >EQi >m_return_bind
709    cases (emits_labels ??) in EQelem; normalize nodelta
710    [ whd in ⊢ (??%%→ ??%%); #EQ destruct %]
711    #f #EQelem >(IH … EQelem) [2: /2/ ] %
712  ]
713]
714qed.
715
716lemma step_emit : ∀p,p',prog,st1,st2,l,i.
717fetch p prog (pc … st1) = return i →
718eval_vmstate p p' … prog st1 = return 〈l,st2〉 → 
719emits_labels … i = None ? → ∃x.
720match l in ActionLabel return λ_:ActionLabel.(list CostLabel) with 
721[call_act f c ⇒ [a_call c]
722|ret_act x ⇒
723   match x with [None⇒[]|Some c⇒[a_return_post c]]
724|cost_act x ⇒
725   match x with [None⇒[]|Some c⇒[a_non_functional_label c]]
726] = [x] ∧
727 (mem … 〈x,pc … st2〉 (labels_pc p (instructions … prog) (call_label_fun … prog) (return_label_fun … prog) (in_act … prog) O)).
728#p #p' #prog #st1 #st2 #l #i #EQi whd in match eval_vmstate; normalize nodelta
729>EQi >m_return_bind normalize nodelta cases i in EQi; -i normalize nodelta
730[ #seq * [|#lab]
731| #newpc
732| #cond #newpc #ltrue #lfalse
733| #lin #io #lout
734| #f
735|
736]
737#EQi cases(asm_is_io ???) normalize nodelta
738[1,3,5,7,11,13: whd in ⊢ (??%% → ?); #EQ destruct
739|2,4,8,9,12,14: #H cases(bind_inversion ????? H) -H #x1 * #EQx1
740  [3: cases x1 in EQx1; -x1 #EQx1 normalize nodelta
741  |6: #H cases(bind_inversion ????? H) -H #x2 * #EQx2
742  ]
743]
744whd in ⊢ (??%% → ?); #EQ destruct whd in match emits_labels;
745normalize nodelta #EQ destruct % [2,4,6,8,10,12,14: % try % |*:]
746[1,2,4,5,7: @(labels_pc_ok … EQi) normalize /3 by or_introl,or_intror/ ]
747/2 by labels_pc_return, labels_pc_call/
748qed.
749
750lemma step_non_emit : ∀p,p',prog,st1,st2,l,i,f.
751fetch p prog (pc … st1) = return i →
752eval_vmstate p p' … prog st1 = return 〈l,st2〉 → 
753emits_labels … i = Some ? f →
754match l in ActionLabel return λ_:ActionLabel.(list CostLabel) with 
755[call_act f c ⇒ [a_call c]
756|ret_act x ⇒
757   match x with [None⇒[]|Some c⇒[a_return_post c]]
758|cost_act x ⇒
759   match x with [None⇒[]|Some c⇒[a_non_functional_label c]]
760] = [ ] ∧ pc … st2 = f (pc … st1).
761#p #p' #prog #st1 #st2 #l #i #f #EQi whd in match eval_vmstate; normalize nodelta
762>EQi >m_return_bind normalize nodelta cases i in EQi; -i normalize nodelta
763[ #seq * [|#lab]
764| #newpc
765| #cond #newpc #ltrue #lfalse
766| #lin #io #lout
767| #f
768|
769]
770#EQi cases(asm_is_io ???) normalize nodelta
771[1,3,5,7,11,13: whd in ⊢ (??%% → ?); #EQ destruct
772|2,4,8,9,12,14: #H cases(bind_inversion ????? H) -H #x1 * #EQx1
773  [3: cases x1 in EQx1; -x1 #EQx1 normalize nodelta
774  |6: #H cases(bind_inversion ????? H) -H #x2 * #EQx2
775  ]
776]
777whd in ⊢ (??%% → ?); #EQ destruct whd in match emits_labels;
778normalize nodelta #EQ destruct /2 by refl, conj/
779qed.
780
781lemma labels_of_trace_are_in_code :
782∀p,p',prog.∀st1,st2 : vm_ass_state p p'.∀t : raw_trace (asm_operational_semantics p p' prog) … st1 st2.
783∀lbl.
784mem … lbl (get_costlabels_of_trace … t) →
785mem … lbl (map … \fst … (labels_pc … (instructions p prog) (call_label_fun … prog) (return_label_fun … prog) (in_act … prog) O)).
786#p #p' #prog #st1 #st2 #t elim t
787[ #st #lbl *
788| #st1 #st2 #st3 #l whd in ⊢ (% → ?);
789  cases st1 -st1 normalize nodelta [2: * |3: #st1]
790  cases st2 -st2 normalize nodelta [1,4,5: * |2: * #HN1 #HN2 >HN2 -HN2 |6: #st2 * #HN1 #HN2 >HN2 -HN2 |3: #st2 ]
791  [3: * #H1 #H2 #tl #IH #lbl whd in match (get_costlabels_of_trace ????);
792      #H cases(mem_append ???? H) -H [2: #H @IH //]
793      lapply(vm_step_to_eval … H2) whd in match eval_vmstate;
794      normalize nodelta #H cases(bind_inversion ????? H) -H #i * #EQi #_
795      inversion(emits_labels … i)
796      [ #EQemit cases(step_emit … (vm_step_to_eval … H2)) // #x * #EQ1 #EQ2 >EQ1 *
797        [2: *] #EQ destruct cases(map_mem … \fst … EQ2) #y * #H3 #EQ destruct //
798      | #f #EQemit >(proj1 … (step_non_emit … EQi (vm_step_to_eval … H2) … EQemit))
799        *
800      ]
801  |*: #tl #IH #lbl whd in match (get_costlabels_of_trace ????); * // @IH
802]
803qed.
804
805let rec dependent_map (A,B : Type[0]) (l : list A) (f : ∀a : A.mem … a l → B) on l : list B ≝
806(match l return λx.l=x → ? with
807[ nil ⇒ λ_.nil ?
808| cons x xs ⇒ λprf.(f x ?) :: dependent_map A B xs (λx,prf1.f x ?)
809])(refl …).
810[ >prf %% | >prf %2 assumption]
811qed.
812
813lemma dependent_map_append : ∀A,B,l1,l2,f.
814dependent_map A B (l1 @ l2) (λa,prf.f a prf) =
815(dependent_map A B l1 (λa,prf.f a ?)) @ (dependent_map A B l2 (λa,prf.f a ?)).
816[2: @hide_prf /2/ | 3: @hide_prf /2/]
817#A #B #l1 elim l1 normalize /2/
818qed.
819
820lemma rewrite_in_dependent_map : ∀A,B,l1,l2,f.
821        ∀EQ:l1 = l2.
822         dependent_map A B l1 (λa,prf.f a prf) =
823         dependent_map A B l2 (λa,prf.f a ?).
824[2: >EQ // | #A #B #l1 #l2 #f #EQ >EQ in f; #f % ]
825qed.
826
827definition get_pc : ∀p,p'.vm_ass_state p p' → ℕ → option ℕ ≝
828λp,p',st,endmain.match st with
829[ STATE s ⇒ Some ? (pc … s)
830| INITIAL ⇒ None ?
831| FINAL ⇒ Some ? endmain
832].
833
834
835lemma static_dynamic : ∀p,p',prog.
836∀abs_t : abstract_transition_sys (m … p').∀instr_m.
837∀good : static_galois … (asm_static_analisys_data p p' prog abs_t instr_m).∀mT,map1.
838∀EQmap : static_analisys p ? instr_m mT prog = return map1.
839∀st1,st2 : vm_ass_state p p'.
840∀t : raw_trace (asm_operational_semantics p p' prog) … st1 st2.
841terminated_trace … t →
842∀k.
843pre_measurable_trace … t →
844block_cost p prog … instr_m (get_pc … st1 (endmain … prog)) (S (|(instructions … prog)|)) = return k →
845∀a1.rel_galois … good st1 a1 →
846∀labels.
847labels = dependent_map CostLabel ? (get_costlabels_of_trace …  t) (λlbl,prf.(opt_safe … (get_map … map1 lbl) ?)) →
848rel_galois … good st2 (act_abs … abs_t (big_op … labels) (act_abs … abs_t k a1)).
849[2: @hide_prf
850    cases(mem_map ????? (labels_of_trace_are_in_code … prf)) *
851    #lbl' #pc * #Hmem #EQ destruct   
852    >(proj1 … (static_analisys_ok … EQmap … Hmem))
853    @(proj2 … (static_analisys_ok … EQmap … Hmem))
854]
855#p #p' #prog #abs_t #instr_m #good #mT #map1 #EQmap #st1 #st2 #t elim t
856[ #st * [| * #st3 * #t1 * #l * #prf * #ABS @⊥ cases t1 in ABS; ]
857  #EQr_post #k #_ lapply(R_fin_ok … ter) >EQr_post normalize nodelta
858  [ whd in ⊢ (?% → ?); #final_st whd in ⊢ (??%? → ?); >final_st
859    normalize nodelta whd in ⊢ (??%% → ?); #EQ destruct(EQ)
860    #a1 #rel_st_a1 whd in match (map ????); #costs #EQ >EQ >act_neutral >act_neutral assumption
861  | ** #H1 #H2 * #H3 #H4 whd in ⊢ (??%% → ?); >H3 normalize nodelta
862    #H cases(bind_inversion ????? H) -H *
863    [ #seq * [|#lbl1]
864    | #newpc
865    | #cond #newpc #ltrue #lfalse
866    | #lin #io #lout
867    | #f
868    |
869    ]
870    * #EQfetch lapply(vm_step_to_eval … H4) whd in match eval_vmstate;
871    normalize nodelta >EQfetch >m_return_bind normalize nodelta
872    cases(asm_is_io ??) normalize nodelta
873    [1,3,5,7,11,13: whd in ⊢ (??%% → ?); #EQ destruct
874    |2,4,8,9,12,14: #H cases(bind_inversion ????? H) -H #x * #_
875      [3: cases x normalize nodelta
876      |6: #H cases(bind_inversion ????? H) -H #y * #_
877      ]
878    ]
879    whd in ⊢ (??%% → ?); #EQ destruct
880    [4,8: cases H1 [1,3: * |*: * #y #EQ destruct]]
881    >m_return_bind whd in ⊢ (??%% → ?); #EQ destruct
882    #a1 #good_st_a1 whd in match (dependent_map ????); #costs #EQ >EQ >neutral_r
883    >act_neutral
884    @(instr_map_ok … good … EQfetch … good_st_a1) /2/
885  ]
886| -st1 -st2 #st1 #st2 #st3 #l * #H3 #H4 #tl #IH #ter #k #H
887  #H2 #a1 #good_a1 whd in match (get_costlabels_of_trace ????);
888  whd #costs >dependent_map_append
889  (*change with (list_cost_to_list_initcost ?) in match (list_cost_to_list_initcost ?);*) 
890  #EQ destruct whd in H2 : (??%?); lapply H2 >H3 in ⊢ (% → ?); -H2
891  normalize nodelta #H cases(bind_inversion ????? H) -H #i * #EQi
892  inversion(emits_labels ??)
893  [ #EQemits whd in ⊢ (??%% → ?); #EQ destruct  >big_op_associative >act_op @IH
894  | #f #EQemits normalize nodelta #H
895    cases(bind_inversion ????? H) -H #k' * #EQk' whd in ⊢ (??%% → ?);
896    #EQ destruct(EQ) >act_op whd in match (append ???); @IH
897  ]
898  [1,5: inversion H in ⊢ ?;
899    [1,6: #st #c #EQ1 #EQ2 #EQ3 #EQ4 destruct
900    |2,7: #s1 #s2 #s3 #lbl #exe #tl1 #s1_noio * #opt_l #EQ destruct #pre_tl1 #_
901      #EQ1 #EQ2 #EQ3 #EQ4 destruct
902    |3,8: #s1 #s2 #s3 #lbl #s1_noio #exe #tl1 * #lbl1 #EQ destruct #pre_tl1 #_
903      #EQ1 #EQ2 #EQ3 #EQ4 destruct
904    |4,9: #s1 #s2 #s3 #lbl #exe #tl1 #s1_noio * #f * #lbl1 #EQ destruct
905      * #pre_tl1 #_ #EQ1 #EQ2 #EQ3 #EQ4 destruct
906    |5,10: #s1 #s2 #s3 #s4 #s5 #l1 #l2 #exe1 #t1 #t2 #exe2 #noio1 #noio2 #H *
907    ] //
908  | cases(step_emit … EQi (vm_step_to_eval … H4) … EQemits) #x * #EQx #Hx
909    >(rewrite_in_dependent_map … EQx)
910 
911    whd in match (dependent_map ????); whd in match (dependent_map ????); whd in match (big_op ??);
912    >neutral_l @opt_safe_elim #elem #EQget
913    cases (static_analisys_ok  … x … (pc … st2) … no_dup … EQmap) //
914    #EQ #_ <EQ assumption
915  | >neutral_r  @(instr_map_ok … good … EQi … good_a1) /2/
916  | %
917  | >(proj2 … (step_non_emit … EQi (vm_step_to_eval … H4) … EQemits))
918    >(monotonicity_of_block_cost … EQk') //
919  | @(instr_map_ok … good … EQi … good_a1) /2/
920  | lapply (proj1 … (step_non_emit … EQi (vm_step_to_eval … H4) … EQemits))
921    #EQ >(rewrite_in_dependent_map … EQ) %
922  ]
923]
924qed.
925
926definition actionlabel_to_costlabel : ActionLabel → list CostLabel ≝
927λa.match a with
928[ call_act f l ⇒ [a_call l]
929| ret_act opt_l ⇒ match opt_l with [None ⇒ [ ] | Some l ⇒ [a_return_post l]]
930| cost_act opt_l ⇒ match opt_l with [None ⇒ [ ] | Some l ⇒ [a_non_functional_label l]]
931].
932
933definition get_costlabels_of_measurable_trace : ∀S : abstract_status.measurable_trace S → list CostLabel ≝
934λS,t.
935 match L_label … t with
936 [ None ⇒ [i_act]
937 | Some l ⇒ actionlabel_to_costlabel l
938 ] @
939 get_costlabels_of_trace … (trace … t).
940
941lemma i_act_in_map :  ∀p,prog.
942mem … 〈i_act,O〉 (labels_pc … (instructions p prog) O).
943#p *#instr #n #_ generalize in match O in ⊢ (???%); elim instr
944[ normalize /2/] #i #xs #IH #m whd in match (labels_pc ???);
945@mem_append_l2 @IH
946qed.
947
948
949lemma as_execute_labelled_ok : ∀p,p',prog,c,l,st1,st2.
950eval_vmstate p p' prog st1 = return 〈l,st2〉 → actionlabel_to_costlabel l = [c] →
951∃n.
952mem … 〈c,n〉 (labels_pc … (instructions p prog) O).
953#p #p' * #instr #endmain #Hendmain #c #l #st1 #st2 #H2 lapply H2 whd in match eval_vmstate; normalize nodelta
954#H cases(bind_inversion ????? H) -H #i * #EQfetch #_
955 inversion(emits_labels … i)
956 [ #EQemit cases(step_emit … H2) // #x * #EQ1 #EQ2 whd in match actionlabel_to_costlabel;
957   normalize nodelta >EQ1 #EQ destruct /2 by ex_intro/
958  | #f #EQemit whd in match actionlabel_to_costlabel; normalize nodelta  >(proj1 … (step_non_emit … EQfetch H2 … EQemit))
959    #EQ destruct
960 ]
961qed.
962 
963
964(*get_costlabels_of_measurable_trace deve aggiungere la label iniziale.*)
965theorem static_dynamic_meas : ∀p,p',prog.∀no_dup : asm_no_duplicates p prog.
966∀abs_t : abstract_transition_sys (m … p').∀instr_m.
967∀good : static_galois … (asm_static_analisys_data p p' prog abs_t instr_m).∀mT,map1.
968∀EQmap : static_analisys p ? instr_m mT prog = return map1.
969∀t : measurable_trace (asm_operational_semantics p p' prog).
970let start_state ≝ match L_pre_state … t with [None ⇒ L_s1 … t | Some x ⇒ x ] in
971∀a1.rel_galois … good start_state a1 →
972∀abs_trace.
973abs_trace = dependent_map CostLabel ? (get_costlabels_of_measurable_trace …  t) (λlbl,prf.(opt_safe … (get_map … map1 lbl) ?)) →
974rel_galois … good (R_s2 … t) (act_abs … abs_t (big_op … abs_trace) a1).
975[2: @hide_prf
976    whd in match get_costlabels_of_measurable_trace in prf; normalize nodelta in prf;
977    cases(mem_append ???? prf) -prf
978    [2: #prf cases(mem_map ????? (labels_of_trace_are_in_code … prf)) *
979        #lbl' #pc * #Hmem #EQ destruct   
980        >(proj1 … (static_analisys_ok … no_dup … EQmap … Hmem))
981        @(proj2 … (static_analisys_ok … no_dup … EQmap … Hmem))
982    | inversion(L_label … t) normalize nodelta [| #lbl'] #EQleft
983      [ * [2: *] #EQ destruct >(proj1 … (static_analisys_ok … no_dup … EQmap … (i_act_in_map …)))
984        @(proj2 … (static_analisys_ok … no_dup … EQmap … (i_act_in_map …)))
985      | #H lapply(L_init_ok … t) inversion(L_pre_state … t) [ #_ normalize nodelta * #_ >EQleft #EQ destruct]
986        #st_pre #EQst_pre normalize nodelta * #l' ** >EQleft #EQ destruct cases l' in H;
987        [ #x1 #x2 | * [|#x1] | * [|#x1]] whd in ⊢ (% → %→ ?); * [2,4,6: *] #EQ destruct * * #_
988        #H cases(as_execute_labelled_ok … H) [3,6,9:% |*:] #w #EQw
989        >(proj1 … (static_analisys_ok … no_dup … EQmap … EQw))
990       @(proj2 … (static_analisys_ok … no_dup … EQmap … EQw))
991      ]
992    ]
993]
994#p #p' #prog #no_dup #abs_t #instr_m #good #mT #map1 #EQmap1 #t #a1 #rel_galois #abs_trace #EQabs_trace
995@(static_dynamic …)
996
997xxxxxx
998lapply(static_dynamic … (trace …t) … abs_trace) try //
999
1000
Note: See TracBrowser for help on using the repository browser.