source: src/ASM/AssemblyProof.ma @ 883

Last change on this file since 883 was 883, checked in by sacerdot, 9 years ago

Merged done well.

File size: 48.2 KB
Line 
1include "ASM/Assembly.ma".
2include "ASM/Interpret.ma".
3
4(* RUSSEL **)
5
6include "basics/jmeq.ma".
7
8notation > "hvbox(a break ≃ b)"
9  non associative with precedence 45
10for @{ 'jmeq ? $a ? $b }.
11
12notation < "hvbox(term 46 a break maction (≃) (≃\sub(t,u)) term 46 b)"
13  non associative with precedence 45
14for @{ 'jmeq $t $a $u $b }.
15
16interpretation "john major's equality" 'jmeq t x u y = (jmeq t x u y).
17
18lemma eq_to_jmeq:
19  ∀A: Type[0].
20  ∀x, y: A.
21    x = y → x ≃ y.
22  //
23qed.
24
25definition inject : ∀A.∀P:A → Prop.∀a.∀p:P a.Σx:A.P x ≝ λA,P,a,p. dp … a p.
26definition eject : ∀A.∀P: A → Prop.(Σx:A.P x) → A ≝ λA,P,c.match c with [ dp w p ⇒ w].
27
28coercion inject nocomposites: ∀A.∀P:A → Prop.∀a.∀p:P a.Σx:A.P x ≝ inject on a:? to Σx:?.?.
29coercion eject nocomposites: ∀A.∀P:A → Prop.∀c:Σx:A.P x.A ≝ eject on _c:Σx:?.? to ?.
30
31axiom VOID: Type[0].
32axiom assert_false: VOID.
33definition bigbang: ∀A:Type[0].False → VOID → A.
34 #A #abs cases abs
35qed.
36
37coercion bigbang nocomposites: ∀A:Type[0].False → ∀v:VOID.A ≝ bigbang on _v:VOID to ?.
38
39lemma sig2: ∀A.∀P:A → Prop. ∀p:Σx:A.P x. P (eject … p).
40 #A #P #p cases p #w #q @q
41qed.
42
43lemma jmeq_to_eq: ∀A:Type[0]. ∀x,y:A. x≃y → x=y.
44 #A #x #y #JMEQ @(jmeq_elim ? x … JMEQ) %
45qed.
46
47coercion jmeq_to_eq: ∀A:Type[0]. ∀x,y:A. ∀p:x≃y.x=y ≝ jmeq_to_eq on _p:?≃? to ?=?.
48
49(* END RUSSELL **)
50
51let rec foldl_strong_internal
52  (A: Type[0]) (P: list A → Type[0]) (l: list A)
53  (H: ∀prefix. ∀hd. ∀tl. l = prefix @ [hd] @ tl → P prefix → P (prefix @ [hd]))
54  (prefix: list A) (suffix: list A) (acc: P prefix) on suffix:
55    l = prefix @ suffix → P(prefix @ suffix) ≝
56  match suffix return λl'. l = prefix @ l' → P (prefix @ l') with
57  [ nil ⇒ λprf. ?
58  | cons hd tl ⇒ λprf. ?
59  ].
60  [ > (append_nil ?)
61    @ acc
62  | applyS (foldl_strong_internal A P l H (prefix @ [hd]) tl ? ?)
63    [ @ (H prefix hd tl prf acc)
64    | applyS prf
65    ]
66  ]
67qed.
68
69definition foldl_strong ≝
70  λA: Type[0].
71  λP: list A → Type[0].
72  λl: list A.
73  λH: ∀prefix. ∀hd. ∀tl. l = prefix @ [hd] @ tl → P prefix → P (prefix @ [hd]).
74  λacc: P [ ].
75    foldl_strong_internal A P l H [ ] l acc (refl …).
76
77definition bit_elim: ∀P: bool → bool. bool ≝
78  λP.
79    P true ∧ P false.
80
81let rec bitvector_elim_internal
82  (n: nat) (P: BitVector n → bool) (m: nat) on m: m ≤ n → BitVector (n - m) → bool ≝
83  match m return λm. m ≤ n → BitVector (n - m) → bool with
84  [ O    ⇒ λprf1. λprefix. P ?
85  | S n' ⇒ λprf2. λprefix. bit_elim (λbit. bitvector_elim_internal n P n' ? ?)
86  ].
87  [ applyS prefix
88  | letin res ≝ (bit ::: prefix)
89    < (minus_S_S ? ?)
90    > (minus_Sn_m ? ?)
91    [ @ res
92    | @ prf2
93    ]
94  | /2/
95  ].
96qed.
97
98definition bitvector_elim ≝
99  λn: nat.
100  λP: BitVector n → bool.
101    bitvector_elim_internal n P n ? ?.
102  [ @ (le_n ?)
103  | < (minus_n_n ?)
104    @ [[ ]]
105  ]
106qed.
107
108axiom vector_associative_append:
109  ∀A: Type[0].
110  ∀n, m, o:  nat.
111  ∀v: Vector A n.
112  ∀q: Vector A m.
113  ∀r: Vector A o.
114    ((v @@ q) @@ r)
115    ≃
116    (v @@ (q @@ r)).
117       
118lemma vector_cons_append:
119  ∀A: Type[0].
120  ∀n: nat.
121  ∀e: A.
122  ∀v: Vector A n.
123    e ::: v = [[ e ]] @@ v.
124  # A # N # E # V
125  elim V
126  [ normalize %
127  | # NN # AA # VV # IH
128    normalize
129    %
130  ]
131qed.
132
133lemma super_rewrite2:
134 ∀A:Type[0].∀n,m.∀v1: Vector A n.∀v2: Vector A m.
135  ∀P: ∀m. Vector A m → Prop.
136   n=m → v1 ≃ v2 → P n v1 → P m v2.
137 #A #n #m #v1 #v2 #P #EQ <EQ in v2; #V #JMEQ >JMEQ //
138qed.
139
140lemma mem_middle_vector:
141  ∀A: Type[0].
142  ∀m, o: nat.
143  ∀eq: A → A → bool.
144  ∀reflex: ∀a. eq a a = true.
145  ∀p: Vector A m.
146  ∀a: A.
147  ∀r: Vector A o.
148    mem A eq ? (p@@(a:::r)) a = true.
149  # A # M # O # EQ # REFLEX # P # A
150  elim P
151  [ normalize
152    > (REFLEX A)
153    normalize
154    # H
155    %
156  | # NN # AA # PP # IH
157    normalize
158    cases (EQ A AA) //
159     @ IH
160  ]
161qed.
162
163lemma mem_monotonic_wrt_append:
164  ∀A: Type[0].
165  ∀m, o: nat.
166  ∀eq: A → A → bool.
167  ∀reflex: ∀a. eq a a = true.
168  ∀p: Vector A m.
169  ∀a: A.
170  ∀r: Vector A o.
171    mem A eq ? r a = true → mem A eq ? (p @@ r) a = true.
172  # A # M # O # EQ # REFLEX # P # A
173  elim P
174  [ #R #H @H
175  | #NN #AA # PP # IH #R #H
176    normalize
177    cases (EQ A AA)
178    [ normalize %
179    | @ IH @ H
180    ]
181  ]
182qed.
183
184lemma subvector_multiple_append:
185  ∀A: Type[0].
186  ∀o, n: nat.
187  ∀eq: A → A → bool.
188  ∀refl: ∀a. eq a a = true.
189  ∀h: Vector A o.
190  ∀v: Vector A n.
191  ∀m: nat.
192  ∀q: Vector A m.
193    bool_to_Prop (subvector_with A ? ? eq v (h @@ q @@ v)).
194  # A # O # N # EQ # REFLEX # H # V
195  elim V
196  [ normalize
197    # M # V %
198  | # NN # AA # VV # IH # MM # QQ
199    change with (bool_to_Prop (andb ??))
200    cut ((mem A EQ (O + (MM + S NN)) (H@@QQ@@AA:::VV) AA) = true)
201    [
202    | # HH > HH
203      > (vector_cons_append ? ? AA VV)
204      change with (bool_to_Prop (subvector_with ??????))
205      @(super_rewrite2 A ((MM + 1)+ NN) (MM+S NN) ??
206        (λSS.λVS.bool_to_Prop (subvector_with ?? (O+SS) ?? (H@@VS)))
207        ?
208        (vector_associative_append A ? ? ? QQ [[AA]] VV))
209      [ >associative_plus //
210      | @IH ]
211    ]
212    @(mem_monotonic_wrt_append)
213    [ @ REFLEX
214    | @(mem_monotonic_wrt_append)
215      [ @ REFLEX
216      | normalize
217        > REFLEX
218        normalize
219        %
220      ]
221    ]
222qed.
223
224lemma vector_cons_empty:
225  ∀A: Type[0].
226  ∀n: nat.
227  ∀v: Vector A n.
228    [[ ]] @@ v = v.
229  # A # N # V
230  elim V
231  [ normalize %
232  | # NN # HH # VV #H %
233  ]
234qed.
235
236corollary subvector_hd_tl:
237  ∀A: Type[0].
238  ∀o: nat.
239  ∀eq: A → A → bool.
240  ∀refl: ∀a. eq a a = true.
241  ∀h: A.
242  ∀v: Vector A o.
243    bool_to_Prop (subvector_with A ? ? eq v (h ::: v)).
244  # A # O # EQ # REFLEX # H # V
245  > (vector_cons_append A ? H V)
246  < (vector_cons_empty A ? ([[H]] @@ V))
247  @ (subvector_multiple_append A ? ? EQ REFLEX [[]] V ? [[ H ]])
248qed.
249
250lemma eq_a_reflexive:
251  ∀a. eq_a a a = true.
252  # A
253  cases A
254  %
255qed.
256
257lemma is_in_monotonic_wrt_append:
258  ∀m, n: nat.
259  ∀p: Vector addressing_mode_tag m.
260  ∀q: Vector addressing_mode_tag n.
261  ∀to_search: addressing_mode.
262    bool_to_Prop (is_in ? p to_search) → bool_to_Prop (is_in ? (q @@ p) to_search).
263  # M # N # P # Q # TO_SEARCH
264  # H
265  elim Q
266  [ normalize
267    @ H
268  | # NN # PP # QQ # IH
269    normalize
270    cases (is_a PP TO_SEARCH)
271    [ normalize
272      %
273    | normalize
274      normalize in IH
275      @ IH
276    ]
277  ]
278qed.
279
280corollary is_in_hd_tl:
281  ∀to_search: addressing_mode.
282  ∀hd: addressing_mode_tag.
283  ∀n: nat.
284  ∀v: Vector addressing_mode_tag n.
285    bool_to_Prop (is_in ? v to_search) → bool_to_Prop (is_in ? (hd:::v) to_search).
286  # TO_SEARCH # HD # N # V
287  elim V
288  [ # H
289    normalize in H;
290    cases H
291  | # NN # HHD # VV # IH # HH
292    > vector_cons_append
293    > (vector_cons_append ? ? HHD VV)
294    @ (is_in_monotonic_wrt_append ? 1 ([[HHD]]@@VV) [[HD]] TO_SEARCH)
295    @ HH
296  ]
297qed.
298 
299let rec list_addressing_mode_tags_elim
300  (n: nat) (l: Vector addressing_mode_tag (S n)) on l: (l → bool) → bool ≝
301  match l return λx.match x with [O ⇒ λl: Vector … O. bool | S x' ⇒ λl: Vector addressing_mode_tag (S x').
302   (l → bool) → bool ] with
303  [ VEmpty      ⇒  true 
304  | VCons len hd tl ⇒ λP.
305    let process_hd ≝
306      match hd return λhd. ∀P: hd:::tl → bool. bool with
307      [ direct ⇒ λP.bitvector_elim 8 (λx. P (DIRECT x))
308      | indirect ⇒ λP.bit_elim (λx. P (INDIRECT x))
309      | ext_indirect ⇒ λP.bit_elim (λx. P (EXT_INDIRECT x))
310      | registr ⇒ λP.bitvector_elim 3 (λx. P (REGISTER x))
311      | acc_a ⇒ λP.P ACC_A
312      | acc_b ⇒ λP.P ACC_B
313      | dptr ⇒ λP.P DPTR
314      | data ⇒ λP.bitvector_elim 8 (λx. P (DATA x))
315      | data16 ⇒ λP.bitvector_elim 16 (λx. P (DATA16 x))
316      | acc_dptr ⇒ λP.P ACC_DPTR
317      | acc_pc ⇒ λP.P ACC_PC
318      | ext_indirect_dptr ⇒ λP.P EXT_INDIRECT_DPTR
319      | indirect_dptr ⇒ λP.P INDIRECT_DPTR
320      | carry ⇒ λP.P CARRY
321      | bit_addr ⇒ λP.bitvector_elim 8 (λx. P (BIT_ADDR x))
322      | n_bit_addr ⇒ λP.bitvector_elim 8 (λx. P (N_BIT_ADDR x))
323      | relative ⇒ λP.bitvector_elim 8 (λx. P (RELATIVE x))
324      | addr11 ⇒ λP.bitvector_elim 11 (λx. P (ADDR11 x))
325      | addr16 ⇒ λP.bitvector_elim 16 (λx. P (ADDR16 x))
326      ]
327    in
328      andb (process_hd P)
329       (match len return λx. x = len → bool with
330         [ O ⇒ λprf. true
331         | S y ⇒ λprf. list_addressing_mode_tags_elim y ? P ] (refl ? len))
332  ].
333  try %
334  [ 2: cases (sym_eq ??? prf); @tl
335  | generalize in match H; generalize in match tl; cases prf;
336    (* cases prf in tl H; : ??? WAS WORKING BEFORE *)
337    #tl
338    normalize in ⊢ (∀_: %. ?)
339    # H
340    whd
341    normalize in ⊢ (match % with [ _ ⇒ ? | _ ⇒ ?])
342    cases (is_a hd (subaddressing_modeel y tl H)) whd // ]
343qed.
344
345definition product_elim ≝
346  λm, n: nat.
347  λv: Vector addressing_mode_tag (S m).
348  λq: Vector addressing_mode_tag (S n).
349  λP: (v × q) → bool.
350    list_addressing_mode_tags_elim ? v (λx. list_addressing_mode_tags_elim ? q (λy. P 〈x, y〉)).
351
352definition union_elim ≝
353  λA, B: Type[0].
354  λelimA: (A → bool) → bool.
355  λelimB: (B → bool) → bool.
356  λelimU: A ⊎ B → bool.
357    elimA (λa. elimB (λb. elimU (inl ? ? a) ∧ elimU (inr ? ? b))).
358                           
359definition preinstruction_elim: ∀P: preinstruction [[ relative ]] → bool. bool ≝
360  λP.
361    list_addressing_mode_tags_elim ? [[ registr ; direct ; indirect ; data ]] (λaddr. P (ADD ? ACC_A addr)) ∧
362    list_addressing_mode_tags_elim ? [[ registr ; direct ; indirect ; data ]] (λaddr. P (ADDC ? ACC_A addr)) ∧
363    list_addressing_mode_tags_elim ? [[ registr ; direct ; indirect ; data ]] (λaddr. P (SUBB ? ACC_A addr)) ∧
364    list_addressing_mode_tags_elim ? [[ acc_a ; registr ; direct ; indirect ; dptr ]] (λaddr. P (INC ? addr)) ∧
365    list_addressing_mode_tags_elim ? [[ acc_a ; registr ; direct ; indirect ]] (λaddr. P (DEC ? addr)) ∧
366    list_addressing_mode_tags_elim ? [[acc_b]] (λaddr. P (MUL ? ACC_A addr)) ∧
367    list_addressing_mode_tags_elim ? [[acc_b]] (λaddr. P (DIV ? ACC_A addr)) ∧
368    list_addressing_mode_tags_elim ? [[ registr ; direct ]] (λaddr. bitvector_elim 8 (λr. P (DJNZ ? addr (RELATIVE r)))) ∧
369    list_addressing_mode_tags_elim ? [[ acc_a ; carry ; bit_addr ]] (λaddr. P (CLR ? addr)) ∧
370    list_addressing_mode_tags_elim ? [[ acc_a ; carry ; bit_addr ]] (λaddr. P (CPL ? addr)) ∧
371    P (DA ? ACC_A) ∧
372    bitvector_elim 8 (λr. P (JC ? (RELATIVE r))) ∧
373    bitvector_elim 8 (λr. P (JNC ? (RELATIVE r))) ∧
374    bitvector_elim 8 (λr. P (JZ ? (RELATIVE r))) ∧
375    bitvector_elim 8 (λr. P (JNZ ? (RELATIVE r))) ∧
376    bitvector_elim 8 (λr. (bitvector_elim 8 (λb: BitVector 8. P (JB ? (BIT_ADDR b) (RELATIVE r))))) ∧
377    bitvector_elim 8 (λr. (bitvector_elim 8 (λb: BitVector 8. P (JNB ? (BIT_ADDR b) (RELATIVE r))))) ∧
378    bitvector_elim 8 (λr. (bitvector_elim 8 (λb: BitVector 8. P (JBC ? (BIT_ADDR b) (RELATIVE r))))) ∧
379    list_addressing_mode_tags_elim ? [[ registr; direct ]] (λaddr. bitvector_elim 8 (λr. P (DJNZ ? addr (RELATIVE r)))) ∧
380    P (RL ? ACC_A) ∧
381    P (RLC ? ACC_A) ∧
382    P (RR ? ACC_A) ∧
383    P (RRC ? ACC_A) ∧
384    P (SWAP ? ACC_A) ∧
385    P (RET ?) ∧
386    P (RETI ?) ∧
387    P (NOP ?) ∧
388    bit_elim (λb. P (XCHD ? ACC_A (INDIRECT b))) ∧
389    list_addressing_mode_tags_elim ? [[ carry; bit_addr ]] (λaddr. P (SETB ? addr)) ∧
390    bitvector_elim 8 (λaddr. P (PUSH ? (DIRECT addr))) ∧
391    bitvector_elim 8 (λaddr. P (POP ? (DIRECT addr))) ∧
392    union_elim ? ? (product_elim ? ? [[ acc_a ]] [[ direct; data ]])
393                   (product_elim ? ? [[ registr; indirect ]] [[ data ]])
394                   (λd. bitvector_elim 8 (λb. P (CJNE ? d (RELATIVE b)))) ∧
395    list_addressing_mode_tags_elim ? [[ registr; direct; indirect ]] (λaddr. P (XCH ? ACC_A addr)) ∧
396    union_elim ? ? (product_elim ? ? [[acc_a]] [[ data ; registr ; direct ; indirect ]])
397                   (product_elim ? ? [[direct]] [[ acc_a ; data ]])
398                   (λd. P (XRL ? d)) ∧
399    union_elim ? ? (union_elim ? ? (product_elim ? ? [[acc_a]] [[ registr ; direct ; indirect ; data ]])
400                                   (product_elim ? ? [[direct]] [[ acc_a ; data ]]))
401                   (product_elim ? ? [[carry]] [[ bit_addr ; n_bit_addr]])
402                   (λd. P (ANL ? d)) ∧
403    union_elim ? ? (union_elim ? ? (product_elim ? ? [[acc_a]] [[ registr ; data ; direct ; indirect ]])
404                                   (product_elim ? ? [[direct]] [[ acc_a ; data ]]))
405                   (product_elim ? ? [[carry]] [[ bit_addr ; n_bit_addr]])
406                   (λd. P (ORL ? d)) ∧
407    union_elim ? ? (product_elim ? ? [[acc_a]] [[ ext_indirect ; ext_indirect_dptr ]])
408                   (product_elim ? ? [[ ext_indirect ; ext_indirect_dptr ]] [[acc_a]])
409                   (λd. P (MOVX ? d)) ∧
410    union_elim ? ? (
411      union_elim ? ? (
412        union_elim ? ? (
413          union_elim ? ? (
414            union_elim ? ?  (product_elim ? ? [[acc_a]] [[ registr ; direct ; indirect ; data ]])
415                            (product_elim ? ? [[ registr ; indirect ]] [[ acc_a ; direct ; data ]]))
416                            (product_elim ? ? [[direct]] [[ acc_a ; registr ; direct ; indirect ; data ]]))
417                            (product_elim ? ? [[dptr]] [[data16]]))
418                            (product_elim ? ? [[carry]] [[bit_addr]]))
419                            (product_elim ? ? [[bit_addr]] [[carry]])
420                            (λd. P (MOV ? d)).
421  %
422qed.
423 
424definition instruction_elim: ∀P: instruction → bool. bool ≝
425  λP. (*
426    bitvector_elim 11 (λx. P (ACALL (ADDR11 x))) ∧
427    bitvector_elim 16 (λx. P (LCALL (ADDR16 x))) ∧
428    bitvector_elim 11 (λx. P (AJMP (ADDR11 x))) ∧
429    bitvector_elim 16 (λx. P (LJMP (ADDR16 x))) ∧ *)
430    bitvector_elim 8 (λx. P (SJMP (RELATIVE x))). (*  ∧
431    P (JMP INDIRECT_DPTR) ∧
432    list_addressing_mode_tags_elim ? [[ acc_dptr; acc_pc ]] (λa. P (MOVC ACC_A a)) ∧
433    preinstruction_elim (λp. P (RealInstruction p)). *)
434  %
435qed.
436
437
438axiom instruction_elim_complete:
439 ∀P. instruction_elim P = true → ∀i. P i = true.
440
441(*definition eq_instruction ≝
442  λi, j: instruction.
443    true.*)
444axiom eq_instruction: instruction → instruction → bool.
445let rec vect_member
446  (A: Type[0]) (n: nat) (eq: A → A → bool)
447  (v: Vector A n) (a: A) on v: bool ≝
448  match v with
449  [ VEmpty          ⇒ false
450  | VCons len hd tl ⇒
451    eq hd a ∨ (vect_member A ? eq tl a)
452  ].
453   
454let rec list_addressing_mode_tags_elim_prop
455  (n: nat)
456  (l: Vector addressing_mode_tag (S n))
457  (P: addressing_mode → Prop) on l:
458  ∀direct_a. ∀indirect_a. ∀ext_indirect_a. ∀register_a. ∀acc_a_a.
459  ∀acc_b_a. ∀dptr_a. ∀data_a. ∀data16_a. ∀acc_dptr_a. ∀acc_pc_a.
460  ∀ext_indirect_dptr_a. ∀indirect_dptr_a. ∀carry_a. ∀bit_addr_a.
461  ∀n_bit_addr_a. ∀relative_a. ∀addr11_a. ∀addr16_a.
462  ∀x: l. P x ≝
463  match l return
464    λy.
465      match y with
466      [ O    ⇒ λm: Vector addressing_mode_tag O. ∀prf: 0 = S n. True
467      | S y' ⇒ λl: Vector addressing_mode_tag (S y'). ∀prf: S y' = S n.
468               ∀direct_a: if vect_member … eq_a l direct then ∀x. P (DIRECT x) else True.
469               ∀indirect_a: if vect_member … eq_a l indirect then ∀x. P (INDIRECT x) else True.
470               ∀ext_indirect_a: if vect_member … eq_a l ext_indirect then ∀x. P (EXT_INDIRECT x) else True.
471               ∀register_a: if vect_member … eq_a l registr then ∀x. P (REGISTER x) else True.
472               ∀acc_a_a: if vect_member … eq_a l acc_a then P (ACC_A) else True.
473               ∀acc_b_a: if vect_member … eq_a l acc_b then P (ACC_B) else True.
474               ∀dptr_a: if vect_member … eq_a l dptr then P DPTR else True.
475               ∀data_a: if vect_member … eq_a l data then ∀x. P (DATA x) else True.
476               ∀data16_a: if vect_member … eq_a l data16 then ∀x. P (DATA16 x) else True.
477               ∀acc_dptr_a: if vect_member … eq_a l acc_dptr then P ACC_DPTR else True.
478               ∀acc_pc_a: if vect_member … eq_a l acc_pc then P ACC_PC else True.
479               ∀ext_indirect_dptr_a: if vect_member … eq_a l ext_indirect_dptr then P EXT_INDIRECT_DPTR else True.
480               ∀indirect_dptr_a: if vect_member … eq_a l indirect_dptr then P INDIRECT_DPTR else True.
481               ∀carry_a: if vect_member … eq_a l carry then P CARRY else True.
482               ∀bit_addr_a: if vect_member … eq_a l bit_addr then ∀x. P (BIT_ADDR x) else True.
483               ∀n_bit_addr_a: if vect_member … eq_a l n_bit_addr then ∀x. P (N_BIT_ADDR x) else True.
484               ∀relative_a: if vect_member … eq_a l relative then ∀x. P (RELATIVE x) else True.
485               ∀addr11_a: if vect_member … eq_a l addr11 then ∀x. P (ADDR11 x) else True.
486               ∀addr_16_a: if vect_member … eq_a l addr16 then ∀x. P (ADDR16 x) else True.
487               ∀x:l. P x
488      ] with
489  [ VEmpty          ⇒ λAbsurd. ⊥
490  | VCons len hd tl ⇒ λProof. ?
491  ] (refl ? (S n)).
492  [ destruct(Absurd)
493  | # A1 # A2 # A3 # A4 # A5 # A6 # A7
494    # A8 # A9 # A10 # A11 # A12 # A13 # A14
495    # A15 # A16 # A17 # A18 # A19 # X
496    cases X
497    # SUB cases daemon ] qed.(*
498    cases SUB
499    [ # BYTE
500    normalize
501  ].
502 
503 
504(*    let prepare_hd ≝
505      match hd with
506      [ direct ⇒ λdirect_prf. ?
507      | indirect ⇒ λindirect_prf. ?
508      | ext_indirect ⇒ λext_indirect_prf. ?
509      | registr ⇒ λregistr_prf. ?
510      | acc_a ⇒ λacc_a_prf. ?
511      | acc_b ⇒ λacc_b_prf. ?
512      | dptr ⇒ λdptr_prf. ?
513      | data ⇒ λdata_prf. ?
514      | data16 ⇒ λdata16_prf. ?
515      | acc_dptr ⇒ λacc_dptr_prf. ?
516      | acc_pc ⇒ λacc_pc_prf. ?
517      | ext_indirect_dptr ⇒ λext_indirect_prf. ?
518      | indirect_dptr ⇒ λindirect_prf. ?
519      | carry ⇒ λcarry_prf. ?
520      | bit_addr ⇒ λbit_addr_prf. ?
521      | n_bit_addr ⇒ λn_bit_addr_prf. ?
522      | relative ⇒ λrelative_prf. ?
523      | addr11 ⇒ λaddr11_prf. ?
524      | addr16 ⇒ λaddr16_prf. ?
525      ]
526    in ? *)
527  ].
528  [ 1: destruct(absd)
529  | 2: # A1 # A2 # A3 # A4 # A5 # A6
530       # A7 # A8 # A9 # A10 # A11 # A12
531       # A13 # A14 # A15 # A16 # A17 # A18
532       # A19 *
533  ].
534
535
536  match l return λx.match x with [O ⇒ λl: Vector … O. bool | S x' ⇒ λl: Vector addressing_mode_tag (S x').
537   (l → bool) → bool ] with
538  [ VEmpty      ⇒  true 
539  | VCons len hd tl ⇒ λP.
540    let process_hd ≝
541      match hd return λhd. ∀P: hd:::tl → bool. bool with
542      [ direct ⇒ λP.bitvector_elim 8 (λx. P (DIRECT x))
543      | indirect ⇒ λP.bit_elim (λx. P (INDIRECT x))
544      | ext_indirect ⇒ λP.bit_elim (λx. P (EXT_INDIRECT x))
545      | registr ⇒ λP.bitvector_elim 3 (λx. P (REGISTER x))
546      | acc_a ⇒ λP.P ACC_A
547      | acc_b ⇒ λP.P ACC_B
548      | dptr ⇒ λP.P DPTR
549      | data ⇒ λP.bitvector_elim 8 (λx. P (DATA x))
550      | data16 ⇒ λP.bitvector_elim 16 (λx. P (DATA16 x))
551      | acc_dptr ⇒ λP.P ACC_DPTR
552      | acc_pc ⇒ λP.P ACC_PC
553      | ext_indirect_dptr ⇒ λP.P EXT_INDIRECT_DPTR
554      | indirect_dptr ⇒ λP.P INDIRECT_DPTR
555      | carry ⇒ λP.P CARRY
556      | bit_addr ⇒ λP.bitvector_elim 8 (λx. P (BIT_ADDR x))
557      | n_bit_addr ⇒ λP.bitvector_elim 8 (λx. P (N_BIT_ADDR x))
558      | relative ⇒ λP.bitvector_elim 8 (λx. P (RELATIVE x))
559      | addr11 ⇒ λP.bitvector_elim 11 (λx. P (ADDR11 x))
560      | addr16 ⇒ λP.bitvector_elim 16 (λx. P (ADDR16 x))
561      ]
562    in
563      andb (process_hd P)
564       (match len return λx. x = len → bool with
565         [ O ⇒ λprf. true
566         | S y ⇒ λprf. list_addressing_mode_tags_elim y ? P ] (refl ? len))
567  ].
568  try %
569  [ 2: cases (sym_eq ??? prf); @tl
570  | generalize in match H; generalize in match tl; cases prf;
571    (* cases prf in tl H; : ??? WAS WORKING BEFORE *)
572    #tl
573    normalize in ⊢ (∀_: %. ?)
574    # H
575    whd
576    normalize in ⊢ (match % with [ _ ⇒ ? | _ ⇒ ?])
577    cases (is_a hd (subaddressing_modeel y tl H)) whd // ]
578qed.
579*)
580(*
581lemma test:
582  let i ≝ SJMP (RELATIVE (bitvector_of_nat 8 255)) in
583      (let assembled ≝ assembly1 i in
584      let code_memory ≝ load_code_memory assembled in
585      let fetched ≝ fetch code_memory ? in
586      let 〈instr_pc, ticks〉 ≝ fetched in
587        eq_instruction (\fst instr_pc)) i = true.
588 [2: @ zero
589 | normalize
590 ]*)
591
592lemma BitVectorTrie_O:
593 ∀A:Type[0].∀v:BitVectorTrie A 0.(∃w. v ≃ Leaf A w) ∨ v ≃ Stub A 0.
594 #A #v generalize in match (refl … O) cases v in ⊢ (??%? → (?(??(λ_.?%%??)))(?%%??))
595  [ #w #_ %1 %[@w] %
596  | #n #l #r #abs @⊥ //
597  | #n #EQ %2 >EQ %]
598qed.
599
600lemma BitVectorTrie_Sn:
601 ∀A:Type[0].∀n.∀v:BitVectorTrie A (S n).(∃l,r. v ≃ Node A n l r) ∨ v ≃ Stub A (S n).
602 #A #n #v generalize in match (refl … (S n)) cases v in ⊢ (??%? → (?(??(λ_.??(λ_.?%%??))))%)
603  [ #m #abs @⊥ //
604  | #m #l #r #EQ %1 <(injective_S … EQ) %[@l] %[@r] //
605  | #m #EQ %2 // ]
606qed.
607
608lemma lookup_prepare_trie_for_insertion_hit:
609 ∀A:Type[0].∀a,v:A.∀n.∀b:BitVector n.
610  lookup … b (prepare_trie_for_insertion … b v) a = v.
611 #A #a #v #n #b elim b // #m #hd #tl #IH cases hd normalize //
612qed.
613 
614lemma lookup_insert_hit:
615 ∀A:Type[0].∀a,v:A.∀n.∀b:BitVector n.∀t:BitVectorTrie A n.
616  lookup … b (insert … b v t) a = v.
617 #A #a #v #n #b elim b -b -n //
618 #n #hd #tl #IH #t cases(BitVectorTrie_Sn … t)
619  [ * #l * #r #JMEQ >JMEQ cases hd normalize //
620  | #JMEQ >JMEQ cases hd normalize @lookup_prepare_trie_for_insertion_hit ]
621qed.
622
623lemma BitVector_O: ∀v:BitVector 0. v ≃ VEmpty bool.
624 #v generalize in match (refl … 0) cases v in ⊢ (??%? → ?%%??) //
625 #n #hd #tl #abs @⊥ //
626qed.
627
628lemma BitVector_Sn: ∀n.∀v:BitVector (S n).
629 ∃hd.∃tl.v ≃ VCons bool n hd tl.
630 #n #v generalize in match (refl … (S n)) cases v in ⊢ (??%? → ??(λ_.??(λ_.?%%??)))
631 [ #abs @⊥ //
632 | #m #hd #tl #EQ <(injective_S … EQ) %[@hd] %[@tl] // ]
633qed.
634
635coercion bool_to_Prop: ∀b:bool. Prop ≝ bool_to_Prop on _b:bool to Type[0].
636
637lemma lookup_prepare_trie_for_insertion_miss:
638 ∀A:Type[0].∀a,v:A.∀n.∀c,b:BitVector n.
639  (notb (eq_bv ? b c)) → lookup … b (prepare_trie_for_insertion … c v) a = a.
640 #A #a #v #n #c elim c
641  [ #b >(BitVector_O … b) normalize #abs @⊥ //
642  | #m #hd #tl #IH #b cases(BitVector_Sn … b) #hd' * #tl' #JMEQ >JMEQ
643    cases hd cases hd' normalize
644    [2,3: #_ cases tl' //
645    |*: change with (bool_to_Prop (notb (eq_bv ???)) → ?) /2/ ]]
646qed.
647 
648lemma lookup_insert_miss:
649 ∀A:Type[0].∀a,v:A.∀n.∀c,b:BitVector n.∀t:BitVectorTrie A n.
650  (notb (eq_bv ? b c)) → lookup … b (insert … c v t) a = lookup … b t a.
651 #A #a #v #n #c elim c -c -n
652  [ #b #t #DIFF @⊥ whd in DIFF; >(BitVector_O … b) in DIFF //
653  | #n #hd #tl #IH #b cases(BitVector_Sn … b) #hd' * #tl' #JMEQ >JMEQ
654    #t cases(BitVectorTrie_Sn … t)
655    [ * #l * #r #JMEQ >JMEQ cases hd cases hd' #H normalize in H;
656     [1,4: change in H with (bool_to_Prop (notb (eq_bv ???))) ] normalize // @IH //
657    | #JMEQ >JMEQ cases hd cases hd' #H normalize in H;
658     [1,4: change in H with (bool_to_Prop (notb (eq_bv ???))) ] normalize
659     [3,4: cases tl' // | *: @lookup_prepare_trie_for_insertion_miss //]]]
660qed.
661
662definition load_code_memory_aux ≝
663 fold_left_i_aux … (
664   λi, mem, v.
665     insert … (bitvector_of_nat … i) v mem) (Stub Byte 16).
666
667axiom split_elim:
668 ∀A,l,m,v.∀P: (Vector A l) × (Vector A m) → Prop.
669  (∀vl,vm. v = vl@@vm → P 〈vl,vm〉) → P (split A l m v).
670
671axiom half_add_SO:
672 ∀pc.
673 \snd (half_add 16 (bitvector_of_nat … pc) (bitvector_of_nat … 1)) = bitvector_of_nat … (S pc).
674
675axiom not_eqvb_S:
676 ∀pc.
677 (¬eq_bv 16 (bitvector_of_nat 16 pc) (bitvector_of_nat 16 (S pc))).
678
679axiom not_eqvb_SS:
680 ∀pc.
681 (¬eq_bv 16 (bitvector_of_nat 16 pc) (bitvector_of_nat 16 (S (S pc)))).
682
683lemma test:
684  ∀pc,i.
685     (let assembled ≝ assembly1 i in
686      let code_memory ≝ load_code_memory_aux pc assembled in
687      let fetched ≝ fetch code_memory (bitvector_of_nat … pc) in
688      let 〈instr_pc, ticks〉 ≝ fetched in
689        eq_instruction (\fst instr_pc)) i = true.
690 #pc #i cases i #arg try #arg2 whd in ⊢ (??%?)
691   [2,4: @(list_addressing_mode_tags_elim_prop ? [[addr16]] ???????????????????? arg) whd try % #XX
692         whd in ⊢ (??(match ? (? ? %) ? with [ _ ⇒ ?] ?)?)
693       cases arg #sam cases sam #XX try #PP normalize in PP; try cases PP;
694       whd in ⊢ (??(match ? (? ? %) ? with [ _ ⇒ ?] ?)?) try cases PP normalize in XX;
695       [1,2,3,4,5,6,7,8,10,11,12,13,14,15,16,17: cases XX
696       |*:@split_elim #b1 #b2 #EQ >EQ -EQ;
697        change in ⊢ (??(match % with [ _ ⇒ ?] ?)?) with (fetch0 ??)
698        whd in ⊢ (??(match ??% with [ _ ⇒ ?] ?)?)
699        >lookup_insert_miss //
700        >lookup_insert_miss //
701        >lookup_insert_hit
702        whd in ⊢ (??(match % with [ _ ⇒ ?] ?)?)
703        whd in ⊢ (??%?) whd in ⊢ (??(?%?)?)
704        >half_add_SO >half_add_SO
705        >lookup_insert_miss [2,4: @not_eqvb_S]
706        >lookup_insert_hit >lookup_insert_hit]
707   |
708       
709       
710         
711 
712   [2: #addr whd in ⊢ (??%?)
713 
714   @ (instruction_elim_complete )
715 | @ zero
716 ]
717 normalize
718   
719 
720(* This establishes the correspondence between pseudo program counters and
721   program counters. It is at the heart of the proof. *)
722(*CSC: code taken from build_maps *)
723definition sigma0: pseudo_assembly_program → option (nat × (nat × (BitVectorTrie Word 16))) ≝
724 λinstr_list.
725  foldl ??
726    (λt. λi.
727       match t with
728       [ None ⇒ None ?
729       | Some ppc_pc_map ⇒
730         let 〈ppc,pc_map〉 ≝ ppc_pc_map in
731         let 〈program_counter, sigma_map〉 ≝ pc_map in
732         let 〈label, i〉 ≝ i in
733          match construct_costs instr_list program_counter (λx. zero ?) (λx. zero ?) (Stub …) i with
734           [ None ⇒ None ?
735           | Some pc_ignore ⇒
736              let 〈pc,ignore〉 ≝ pc_ignore in
737              Some … 〈S ppc,〈pc, insert ? ? (bitvector_of_nat ? ppc) (bitvector_of_nat ? pc) sigma_map〉〉 ]
738       ]) (Some ? 〈0, 〈0, (Stub ? ?)〉〉) (\snd instr_list).
739       
740definition tech_pc_sigma0: pseudo_assembly_program → option (nat × (BitVectorTrie Word 16)) ≝
741 λinstr_list.
742  match sigma0 instr_list with
743   [ None ⇒ None …
744   | Some result ⇒
745      let 〈ppc,pc_sigma_map〉 ≝ result in
746       Some … pc_sigma_map ].
747
748definition sigma_safe: pseudo_assembly_program → option (Word → Word) ≝       
749 λinstr_list.
750  match sigma0 instr_list with
751  [ None ⇒ None ?
752  | Some result ⇒
753    let 〈ppc,pc_sigma_map〉 ≝ result in
754    let 〈pc, sigma_map〉 ≝ pc_sigma_map in
755      if gtb pc (2^16) then
756        None ?
757      else
758        Some ? (λx.lookup ?? x sigma_map (zero …)) ].
759
760axiom policy_ok: ∀p. sigma_safe p ≠ None ….
761
762definition sigma: pseudo_assembly_program → Word → Word ≝
763 λp.
764  match sigma_safe p return λr:option (Word → Word). r ≠ None … → Word → Word with
765   [ None ⇒ λabs. ⊥
766   | Some r ⇒ λ_.r] (policy_ok p).
767 cases abs //
768qed.
769
770lemma length_append:
771 ∀A.∀l1,l2:list A.
772  |l1 @ l2| = |l1| + |l2|.
773 #A #l1 elim l1
774  [ //
775  | #hd #tl #IH #l2 normalize <IH //]
776qed.
777
778let rec does_not_occur (id:Identifier) (l:list labelled_instruction) on l: bool ≝
779 match l with
780  [ nil ⇒ true
781  | cons hd tl ⇒ notb (instruction_matches_identifier id hd) ∧ does_not_occur id tl].
782
783lemma does_not_occur_None:
784 ∀id,i,list_instr.
785  does_not_occur id (list_instr@[〈None …,i〉]) =
786  does_not_occur id list_instr.
787 #id #i #list_instr elim list_instr
788  [ % | #hd #tl #IH whd in ⊢ (??%%) >IH %]
789qed.
790
791let rec occurs_exactly_once (id:Identifier) (l:list labelled_instruction) on l : bool ≝
792 match l with
793  [ nil ⇒ false
794  | cons hd tl ⇒
795     if instruction_matches_identifier id hd then
796      does_not_occur id tl
797     else
798      occurs_exactly_once id tl ].
799
800lemma occurs_exactly_once_None:
801 ∀id,i,list_instr.
802  occurs_exactly_once id (list_instr@[〈None …,i〉]) =
803  occurs_exactly_once id list_instr.
804 #id #i #list_instr elim list_instr
805  [ % | #hd #tl #IH whd in ⊢ (??%%) >IH >does_not_occur_None %]
806qed.
807
808lemma index_of_internal_None: ∀i,id,instr_list,n.
809 occurs_exactly_once id (instr_list@[〈None …,i〉]) →
810  index_of_internal ? (instruction_matches_identifier id) instr_list n =
811   index_of_internal ? (instruction_matches_identifier id) (instr_list@[〈None …,i〉]) n.
812 #i #id #instr_list elim instr_list
813  [ #n #abs whd in abs; cases abs
814  | #hd #tl #IH #n whd in ⊢ (% → ??%%); whd in ⊢ (match % with [_ ⇒ ? | _ ⇒ ?] → ?)
815    cases (instruction_matches_identifier id hd) whd in ⊢ (match % with [_ ⇒ ? | _ ⇒ ?] → ??%%)
816    [ #H %
817    | #H @IH whd in H; cases (occurs_exactly_once ??) in H ⊢ %
818      [ #_ % | #abs cases abs ]]]
819qed.
820
821lemma address_of_word_labels_code_mem_None: ∀i,id,instr_list.
822 occurs_exactly_once id (instr_list@[〈None …,i〉]) →
823  address_of_word_labels_code_mem instr_list id =
824  address_of_word_labels_code_mem (instr_list@[〈None …,i〉]) id.
825 #i #id #instr_list #H whd in ⊢ (??%%) whd in ⊢ (??(??%?)(??%?))
826 >(index_of_internal_None … H) %
827qed.
828
829axiom tech_pc_sigma0_append:
830 ∀preamble,instr_list,prefix,label,i,pc',code,pc,costs,costs'.
831  Some … 〈pc,costs〉 = tech_pc_sigma0 〈preamble,prefix〉 →
832   construct_costs 〈preamble,instr_list〉 … pc (λx.zero 16) (λx. zero 16) costs i = Some … 〈pc',code〉 →
833    tech_pc_sigma0 〈preamble,prefix@[〈label,i〉]〉 = Some … 〈pc',costs'〉.
834
835axiom tech_pc_sigma0_append_None:
836 ∀preamble,instr_list,prefix,i,pc,costs.
837  Some … 〈pc,costs〉 = tech_pc_sigma0 〈preamble,prefix〉 →
838   construct_costs 〈preamble,instr_list〉 … pc (λx.zero 16) (λx. zero 16) costs i = None …
839    → False.
840
841
842definition build_maps' ≝
843  λpseudo_program.
844  let 〈preamble,instr_list〉 ≝ pseudo_program in
845  let result ≝
846   foldl_strong
847    (option Identifier × pseudo_instruction)
848    (λpre. Σres:((BitVectorTrie Word 16) × (nat × (BitVectorTrie Word 16))).
849      let pre' ≝ 〈preamble,pre〉 in
850      let 〈labels,pc_costs〉 ≝ res in
851       tech_pc_sigma0 pre' = Some … pc_costs ∧
852       ∀id. occurs_exactly_once id pre →
853        lookup ?? id labels (zero …) = sigma pre' (address_of_word_labels_code_mem pre id))
854    instr_list
855    (λprefix,i,tl,prf,t.
856      let 〈labels, pc_costs〉 ≝ t in
857      let 〈program_counter, costs〉 ≝ pc_costs in
858       let 〈label, i'〉 ≝ i in
859       let labels ≝
860         match label with
861         [ None ⇒ labels
862         | Some label ⇒
863           let program_counter_bv ≝ bitvector_of_nat ? program_counter in
864             insert ? ? label program_counter_bv labels
865         ]
866       in
867         match construct_costs 〈preamble,instr_list〉 program_counter (λx. zero ?) (λx. zero ?) costs i' with
868         [ None ⇒
869            let dummy ≝ 〈labels,pc_costs〉 in
870             dummy
871         | Some construct ⇒ 〈labels, construct〉
872         ]
873    ) 〈(Stub ? ?), 〈0, (Stub ? ?)〉〉
874  in
875   let 〈labels, pc_costs〉 ≝ result in
876   let 〈pc, costs〉 ≝ pc_costs in
877    〈labels, costs〉.
878 [3: whd % // #id normalize in ⊢ (% → ?) #abs @⊥ //
879 | whd cases construct in p3 #PC #CODE #JMEQ %
880    [ @(tech_pc_sigma0_append ??????????? (jmeq_to_eq ??? JMEQ)) | #id #Hid ]
881 | (* dummy case *) @⊥
882   @(tech_pc_sigma0_append_None ?? prefix ???? (jmeq_to_eq ??? p3)) ]
883 [*: generalize in match (sig2 … t) whd in ⊢ (% → ?)
884     >p whd in ⊢ (% → ?) >p1 * #IH0 #IH1 >IH0 // ]
885 whd in ⊢ (??(????%?)?) -labels1;
886 cases label in Hid
887  [ #Hid whd in ⊢ (??(????%?)?) >IH1 -IH1
888     [ >(address_of_word_labels_code_mem_None … Hid)
889       (* MANCA LEMMA: INDIRIZZO TROVATO NEL PROGRAMMA! *)
890     | whd in Hid >occurs_exactly_once_None in Hid // ]
891  | -label #label #Hid whd in ⊢ (??(????%?)?)
892   
893  ]
894qed.
895
896(*
897(*
898notation < "hvbox('let' 〈ident x,ident y〉 ≝ t 'in' s)"
899 with precedence 10
900for @{ match $t with [ pair ${ident x} ${ident y} ⇒ $s ] }.
901*)
902
903lemma build_maps_ok:
904 ∀p:pseudo_assembly_program.
905  let 〈labels,costs〉 ≝ build_maps' p in
906   ∀pc.
907    (nat_of_bitvector … pc) < length … (\snd p) →
908     lookup ?? pc labels (zero …) = sigma p (\snd (fetch_pseudo_instruction (\snd p) pc)).
909 #p cases p #preamble #instr_list
910  elim instr_list
911   [ whd #pc #abs normalize in abs; cases (not_le_Sn_O ?) [#H cases (H abs) ]
912   | #hd #tl #IH
913    whd in ⊢ (match % with [ _ ⇒ ?])
914   ]
915qed.
916*)
917
918(*
919lemma list_elim_rev:
920 ∀A:Type[0].∀P:list A → Prop.
921  P [ ] → (∀n,l. length l = n → P l → 
922  P [ ] → (∀l,a. P l → P (l@[a])) →
923   ∀l. P l.
924 #A #P
925qed.*)
926
927lemma rev_preserves_length:
928 ∀A.∀l. length … (rev A l) = length … l.
929  #A #l elim l
930   [ %
931   | #hd #tl #IH normalize >length_append normalize /2/ ]
932qed.
933
934lemma rev_append:
935 ∀A.∀l1,l2.
936  rev A (l1@l2) = rev A l2 @ rev A l1.
937 #A #l1 elim l1 normalize //
938qed.
939 
940lemma rev_rev: ∀A.∀l. rev … (rev A l) = l.
941 #A #l elim l
942  [ //
943  | #hd #tl #IH normalize >rev_append normalize // ]
944qed.
945
946lemma split_len_Sn:
947 ∀A:Type[0].∀l:list A.∀len.
948  length … l = S len →
949   Σl'.Σa. l = l'@[a] ∧ length … l' = len.
950 #A #l elim l
951  [ normalize #len #abs destruct
952  | #hd #tl #IH #len
953    generalize in match (rev_rev … tl)
954    cases (rev A tl) in ⊢ (??%? → ?)
955     [ #H <H normalize #EQ % [@[ ]] % [@hd] normalize /2/ 
956     | #a #l' #H <H normalize #EQ
957      %[@(hd::rev … l')] %[@a] % //
958      >length_append in EQ #EQ normalize in EQ; normalize;
959      generalize in match (injective_S … EQ) #EQ2 /2/ ]]
960qed.
961
962lemma list_elim_rev:
963 ∀A:Type[0].∀P:list A → Type[0].
964  P [ ] → (∀l,a. P l → P (l@[a])) →
965   ∀l. P l.
966 #A #P #H1 #H2 #l
967 generalize in match (refl … (length … l))
968 generalize in ⊢ (???% → ?) #n generalize in match l
969 elim n
970  [ #L cases L [ // | #x #w #abs (normalize in abs) @⊥ // ]
971  | #m #IH #L #EQ
972    cases (split_len_Sn … EQ) #l' * #a * /3/ ]
973qed.
974
975axiom is_prefix: ∀A:Type[0]. list A → list A → Prop.
976axiom prefix_of_append:
977 ∀A:Type[0].∀l,l1,l2:list A.
978  is_prefix … l l1 → is_prefix … l (l1@l2).
979axiom prefix_reflexive: ∀A,l. is_prefix A l l.
980axiom nil_prefix: ∀A,l. is_prefix A [ ] l.
981
982record Propify (A:Type[0]) : Type[0] (*Prop*) ≝ { in_propify: A }.
983
984definition Propify_elim: ∀A. ∀P:Prop. (A → P) → (Propify A → P) ≝
985 λA,P,H,x. match x with [ mk_Propify p ⇒ H p ].
986
987definition app ≝
988 λA:Type[0].λl1:Propify (list A).λl2:list A.
989  match l1 with
990   [ mk_Propify l1 ⇒ mk_Propify … (l1@l2) ].
991
992lemma app_nil: ∀A,l1. app A l1 [ ] = l1.
993 #A * /3/
994qed.
995
996lemma app_assoc: ∀A,l1,l2,l3. app A (app A l1 l2) l3 = app A l1 (l2@l3).
997 #A * #l1 normalize //
998qed.
999
1000let rec foldli (A: Type[0]) (B: Propify (list A) → Type[0])
1001 (f: ∀prefix. B prefix → ∀x.B (app … prefix [x]))
1002 (prefix: Propify (list A)) (b: B prefix) (l: list A) on l :
1003 B (app … prefix l) ≝
1004  match l with
1005  [ nil ⇒ ? (* b *)
1006  | cons hd tl ⇒ ? (*foldli A B f (prefix@[hd]) (f prefix b hd) tl*)
1007  ].
1008 [ applyS b
1009 | <(app_assoc ?? [hd]) @(foldli A B f (app … prefix [hd]) (f prefix b hd) tl) ]
1010qed.
1011
1012(*
1013let rec foldli (A: Type[0]) (B: list A → Type[0]) (f: ∀prefix. B prefix → ∀x. B (prefix@[x]))
1014 (prefix: list A) (b: B prefix) (l: list A) on l : B (prefix@l) ≝
1015  match l with
1016  [ nil ⇒ ? (* b *)
1017  | cons hd tl ⇒
1018     ? (*foldli A B f (prefix@[hd]) (f prefix b hd) tl*)
1019  ].
1020 [ applyS b
1021 | applyS (foldli A B f (prefix@[hd]) (f prefix b hd) tl) ]
1022qed.
1023*)
1024
1025definition foldll:
1026 ∀A:Type[0].∀B: Propify (list A) → Type[0].
1027  (∀prefix. B prefix → ∀x. B (app … prefix [x])) →
1028   B (mk_Propify … []) → ∀l: list A. B (mk_Propify … l)
1029 ≝ λA,B,f. foldli A B f (mk_Propify … [ ]).
1030
1031axiom is_pprefix: ∀A:Type[0]. Propify (list A) → list A → Prop.
1032axiom pprefix_of_append:
1033 ∀A:Type[0].∀l,l1,l2.
1034  is_pprefix A l l1 → is_pprefix A l (l1@l2).
1035axiom pprefix_reflexive: ∀A,l. is_pprefix A (mk_Propify … l) l.
1036axiom nil_pprefix: ∀A,l. is_pprefix A (mk_Propify … [ ]) l.
1037
1038
1039axiom foldll':
1040 ∀A:Type[0].∀l: list A.
1041  ∀B: ∀prefix:Propify (list A). is_pprefix ? prefix l → Type[0].
1042  (∀prefix,proof. B prefix proof → ∀x,proof'. B (app … prefix [x]) proof') →
1043   B (mk_Propify … [ ]) (nil_pprefix …) → B (mk_Propify … l) (pprefix_reflexive … l).
1044 #A #l #B
1045 generalize in match (foldll A (λprefix. is_pprefix ? prefix l)) #HH
1046 
1047 
1048  #H #acc
1049 @foldll
1050  [
1051  |
1052  ]
1053 
1054 ≝ λA,B,f. foldli A B f (mk_Propify … [ ]).
1055
1056
1057(*
1058record subset (A:Type[0]) (P: A → Prop): Type[0] ≝
1059 { subset_wit:> A;
1060   subset_proof: P subset_wit
1061 }.
1062*)
1063
1064definition build_maps' ≝
1065  λpseudo_program.
1066  let 〈preamble,instr_list〉 ≝ pseudo_program in
1067  let result ≝
1068   foldll
1069    (option Identifier × pseudo_instruction)
1070    (λprefix.
1071      Σt:((BitVectorTrie Word 16) × (nat × (BitVectorTrie Word 16))).
1072       match prefix return λ_.Prop with [mk_Propify prefix ⇒ tech_pc_sigma0 〈preamble,prefix〉 ≠ None ?])
1073    (λprefix,t,i.
1074      let 〈labels, pc_costs〉 ≝ t in
1075      let 〈program_counter, costs〉 ≝ pc_costs in
1076       let 〈label, i'〉 ≝ i in
1077       let labels ≝
1078         match label with
1079         [ None ⇒ labels
1080         | Some label ⇒
1081           let program_counter_bv ≝ bitvector_of_nat ? program_counter in
1082             insert ? ? label program_counter_bv labels
1083         ]
1084       in
1085         match construct_costs pseudo_program program_counter (λx. zero ?) (λx. zero ?) costs i' with
1086         [ None ⇒
1087            let dummy ≝ 〈labels,pc_costs〉 in
1088              dummy
1089         | Some construct ⇒ 〈labels, construct〉
1090         ]
1091    ) 〈(Stub ? ?), 〈0, (Stub ? ?)〉〉 instr_list
1092  in
1093   let 〈labels, pc_costs〉 ≝ result in
1094   let 〈pc, costs〉 ≝ pc_costs in
1095    〈labels, costs〉.
1096 [
1097 | @⊥
1098 | normalize % //
1099 ]
1100qed.
1101
1102definition build_maps' ≝
1103  λpseudo_program.
1104  let 〈preamble,instr_list〉 ≝ pseudo_program in
1105  let result ≝
1106   foldl
1107    (Σt:((BitVectorTrie Word 16) × (nat × (BitVectorTrie Word 16))).
1108          ∃instr_list_prefix. is_prefix ? instr_list_prefix instr_list ∧
1109           tech_pc_sigma0 〈preamble,instr_list_prefix〉 = Some ? (\fst (\snd t)))
1110    (Σi:option Identifier × pseudo_instruction. ∀instr_list_prefix.
1111          let instr_list_prefix' ≝ instr_list_prefix @ [i] in
1112           is_prefix ? instr_list_prefix' instr_list →
1113           tech_pc_sigma0 〈preamble,instr_list_prefix'〉 ≠ None ?)
1114    (λt: Σt:((BitVectorTrie Word 16) × (nat × (BitVectorTrie Word 16))).
1115          ∃instr_list_prefix. is_prefix ? instr_list_prefix instr_list ∧
1116           tech_pc_sigma0 〈preamble,instr_list_prefix〉 = Some ? (\fst (\snd t)).
1117     λi: Σi:option Identifier × pseudo_instruction. ∀instr_list_prefix.
1118          let instr_list_prefix' ≝ instr_list_prefix @ [i] in
1119           is_prefix ? instr_list_prefix' instr_list →
1120           tech_pc_sigma0 〈preamble,instr_list_prefix'〉 ≠ None ? .
1121      let 〈labels, pc_costs〉 ≝ t in
1122      let 〈program_counter, costs〉 ≝ pc_costs in
1123       let 〈label, i'〉 ≝ i in
1124       let labels ≝
1125         match label with
1126         [ None ⇒ labels
1127         | Some label ⇒
1128           let program_counter_bv ≝ bitvector_of_nat ? program_counter in
1129             insert ? ? label program_counter_bv labels
1130         ]
1131       in
1132         match construct_costs pseudo_program program_counter (λx. zero ?) (λx. zero ?) costs i' with
1133         [ None ⇒
1134            let dummy ≝ 〈labels,pc_costs〉 in
1135              dummy
1136         | Some construct ⇒ 〈labels, construct〉
1137         ]
1138    ) 〈(Stub ? ?), 〈0, (Stub ? ?)〉〉 ?(*instr_list*)
1139  in
1140   let 〈labels, pc_costs〉 ≝ result in
1141   let 〈pc, costs〉 ≝ pc_costs in
1142    〈labels, costs〉.
1143 [4: @(list_elim_rev ?
1144       (λinstr_list. list (
1145        (Σi:option Identifier × pseudo_instruction. ∀instr_list_prefix.
1146          let instr_list_prefix' ≝ instr_list_prefix @ [i] in
1147           is_prefix ? instr_list_prefix' instr_list →
1148           tech_pc_sigma0 〈preamble,instr_list_prefix'〉 ≠ None ?)))
1149       ?? instr_list) (* CSC: BAD ORDER FOR CODE EXTRACTION *)
1150      [ @[ ]
1151      | #l' #a #limage %2
1152        [ %[@a] #PREFIX #PREFIX_OK
1153        | (* CSC: EVEN WORST CODE FOR EXTRACTION: WE SHOULD STRENGTHEN
1154             THE INDUCTION HYPOTHESIS INSTEAD *)
1155          elim limage
1156           [ %1
1157           | #HD #TL #IH @(?::IH) cases HD #ELEM #K1 %[@ELEM] #K2 #K3
1158             @K1 @(prefix_of_append ???? K3)
1159           ] 
1160        ]
1161       
1162       
1163     
1164 
1165  cases t in c2 ⊢ % #t' * #LIST_PREFIX * #H1t' #H2t' #HJMt'
1166     % [@ (LIST_PREFIX @ [i])] %
1167      [ cases (sig2 … i LIST_PREFIX) #K1 #K2 @K1
1168      | (* DOABLE IN PRINCIPLE *)
1169      ]
1170 | (* assert false case *)
1171 |3: % [@ ([ ])] % [2: % | (* DOABLE *)]
1172 |   
1173
1174let rec encoding_check (code_memory: BitVectorTrie Byte 16) (pc: Word) (final_pc: Word)
1175                       (encoding: list Byte) on encoding: Prop ≝
1176  match encoding with
1177  [ nil ⇒ final_pc = pc
1178  | cons hd tl ⇒
1179    let 〈new_pc, byte〉 ≝ next code_memory pc in
1180      hd = byte ∧ encoding_check code_memory new_pc final_pc tl
1181  ].
1182
1183definition assembly_specification:
1184  ∀assembly_program: pseudo_assembly_program.
1185  ∀code_mem: BitVectorTrie Byte 16. Prop ≝
1186  λpseudo_assembly_program.
1187  λcode_mem.
1188    ∀pc: Word.
1189      let 〈preamble, instr_list〉 ≝ pseudo_assembly_program in
1190      let 〈pre_instr, pre_new_pc〉 ≝ fetch_pseudo_instruction instr_list pc in
1191      let labels ≝ λx. sigma' pseudo_assembly_program (address_of_word_labels_code_mem instr_list x) in
1192      let datalabels ≝ λx. sigma' pseudo_assembly_program (lookup ? ? x (construct_datalabels preamble) (zero ?)) in
1193      let pre_assembled ≝ assembly_1_pseudoinstruction pseudo_assembly_program
1194       (sigma' pseudo_assembly_program pc) labels datalabels pre_instr in
1195      match pre_assembled with
1196       [ None ⇒ True
1197       | Some pc_code ⇒
1198          let 〈new_pc,code〉 ≝ pc_code in
1199           encoding_check code_mem pc (sigma' pseudo_assembly_program pre_new_pc) code ].
1200
1201axiom assembly_meets_specification:
1202  ∀pseudo_assembly_program.
1203    match assembly pseudo_assembly_program with
1204    [ None ⇒ True
1205    | Some code_mem_cost ⇒
1206      let 〈code_mem, cost〉 ≝ code_mem_cost in
1207        assembly_specification pseudo_assembly_program (load_code_memory code_mem)
1208    ].
1209(*
1210  # PROGRAM
1211  [ cases PROGRAM
1212    # PREAMBLE
1213    # INSTR_LIST
1214    elim INSTR_LIST
1215    [ whd
1216      whd in ⊢ (∀_. %)
1217      # PC
1218      whd
1219    | # INSTR
1220      # INSTR_LIST_TL
1221      # H
1222      whd
1223      whd in ⊢ (match % with [ _ ⇒ ? | _ ⇒ ?])
1224    ]
1225  | cases not_implemented
1226  ] *)
1227
1228definition status_of_pseudo_status: PseudoStatus → option Status ≝
1229 λps.
1230  let pap ≝ code_memory … ps in
1231   match assembly pap with
1232    [ None ⇒ None …
1233    | Some p ⇒
1234       let cm ≝ load_code_memory (\fst p) in
1235       let pc ≝ sigma' pap (program_counter ? ps) in
1236        Some …
1237         (mk_PreStatus (BitVectorTrie Byte 16)
1238           cm
1239           (low_internal_ram … ps)
1240           (high_internal_ram … ps)
1241           (external_ram … ps)
1242           pc
1243           (special_function_registers_8051 … ps)
1244           (special_function_registers_8052 … ps)
1245           (p1_latch … ps)
1246           (p3_latch … ps)
1247           (clock … ps)) ].
1248
1249definition write_at_stack_pointer':
1250 ∀M. ∀ps: PreStatus M. Byte → Σps':PreStatus M.(code_memory … ps = code_memory … ps') ≝
1251  λM: Type[0].
1252  λs: PreStatus M.
1253  λv: Byte.
1254    let 〈 nu, nl 〉 ≝ split … 4 4 (get_8051_sfr ? s SFR_SP) in
1255    let bit_zero ≝ get_index_v… nu O ? in
1256    let bit_1 ≝ get_index_v… nu 1 ? in
1257    let bit_2 ≝ get_index_v… nu 2 ? in
1258    let bit_3 ≝ get_index_v… nu 3 ? in
1259      if bit_zero then
1260        let memory ≝ insert … ([[ bit_1 ; bit_2 ; bit_3 ]] @@ nl)
1261                              v (low_internal_ram ? s) in
1262          set_low_internal_ram ? s memory
1263      else
1264        let memory ≝ insert … ([[ bit_1 ; bit_2 ; bit_3 ]] @@ nl)
1265                              v (high_internal_ram ? s) in
1266          set_high_internal_ram ? s memory.
1267  [ cases l0 %
1268  |2,3,4,5: normalize repeat (@ le_S_S) @ le_O_n ]
1269qed.
1270
1271definition execute_1_pseudo_instruction': (Word → nat) → ∀ps:PseudoStatus.
1272 Σps':PseudoStatus.(code_memory … ps = code_memory … ps')
1273
1274  λticks_of.
1275  λs.
1276  let 〈instr, pc〉 ≝ fetch_pseudo_instruction (\snd (code_memory ? s)) (program_counter ? s) in
1277  let ticks ≝ ticks_of (program_counter ? s) in
1278  let s ≝ set_clock ? s (clock ? s + ticks) in
1279  let s ≝ set_program_counter ? s pc in
1280    match instr with
1281    [ Instruction instr ⇒
1282       execute_1_preinstruction … (λx, y. address_of_word_labels y x) instr s
1283    | Comment cmt ⇒ s
1284    | Cost cst ⇒ s
1285    | Jmp jmp ⇒ set_program_counter ? s (address_of_word_labels s jmp)
1286    | Call call ⇒
1287      let a ≝ address_of_word_labels s call in
1288      let 〈carry, new_sp〉 ≝ half_add ? (get_8051_sfr ? s SFR_SP) (bitvector_of_nat 8 1) in
1289      let s ≝ set_8051_sfr ? s SFR_SP new_sp in
1290      let 〈pc_bu, pc_bl〉 ≝ split ? 8 8 (program_counter ? s) in
1291      let s ≝ write_at_stack_pointer' ? s pc_bl in
1292      let 〈carry, new_sp〉 ≝ half_add ? (get_8051_sfr ? s SFR_SP) (bitvector_of_nat 8 1) in
1293      let s ≝ set_8051_sfr ? s SFR_SP new_sp in
1294      let s ≝ write_at_stack_pointer' ? s pc_bu in
1295        set_program_counter ? s a
1296    | Mov dptr ident ⇒
1297       set_arg_16 ? s (get_arg_16 ? s (DATA16 (address_of_word_labels s ident))) dptr
1298    ].
1299 [
1300 |2,3,4: %
1301 | <(sig2 … l7) whd in ⊢ (??? (??%)) <(sig2 … l5) %
1302 |
1303 | %
1304 ]
1305 cases not_implemented
1306qed.
1307
1308(*
1309lemma execute_code_memory_unchanged:
1310 ∀ticks_of,ps. code_memory ? ps = code_memory ? (execute_1_pseudo_instruction ticks_of ps).
1311 #ticks #ps whd in ⊢ (??? (??%))
1312 cases (fetch_pseudo_instruction (\snd (code_memory pseudo_assembly_program ps))
1313  (program_counter pseudo_assembly_program ps)) #instr #pc
1314 whd in ⊢ (??? (??%)) cases instr
1315  [ #pre cases pre
1316     [ #a1 #a2 whd in ⊢ (??? (??%)) cases (add_8_with_carry ???) #y1 #y2 whd in ⊢ (??? (??%))
1317       cases (split ????) #z1 #z2 %
1318     | #a1 #a2 whd in ⊢ (??? (??%)) cases (add_8_with_carry ???) #y1 #y2 whd in ⊢ (??? (??%))
1319       cases (split ????) #z1 #z2 %
1320     | #a1 #a2 whd in ⊢ (??? (??%)) cases (sub_8_with_carry ???) #y1 #y2 whd in ⊢ (??? (??%))
1321       cases (split ????) #z1 #z2 %
1322     | #a1 whd in ⊢ (??? (??%)) cases a1 #x #H whd in ⊢ (??? (??%)) cases x
1323       [ #x1 whd in ⊢ (??? (??%))
1324     | *: cases not_implemented
1325     ]
1326  | #comment %
1327  | #cost %
1328  | #label %
1329  | #label whd in ⊢ (??? (??%)) cases (half_add ???) #x1 #x2 whd in ⊢ (??? (??%))
1330    cases (split ????) #y1 #y2 whd in ⊢ (??? (??%)) cases (half_add ???) #z1 #z2
1331    whd in ⊢ (??? (??%)) whd in ⊢ (??? (??%)) cases (split ????) #w1 #w2
1332    whd in ⊢ (??? (??%)) cases (get_index_v bool ????) whd in ⊢ (??? (??%))
1333    (* CSC: ??? *)
1334  | #dptr #label (* CSC: ??? *)
1335  ]
1336  cases not_implemented
1337qed.
1338*)
1339
1340lemma status_of_pseudo_status_failure_depends_only_on_code_memory:
1341 ∀ps,ps': PseudoStatus.
1342  code_memory … ps = code_memory … ps' →
1343   match status_of_pseudo_status ps with
1344    [ None ⇒ status_of_pseudo_status ps' = None …
1345    | Some _ ⇒ ∃w. status_of_pseudo_status ps' = Some … w
1346    ].
1347 #ps #ps' #H whd in ⊢ (mat
1348 ch % with [ _ ⇒ ? | _ ⇒ ? ])
1349 generalize in match (refl … (assembly (code_memory … ps)))
1350 cases (assembly ?) in ⊢ (???% → %)
1351  [ #K whd whd in ⊢ (??%?) <H >K %
1352  | #x #K whd whd in ⊢ (?? (λ_.??%?)) <H >K % [2: % ] ]
1353qed.*)
1354
1355let rec encoding_check' (code_memory: BitVectorTrie Byte 16) (pc: Word) (encoding: list Byte) on encoding: Prop ≝
1356  match encoding with
1357  [ nil ⇒ True
1358  | cons hd tl ⇒
1359    let 〈new_pc, byte〉 ≝ next code_memory pc in
1360      hd = byte ∧ encoding_check' code_memory new_pc tl
1361  ].
1362
1363(* prove later *)
1364axiom test:
1365  ∀pc: Word.
1366  ∀code_memory: BitVectorTrie Byte 16.
1367  ∀i: instruction.
1368    let assembled ≝ assembly1 i in
1369      encoding_check' code_memory pc assembled →
1370        let 〈instr_pc, ignore〉 ≝ fetch code_memory pc in
1371        let 〈instr, pc〉 ≝ instr_pc in
1372          instr = i.
1373 
1374lemma main_thm:
1375 ∀ticks_of.
1376 ∀ps: PseudoStatus.
1377  match status_of_pseudo_status ps with [ None ⇒ True | Some s ⇒
1378  let ps' ≝ execute_1_pseudo_instruction ticks_of ps in
1379  match status_of_pseudo_status ps' with [ None ⇒ True | Some s'' ⇒
1380  let s' ≝ execute_1 s in
1381   s = s'']].
1382 #ticks_of #ps
1383 whd in ⊢ (match % with [ _ ⇒ ? | _ ⇒ ? ])
1384 cases (assembly (code_memory pseudo_assembly_program ps)) [%] * #cm #costs whd
1385 whd in ⊢ (match % with [ _ ⇒ ? | _ ⇒ ? ])
1386 generalize in match (sig2 … (execute_1_pseudo_instruction' ticks_of ps))
1387 
1388 cases (status_of_pseudo_status (execute_1_pseudo_instruction ticks_of ps)) [%] #s'' whd
Note: See TracBrowser for help on using the repository browser.