source: src/ASM/AssemblyProof.ma @ 975

Last change on this file since 975 was 975, checked in by sacerdot, 8 years ago

...

File size: 104.9 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
51
52definition bit_elim_prop: ∀P: bool → Prop. Prop ≝
53  λP.
54    P true ∧ P false.
55 
56let rec bitvector_elim_prop_internal
57  (n: nat) (P: BitVector n → Prop) (m: nat) on m: m ≤ n → BitVector (n - m) → Prop ≝
58  match m return λm. m ≤ n → BitVector (n - m) → Prop with
59  [ O    ⇒ λprf1. λprefix. P ?
60  | S n' ⇒ λprf2. λprefix. bit_elim_prop (λbit. bitvector_elim_prop_internal n P n' ? ?)
61  ].
62  [ applyS prefix
63  | letin res ≝ (bit ::: prefix)
64    < (minus_S_S ? ?)
65    > (minus_Sn_m ? ?)
66  [ @ res
67  | @ prf2
68  ]
69  | /2/
70  ].
71qed.
72
73definition bitvector_elim_prop ≝
74  λn: nat.
75  λP: BitVector n → Prop.
76    bitvector_elim_prop_internal n P n ? ?.
77  [ @ (le_n ?)
78  | < (minus_n_n ?)
79    @ [[ ]]
80  ]
81qed.
82
83lemma eq_b_eq:
84  ∀b, c.
85    eq_b b c = true → b = c.
86  #b #c
87  cases b
88  cases c
89  normalize //
90qed.
91
92lemma BitVector_O: ∀v:BitVector 0. v ≃ VEmpty bool.
93 #v generalize in match (refl … 0) cases v in ⊢ (??%? → ?%%??) //
94 #n #hd #tl #abs @⊥ //
95qed.
96
97lemma BitVector_Sn: ∀n.∀v:BitVector (S n).
98 ∃hd.∃tl.v ≃ VCons bool n hd tl.
99 #n #v generalize in match (refl … (S n)) cases v in ⊢ (??%? → ??(λ_.??(λ_.?%%??)))
100 [ #abs @⊥ //
101 | #m #hd #tl #EQ <(injective_S … EQ) %[@hd] %[@tl] // ]
102qed.
103
104lemma eq_bv_eq:
105  ∀n, v, q.
106    eq_bv n v q = true → v = q.
107  #n #v #q generalize in match v
108  elim q
109  [ #v #h @BitVector_O
110  | #n #hd #tl #ih #v' #h
111    cases (BitVector_Sn ? v')
112    #hd' * #tl' #jmeq >jmeq in h;
113    #new_h
114    change in new_h with ((andb ? ?) = ?);
115    cases(conjunction_true … new_h)
116    #eq_heads #eq_tails
117    whd in eq_heads:(??(??(%))?);
118    cases(eq_b_eq … eq_heads)
119    whd in eq_tails:(??(?????(%))?);
120    change in eq_tails with (eq_bv ??? = ?);
121    <(ih tl') //
122  ]
123qed.
124
125lemma bool_eq_internal_eq:
126  ∀b, c.
127    (λb. λc. (if b then c else (if c then false else true))) b c = true → b = c.
128  #b #c
129  cases b
130  [ normalize //
131  | normalize
132    cases c
133    [ normalize //
134    | normalize //
135    ]
136  ]
137qed.
138
139lemma eq_bv_refl:
140  ∀n,v. eq_bv n v v = true.
141  #n #v
142  elim v
143  [ //
144  | #n #hd #tl #ih
145    normalize
146    cases hd
147    [ normalize
148      @ ih
149    | normalize
150      @ ih
151    ]
152  ]
153qed.
154
155lemma eq_eq_bv:
156  ∀n, v, q.
157    v = q → eq_bv n v q = true.
158  #n #v
159  elim v
160  [ #q #h <h normalize %
161  | #n #hd #tl #ih #q #h >h //
162  ]
163qed.
164
165let rec foldl_strong_internal
166  (A: Type[0]) (P: list A → Type[0]) (l: list A)
167  (H: ∀prefix. ∀hd. ∀tl. l = prefix @ [hd] @ tl → P prefix → P (prefix @ [hd]))
168  (prefix: list A) (suffix: list A) (acc: P prefix) on suffix:
169    l = prefix @ suffix → P(prefix @ suffix) ≝
170  match suffix return λl'. l = prefix @ l' → P (prefix @ l') with
171  [ nil ⇒ λprf. ?
172  | cons hd tl ⇒ λprf. ?
173  ].
174  [ > (append_nil ?)
175    @ acc
176  | applyS (foldl_strong_internal A P l H (prefix @ [hd]) tl ? ?)
177    [ @ (H prefix hd tl prf acc)
178    | applyS prf
179    ]
180  ]
181qed.
182
183definition foldl_strong ≝
184  λA: Type[0].
185  λP: list A → Type[0].
186  λl: list A.
187  λH: ∀prefix. ∀hd. ∀tl. l = prefix @ [hd] @ tl → P prefix → P (prefix @ [hd]).
188  λacc: P [ ].
189    foldl_strong_internal A P l H [ ] l acc (refl …).
190
191definition bit_elim: ∀P: bool → bool. bool ≝
192  λP.
193    P true ∧ P false.
194
195let rec bitvector_elim_internal
196  (n: nat) (P: BitVector n → bool) (m: nat) on m: m ≤ n → BitVector (n - m) → bool ≝
197  match m return λm. m ≤ n → BitVector (n - m) → bool with
198  [ O    ⇒ λprf1. λprefix. P ?
199  | S n' ⇒ λprf2. λprefix. bit_elim (λbit. bitvector_elim_internal n P n' ? ?)
200  ].
201  [ applyS prefix
202  | letin res ≝ (bit ::: prefix)
203    < (minus_S_S ? ?)
204    > (minus_Sn_m ? ?)
205    [ @ res
206    | @ prf2
207    ]
208  | /2/
209  ].
210qed.
211
212definition bitvector_elim ≝
213  λn: nat.
214  λP: BitVector n → bool.
215    bitvector_elim_internal n P n ? ?.
216  [ @ (le_n ?)
217  | < (minus_n_n ?)
218    @ [[ ]]
219  ]
220qed.
221
222axiom vector_associative_append:
223  ∀A: Type[0].
224  ∀n, m, o:  nat.
225  ∀v: Vector A n.
226  ∀q: Vector A m.
227  ∀r: Vector A o.
228    ((v @@ q) @@ r)
229    ≃
230    (v @@ (q @@ r)).
231       
232lemma vector_cons_append:
233  ∀A: Type[0].
234  ∀n: nat.
235  ∀e: A.
236  ∀v: Vector A n.
237    e ::: v = [[ e ]] @@ v.
238  # A # N # E # V
239  elim V
240  [ normalize %
241  | # NN # AA # VV # IH
242    normalize
243    %
244  ]
245qed.
246
247lemma super_rewrite2:
248 ∀A:Type[0].∀n,m.∀v1: Vector A n.∀v2: Vector A m.
249  ∀P: ∀m. Vector A m → Prop.
250   n=m → v1 ≃ v2 → P n v1 → P m v2.
251 #A #n #m #v1 #v2 #P #EQ <EQ in v2; #V #JMEQ >JMEQ //
252qed.
253
254lemma mem_middle_vector:
255  ∀A: Type[0].
256  ∀m, o: nat.
257  ∀eq: A → A → bool.
258  ∀reflex: ∀a. eq a a = true.
259  ∀p: Vector A m.
260  ∀a: A.
261  ∀r: Vector A o.
262    mem A eq ? (p@@(a:::r)) a = true.
263  # A # M # O # EQ # REFLEX # P # A
264  elim P
265  [ normalize
266    > (REFLEX A)
267    normalize
268    # H
269    %
270  | # NN # AA # PP # IH
271    normalize
272    cases (EQ A AA) //
273     @ IH
274  ]
275qed.
276
277lemma mem_monotonic_wrt_append:
278  ∀A: Type[0].
279  ∀m, o: nat.
280  ∀eq: A → A → bool.
281  ∀reflex: ∀a. eq a a = true.
282  ∀p: Vector A m.
283  ∀a: A.
284  ∀r: Vector A o.
285    mem A eq ? r a = true → mem A eq ? (p @@ r) a = true.
286  # A # M # O # EQ # REFLEX # P # A
287  elim P
288  [ #R #H @H
289  | #NN #AA # PP # IH #R #H
290    normalize
291    cases (EQ A AA)
292    [ normalize %
293    | @ IH @ H
294    ]
295  ]
296qed.
297
298lemma subvector_multiple_append:
299  ∀A: Type[0].
300  ∀o, n: nat.
301  ∀eq: A → A → bool.
302  ∀refl: ∀a. eq a a = true.
303  ∀h: Vector A o.
304  ∀v: Vector A n.
305  ∀m: nat.
306  ∀q: Vector A m.
307    bool_to_Prop (subvector_with A ? ? eq v (h @@ q @@ v)).
308  # A # O # N # EQ # REFLEX # H # V
309  elim V
310  [ normalize
311    # M # V %
312  | # NN # AA # VV # IH # MM # QQ
313    change with (bool_to_Prop (andb ??))
314    cut ((mem A EQ (O + (MM + S NN)) (H@@QQ@@AA:::VV) AA) = true)
315    [
316    | # HH > HH
317      > (vector_cons_append ? ? AA VV)
318      change with (bool_to_Prop (subvector_with ??????))
319      @(super_rewrite2 A ((MM + 1)+ NN) (MM+S NN) ??
320        (λSS.λVS.bool_to_Prop (subvector_with ?? (O+SS) ?? (H@@VS)))
321        ?
322        (vector_associative_append A ? ? ? QQ [[AA]] VV))
323      [ >associative_plus //
324      | @IH ]
325    ]
326    @(mem_monotonic_wrt_append)
327    [ @ REFLEX
328    | @(mem_monotonic_wrt_append)
329      [ @ REFLEX
330      | normalize
331        > REFLEX
332        normalize
333        %
334      ]
335    ]
336qed.
337
338lemma vector_cons_empty:
339  ∀A: Type[0].
340  ∀n: nat.
341  ∀v: Vector A n.
342    [[ ]] @@ v = v.
343  # A # N # V
344  elim V
345  [ normalize %
346  | # NN # HH # VV #H %
347  ]
348qed.
349
350corollary subvector_hd_tl:
351  ∀A: Type[0].
352  ∀o: nat.
353  ∀eq: A → A → bool.
354  ∀refl: ∀a. eq a a = true.
355  ∀h: A.
356  ∀v: Vector A o.
357    bool_to_Prop (subvector_with A ? ? eq v (h ::: v)).
358  # A # O # EQ # REFLEX # H # V
359  > (vector_cons_append A ? H V)
360  < (vector_cons_empty A ? ([[H]] @@ V))
361  @ (subvector_multiple_append A ? ? EQ REFLEX [[]] V ? [[ H ]])
362qed.
363
364lemma eq_a_reflexive:
365  ∀a. eq_a a a = true.
366  # A
367  cases A
368  %
369qed.
370
371lemma is_in_monotonic_wrt_append:
372  ∀m, n: nat.
373  ∀p: Vector addressing_mode_tag m.
374  ∀q: Vector addressing_mode_tag n.
375  ∀to_search: addressing_mode.
376    bool_to_Prop (is_in ? p to_search) → bool_to_Prop (is_in ? (q @@ p) to_search).
377  # M # N # P # Q # TO_SEARCH
378  # H
379  elim Q
380  [ normalize
381    @ H
382  | # NN # PP # QQ # IH
383    normalize
384    cases (is_a PP TO_SEARCH)
385    [ normalize
386      %
387    | normalize
388      normalize in IH
389      @ IH
390    ]
391  ]
392qed.
393
394corollary is_in_hd_tl:
395  ∀to_search: addressing_mode.
396  ∀hd: addressing_mode_tag.
397  ∀n: nat.
398  ∀v: Vector addressing_mode_tag n.
399    bool_to_Prop (is_in ? v to_search) → bool_to_Prop (is_in ? (hd:::v) to_search).
400  # TO_SEARCH # HD # N # V
401  elim V
402  [ # H
403    normalize in H;
404    cases H
405  | # NN # HHD # VV # IH # HH
406    > vector_cons_append
407    > (vector_cons_append ? ? HHD VV)
408    @ (is_in_monotonic_wrt_append ? 1 ([[HHD]]@@VV) [[HD]] TO_SEARCH)
409    @ HH
410  ]
411qed.
412 
413let rec list_addressing_mode_tags_elim
414  (n: nat) (l: Vector addressing_mode_tag (S n)) on l: (l → bool) → bool ≝
415  match l return λx.match x with [O ⇒ λl: Vector … O. bool | S x' ⇒ λl: Vector addressing_mode_tag (S x').
416   (l → bool) → bool ] with
417  [ VEmpty      ⇒  true 
418  | VCons len hd tl ⇒ λP.
419    let process_hd ≝
420      match hd return λhd. ∀P: hd:::tl → bool. bool with
421      [ direct ⇒ λP.bitvector_elim 8 (λx. P (DIRECT x))
422      | indirect ⇒ λP.bit_elim (λx. P (INDIRECT x))
423      | ext_indirect ⇒ λP.bit_elim (λx. P (EXT_INDIRECT x))
424      | registr ⇒ λP.bitvector_elim 3 (λx. P (REGISTER x))
425      | acc_a ⇒ λP.P ACC_A
426      | acc_b ⇒ λP.P ACC_B
427      | dptr ⇒ λP.P DPTR
428      | data ⇒ λP.bitvector_elim 8 (λx. P (DATA x))
429      | data16 ⇒ λP.bitvector_elim 16 (λx. P (DATA16 x))
430      | acc_dptr ⇒ λP.P ACC_DPTR
431      | acc_pc ⇒ λP.P ACC_PC
432      | ext_indirect_dptr ⇒ λP.P EXT_INDIRECT_DPTR
433      | indirect_dptr ⇒ λP.P INDIRECT_DPTR
434      | carry ⇒ λP.P CARRY
435      | bit_addr ⇒ λP.bitvector_elim 8 (λx. P (BIT_ADDR x))
436      | n_bit_addr ⇒ λP.bitvector_elim 8 (λx. P (N_BIT_ADDR x))
437      | relative ⇒ λP.bitvector_elim 8 (λx. P (RELATIVE x))
438      | addr11 ⇒ λP.bitvector_elim 11 (λx. P (ADDR11 x))
439      | addr16 ⇒ λP.bitvector_elim 16 (λx. P (ADDR16 x))
440      ]
441    in
442      andb (process_hd P)
443       (match len return λx. x = len → bool with
444         [ O ⇒ λprf. true
445         | S y ⇒ λprf. list_addressing_mode_tags_elim y ? P ] (refl ? len))
446  ].
447  try %
448  [ 2: cases (sym_eq ??? prf); @tl
449  | generalize in match H; generalize in match tl; cases prf;
450    (* cases prf in tl H; : ??? WAS WORKING BEFORE *)
451    #tl
452    normalize in ⊢ (∀_: %. ?)
453    # H
454    whd
455    normalize in ⊢ (match % with [ _ ⇒ ? | _ ⇒ ?])
456    cases (is_a hd (subaddressing_modeel y tl H)) whd // ]
457qed.
458
459definition product_elim ≝
460  λm, n: nat.
461  λv: Vector addressing_mode_tag (S m).
462  λq: Vector addressing_mode_tag (S n).
463  λP: (v × q) → bool.
464    list_addressing_mode_tags_elim ? v (λx. list_addressing_mode_tags_elim ? q (λy. P 〈x, y〉)).
465
466definition union_elim ≝
467  λA, B: Type[0].
468  λelimA: (A → bool) → bool.
469  λelimB: (B → bool) → bool.
470  λelimU: A ⊎ B → bool.
471    elimA (λa. elimB (λb. elimU (inl ? ? a) ∧ elimU (inr ? ? b))).
472
473(*                           
474definition preinstruction_elim: ∀P: preinstruction [[ relative ]] → bool. bool ≝
475  λP.
476    list_addressing_mode_tags_elim ? [[ registr ; direct ; indirect ; data ]] (λaddr. P (ADD ? ACC_A addr)) ∧
477    list_addressing_mode_tags_elim ? [[ registr ; direct ; indirect ; data ]] (λaddr. P (ADDC ? ACC_A addr)) ∧
478    list_addressing_mode_tags_elim ? [[ registr ; direct ; indirect ; data ]] (λaddr. P (SUBB ? ACC_A addr)) ∧
479    list_addressing_mode_tags_elim ? [[ acc_a ; registr ; direct ; indirect ; dptr ]] (λaddr. P (INC ? addr)) ∧
480    list_addressing_mode_tags_elim ? [[ acc_a ; registr ; direct ; indirect ]] (λaddr. P (DEC ? addr)) ∧
481    list_addressing_mode_tags_elim ? [[acc_b]] (λaddr. P (MUL ? ACC_A addr)) ∧
482    list_addressing_mode_tags_elim ? [[acc_b]] (λaddr. P (DIV ? ACC_A addr)) ∧
483    list_addressing_mode_tags_elim ? [[ registr ; direct ]] (λaddr. bitvector_elim 8 (λr. P (DJNZ ? addr (RELATIVE r)))) ∧
484    list_addressing_mode_tags_elim ? [[ acc_a ; carry ; bit_addr ]] (λaddr. P (CLR ? addr)) ∧
485    list_addressing_mode_tags_elim ? [[ acc_a ; carry ; bit_addr ]] (λaddr. P (CPL ? addr)) ∧
486    P (DA ? ACC_A) ∧
487    bitvector_elim 8 (λr. P (JC ? (RELATIVE r))) ∧
488    bitvector_elim 8 (λr. P (JNC ? (RELATIVE r))) ∧
489    bitvector_elim 8 (λr. P (JZ ? (RELATIVE r))) ∧
490    bitvector_elim 8 (λr. P (JNZ ? (RELATIVE r))) ∧
491    bitvector_elim 8 (λr. (bitvector_elim 8 (λb: BitVector 8. P (JB ? (BIT_ADDR b) (RELATIVE r))))) ∧
492    bitvector_elim 8 (λr. (bitvector_elim 8 (λb: BitVector 8. P (JNB ? (BIT_ADDR b) (RELATIVE r))))) ∧
493    bitvector_elim 8 (λr. (bitvector_elim 8 (λb: BitVector 8. P (JBC ? (BIT_ADDR b) (RELATIVE r))))) ∧
494    list_addressing_mode_tags_elim ? [[ registr; direct ]] (λaddr. bitvector_elim 8 (λr. P (DJNZ ? addr (RELATIVE r)))) ∧
495    P (RL ? ACC_A) ∧
496    P (RLC ? ACC_A) ∧
497    P (RR ? ACC_A) ∧
498    P (RRC ? ACC_A) ∧
499    P (SWAP ? ACC_A) ∧
500    P (RET ?) ∧
501    P (RETI ?) ∧
502    P (NOP ?) ∧
503    bit_elim (λb. P (XCHD ? ACC_A (INDIRECT b))) ∧
504    list_addressing_mode_tags_elim ? [[ carry; bit_addr ]] (λaddr. P (SETB ? addr)) ∧
505    bitvector_elim 8 (λaddr. P (PUSH ? (DIRECT addr))) ∧
506    bitvector_elim 8 (λaddr. P (POP ? (DIRECT addr))) ∧
507    union_elim ? ? (product_elim ? ? [[ acc_a ]] [[ direct; data ]])
508                   (product_elim ? ? [[ registr; indirect ]] [[ data ]])
509                   (λd. bitvector_elim 8 (λb. P (CJNE ? d (RELATIVE b)))) ∧
510    list_addressing_mode_tags_elim ? [[ registr; direct; indirect ]] (λaddr. P (XCH ? ACC_A addr)) ∧
511    union_elim ? ? (product_elim ? ? [[acc_a]] [[ data ; registr ; direct ; indirect ]])
512                   (product_elim ? ? [[direct]] [[ acc_a ; data ]])
513                   (λd. P (XRL ? d)) ∧
514    union_elim ? ? (union_elim ? ? (product_elim ? ? [[acc_a]] [[ registr ; direct ; indirect ; data ]])
515                                   (product_elim ? ? [[direct]] [[ acc_a ; data ]]))
516                   (product_elim ? ? [[carry]] [[ bit_addr ; n_bit_addr]])
517                   (λd. P (ANL ? d)) ∧
518    union_elim ? ? (union_elim ? ? (product_elim ? ? [[acc_a]] [[ registr ; data ; direct ; indirect ]])
519                                   (product_elim ? ? [[direct]] [[ acc_a ; data ]]))
520                   (product_elim ? ? [[carry]] [[ bit_addr ; n_bit_addr]])
521                   (λd. P (ORL ? d)) ∧
522    union_elim ? ? (product_elim ? ? [[acc_a]] [[ ext_indirect ; ext_indirect_dptr ]])
523                   (product_elim ? ? [[ ext_indirect ; ext_indirect_dptr ]] [[acc_a]])
524                   (λd. P (MOVX ? d)) ∧
525    union_elim ? ? (
526      union_elim ? ? (
527        union_elim ? ? (
528          union_elim ? ? (
529            union_elim ? ?  (product_elim ? ? [[acc_a]] [[ registr ; direct ; indirect ; data ]])
530                            (product_elim ? ? [[ registr ; indirect ]] [[ acc_a ; direct ; data ]]))
531                            (product_elim ? ? [[direct]] [[ acc_a ; registr ; direct ; indirect ; data ]]))
532                            (product_elim ? ? [[dptr]] [[data16]]))
533                            (product_elim ? ? [[carry]] [[bit_addr]]))
534                            (product_elim ? ? [[bit_addr]] [[carry]])
535                            (λd. P (MOV ? d)).
536  %
537qed.
538 
539definition instruction_elim: ∀P: instruction → bool. bool ≝
540  λP. (*
541    bitvector_elim 11 (λx. P (ACALL (ADDR11 x))) ∧
542    bitvector_elim 16 (λx. P (LCALL (ADDR16 x))) ∧
543    bitvector_elim 11 (λx. P (AJMP (ADDR11 x))) ∧
544    bitvector_elim 16 (λx. P (LJMP (ADDR16 x))) ∧ *)
545    bitvector_elim 8 (λx. P (SJMP (RELATIVE x))). (*  ∧
546    P (JMP INDIRECT_DPTR) ∧
547    list_addressing_mode_tags_elim ? [[ acc_dptr; acc_pc ]] (λa. P (MOVC ACC_A a)) ∧
548    preinstruction_elim (λp. P (RealInstruction p)). *)
549  %
550qed.
551
552
553axiom instruction_elim_complete:
554 ∀P. instruction_elim P = true → ∀i. P i = true.
555*)
556(*definition eq_instruction ≝
557  λi, j: instruction.
558    true.*)
559axiom eq_instruction: instruction → instruction → bool.
560axiom eq_instruction_refl: ∀i. eq_instruction i i = true.
561
562let rec vect_member
563  (A: Type[0]) (n: nat) (eq: A → A → bool)
564  (v: Vector A n) (a: A) on v: bool ≝
565  match v with
566  [ VEmpty          ⇒ false
567  | VCons len hd tl ⇒
568    eq hd a ∨ (vect_member A ? eq tl a)
569  ].
570
571let rec list_addressing_mode_tags_elim_prop
572  (n: nat)
573  (l: Vector addressing_mode_tag (S n))
574  on l:
575  ∀P: l → Prop.
576  ∀direct_a. ∀indirect_a. ∀ext_indirect_a. ∀register_a. ∀acc_a_a.
577  ∀acc_b_a. ∀dptr_a. ∀data_a. ∀data16_a. ∀acc_dptr_a. ∀acc_pc_a.
578  ∀ext_indirect_dptr_a. ∀indirect_dptr_a. ∀carry_a. ∀bit_addr_a.
579  ∀n_bit_addr_a. ∀relative_a. ∀addr11_a. ∀addr16_a.
580  ∀x: l. P x ≝
581  match l return
582    λy.
583      match y with
584      [ O    ⇒ λm: Vector addressing_mode_tag O. ∀prf: 0 = S n. True
585      | S y' ⇒ λl: Vector addressing_mode_tag (S y'). ∀prf: S y' = S n.∀P:l → Prop.
586               ∀direct_a: if vect_member … eq_a l direct then ∀x. P (DIRECT x) else True.
587               ∀indirect_a: if vect_member … eq_a l indirect then ∀x. P (INDIRECT x) else True.
588               ∀ext_indirect_a: if vect_member … eq_a l ext_indirect then ∀x. P (EXT_INDIRECT x) else True.
589               ∀register_a: if vect_member … eq_a l registr then ∀x. P (REGISTER x) else True.
590               ∀acc_a_a: if vect_member … eq_a l acc_a then P (ACC_A) else True.
591               ∀acc_b_a: if vect_member … eq_a l acc_b then P (ACC_B) else True.
592               ∀dptr_a: if vect_member … eq_a l dptr then P DPTR else True.
593               ∀data_a: if vect_member … eq_a l data then ∀x. P (DATA x) else True.
594               ∀data16_a: if vect_member … eq_a l data16 then ∀x. P (DATA16 x) else True.
595               ∀acc_dptr_a: if vect_member … eq_a l acc_dptr then P ACC_DPTR else True.
596               ∀acc_pc_a: if vect_member … eq_a l acc_pc then P ACC_PC else True.
597               ∀ext_indirect_dptr_a: if vect_member … eq_a l ext_indirect_dptr then P EXT_INDIRECT_DPTR else True.
598               ∀indirect_dptr_a: if vect_member … eq_a l indirect_dptr then P INDIRECT_DPTR else True.
599               ∀carry_a: if vect_member … eq_a l carry then P CARRY else True.
600               ∀bit_addr_a: if vect_member … eq_a l bit_addr then ∀x. P (BIT_ADDR x) else True.
601               ∀n_bit_addr_a: if vect_member … eq_a l n_bit_addr then ∀x. P (N_BIT_ADDR x) else True.
602               ∀relative_a: if vect_member … eq_a l relative then ∀x. P (RELATIVE x) else True.
603               ∀addr11_a: if vect_member … eq_a l addr11 then ∀x. P (ADDR11 x) else True.
604               ∀addr_16_a: if vect_member … eq_a l addr16 then ∀x. P (ADDR16 x) else True.
605               ∀x:l. P x
606      ] with
607  [ VEmpty          ⇒ λAbsurd. ⊥
608  | VCons len hd tl ⇒ λProof. ?
609  ] (refl ? (S n)). cases daemon. qed. (*
610  [ destruct(Absurd)
611  | # A1 # A2 # A3 # A4 # A5 # A6 # A7
612    # A8 # A9 # A10 # A11 # A12 # A13 # A14
613    # A15 # A16 # A17 # A18 # A19 # X
614    cases X
615    # SUB cases daemon ] qed.
616    cases SUB
617    [ # BYTE
618    normalize
619  ].
620 
621 
622(*    let prepare_hd ≝
623      match hd with
624      [ direct ⇒ λdirect_prf. ?
625      | indirect ⇒ λindirect_prf. ?
626      | ext_indirect ⇒ λext_indirect_prf. ?
627      | registr ⇒ λregistr_prf. ?
628      | acc_a ⇒ λacc_a_prf. ?
629      | acc_b ⇒ λacc_b_prf. ?
630      | dptr ⇒ λdptr_prf. ?
631      | data ⇒ λdata_prf. ?
632      | data16 ⇒ λdata16_prf. ?
633      | acc_dptr ⇒ λacc_dptr_prf. ?
634      | acc_pc ⇒ λacc_pc_prf. ?
635      | ext_indirect_dptr ⇒ λext_indirect_prf. ?
636      | indirect_dptr ⇒ λindirect_prf. ?
637      | carry ⇒ λcarry_prf. ?
638      | bit_addr ⇒ λbit_addr_prf. ?
639      | n_bit_addr ⇒ λn_bit_addr_prf. ?
640      | relative ⇒ λrelative_prf. ?
641      | addr11 ⇒ λaddr11_prf. ?
642      | addr16 ⇒ λaddr16_prf. ?
643      ]
644    in ? *)
645  ].
646  [ 1: destruct(absd)
647  | 2: # A1 # A2 # A3 # A4 # A5 # A6
648       # A7 # A8 # A9 # A10 # A11 # A12
649       # A13 # A14 # A15 # A16 # A17 # A18
650       # A19 *
651  ].
652
653
654  match l return λx.match x with [O ⇒ λl: Vector … O. bool | S x' ⇒ λl: Vector addressing_mode_tag (S x').
655   (l → bool) → bool ] with
656  [ VEmpty      ⇒  true 
657  | VCons len hd tl ⇒ λP.
658    let process_hd ≝
659      match hd return λhd. ∀P: hd:::tl → bool. bool with
660      [ direct ⇒ λP.bitvector_elim 8 (λx. P (DIRECT x))
661      | indirect ⇒ λP.bit_elim (λx. P (INDIRECT x))
662      | ext_indirect ⇒ λP.bit_elim (λx. P (EXT_INDIRECT x))
663      | registr ⇒ λP.bitvector_elim 3 (λx. P (REGISTER x))
664      | acc_a ⇒ λP.P ACC_A
665      | acc_b ⇒ λP.P ACC_B
666      | dptr ⇒ λP.P DPTR
667      | data ⇒ λP.bitvector_elim 8 (λx. P (DATA x))
668      | data16 ⇒ λP.bitvector_elim 16 (λx. P (DATA16 x))
669      | acc_dptr ⇒ λP.P ACC_DPTR
670      | acc_pc ⇒ λP.P ACC_PC
671      | ext_indirect_dptr ⇒ λP.P EXT_INDIRECT_DPTR
672      | indirect_dptr ⇒ λP.P INDIRECT_DPTR
673      | carry ⇒ λP.P CARRY
674      | bit_addr ⇒ λP.bitvector_elim 8 (λx. P (BIT_ADDR x))
675      | n_bit_addr ⇒ λP.bitvector_elim 8 (λx. P (N_BIT_ADDR x))
676      | relative ⇒ λP.bitvector_elim 8 (λx. P (RELATIVE x))
677      | addr11 ⇒ λP.bitvector_elim 11 (λx. P (ADDR11 x))
678      | addr16 ⇒ λP.bitvector_elim 16 (λx. P (ADDR16 x))
679      ]
680    in
681      andb (process_hd P)
682       (match len return λx. x = len → bool with
683         [ O ⇒ λprf. true
684         | S y ⇒ λprf. list_addressing_mode_tags_elim y ? P ] (refl ? len))
685  ].
686  try %
687  [ 2: cases (sym_eq ??? prf); @tl
688  | generalize in match H; generalize in match tl; cases prf;
689    (* cases prf in tl H; : ??? WAS WORKING BEFORE *)
690    #tl
691    normalize in ⊢ (∀_: %. ?)
692    # H
693    whd
694    normalize in ⊢ (match % with [ _ ⇒ ? | _ ⇒ ?])
695    cases (is_a hd (subaddressing_modeel y tl H)) whd // ]
696qed.
697*)
698(*
699lemma test:
700  let i ≝ SJMP (RELATIVE (bitvector_of_nat 8 255)) in
701      (let assembled ≝ assembly1 i in
702      let code_memory ≝ load_code_memory assembled in
703      let fetched ≝ fetch code_memory ? in
704      let 〈instr_pc, ticks〉 ≝ fetched in
705        eq_instruction (\fst instr_pc)) i = true.
706 [2: @ zero
707 | normalize
708 ]*)
709
710lemma BitVectorTrie_O:
711 ∀A:Type[0].∀v:BitVectorTrie A 0.(∃w. v ≃ Leaf A w) ∨ v ≃ Stub A 0.
712 #A #v generalize in match (refl … O) cases v in ⊢ (??%? → (?(??(λ_.?%%??)))(?%%??))
713  [ #w #_ %1 %[@w] %
714  | #n #l #r #abs @⊥ //
715  | #n #EQ %2 >EQ %]
716qed.
717
718lemma BitVectorTrie_Sn:
719 ∀A:Type[0].∀n.∀v:BitVectorTrie A (S n).(∃l,r. v ≃ Node A n l r) ∨ v ≃ Stub A (S n).
720 #A #n #v generalize in match (refl … (S n)) cases v in ⊢ (??%? → (?(??(λ_.??(λ_.?%%??))))%)
721  [ #m #abs @⊥ //
722  | #m #l #r #EQ %1 <(injective_S … EQ) %[@l] %[@r] //
723  | #m #EQ %2 // ]
724qed.
725
726lemma lookup_prepare_trie_for_insertion_hit:
727 ∀A:Type[0].∀a,v:A.∀n.∀b:BitVector n.
728  lookup … b (prepare_trie_for_insertion … b v) a = v.
729 #A #a #v #n #b elim b // #m #hd #tl #IH cases hd normalize //
730qed.
731 
732lemma lookup_insert_hit:
733 ∀A:Type[0].∀a,v:A.∀n.∀b:BitVector n.∀t:BitVectorTrie A n.
734  lookup … b (insert … b v t) a = v.
735 #A #a #v #n #b elim b -b -n //
736 #n #hd #tl #IH #t cases(BitVectorTrie_Sn … t)
737  [ * #l * #r #JMEQ >JMEQ cases hd normalize //
738  | #JMEQ >JMEQ cases hd normalize @lookup_prepare_trie_for_insertion_hit ]
739qed.
740
741coercion bool_to_Prop: ∀b:bool. Prop ≝ bool_to_Prop on _b:bool to Type[0].
742
743lemma lookup_prepare_trie_for_insertion_miss:
744 ∀A:Type[0].∀a,v:A.∀n.∀c,b:BitVector n.
745  (notb (eq_bv ? b c)) → lookup … b (prepare_trie_for_insertion … c v) a = a.
746 #A #a #v #n #c elim c
747  [ #b >(BitVector_O … b) normalize #abs @⊥ //
748  | #m #hd #tl #IH #b cases(BitVector_Sn … b) #hd' * #tl' #JMEQ >JMEQ
749    cases hd cases hd' normalize
750    [2,3: #_ cases tl' //
751    |*: change with (bool_to_Prop (notb (eq_bv ???)) → ?) /2/ ]]
752qed.
753 
754lemma lookup_insert_miss:
755 ∀A:Type[0].∀a,v:A.∀n.∀c,b:BitVector n.∀t:BitVectorTrie A n.
756  (notb (eq_bv ? b c)) → lookup … b (insert … c v t) a = lookup … b t a.
757 #A #a #v #n #c elim c -c -n
758  [ #b #t #DIFF @⊥ whd in DIFF; >(BitVector_O … b) in DIFF //
759  | #n #hd #tl #IH #b cases(BitVector_Sn … b) #hd' * #tl' #JMEQ >JMEQ
760    #t cases(BitVectorTrie_Sn … t)
761    [ * #l * #r #JMEQ >JMEQ cases hd cases hd' #H normalize in H;
762     [1,4: change in H with (bool_to_Prop (notb (eq_bv ???))) ] normalize // @IH //
763    | #JMEQ >JMEQ cases hd cases hd' #H normalize in H;
764     [1,4: change in H with (bool_to_Prop (notb (eq_bv ???))) ] normalize
765     [3,4: cases tl' // | *: @lookup_prepare_trie_for_insertion_miss //]]]
766qed.
767
768definition load_code_memory_aux ≝
769 fold_left_i_aux … (
770   λi, mem, v.
771     insert … (bitvector_of_nat … i) v mem) (Stub Byte 16).
772
773axiom split_elim:
774 ∀A,l,m,v.∀P: (Vector A l) × (Vector A m) → Prop.
775  (∀vl,vm. v = vl@@vm → P 〈vl,vm〉) → P (split A l m v).
776
777axiom half_add_SO:
778 ∀pc.
779 \snd (half_add 16 (bitvector_of_nat … pc) (bitvector_of_nat … 1)) = bitvector_of_nat … (S pc).
780
781(*
782axiom not_eqvb_S:
783 ∀pc.
784 (¬eq_bv 16 (bitvector_of_nat 16 pc) (bitvector_of_nat 16 (S pc))).
785
786axiom not_eqvb_SS:
787 ∀pc.
788 (¬eq_bv 16 (bitvector_of_nat 16 pc) (bitvector_of_nat 16 (S (S pc)))).
789 
790axiom bitvector_elim_complete:
791 ∀n,P. bitvector_elim n P = true → ∀bv. P bv.
792
793lemma bitvector_elim_complete':
794 ∀n,P. bitvector_elim n P = true → ∀bv. P bv = true.
795 #n #P #H generalize in match (bitvector_elim_complete … H) #K #bv
796 generalize in match (K bv) normalize cases (P bv) normalize // #abs @⊥ //
797qed.
798*)
799
800
801
802
803(*
804lemma andb_elim':
805 ∀b1,b2. (b1 = true) → (b2 = true) → (b1 ∧ b2) = true.
806 #b1 #b2 #H1 #H2 @andb_elim cases b1 in H1; normalize //
807qed.
808*)
809
810let rec encoding_check (code_memory: BitVectorTrie Byte 16) (pc: Word) (final_pc: Word)
811                       (encoding: list Byte) on encoding: Prop ≝
812  match encoding with
813  [ nil ⇒ final_pc = pc
814  | cons hd tl ⇒
815    let 〈new_pc, byte〉 ≝ next code_memory pc in
816      hd = byte ∧ encoding_check code_memory new_pc final_pc tl
817  ].
818
819lemma encoding_check_append: ∀code_memory,final_pc,l1,pc,l2.
820 encoding_check code_memory (bitvector_of_nat … pc) (bitvector_of_nat … final_pc) (l1@l2) →
821  let intermediate_pc ≝ pc + length … l1 in
822   encoding_check code_memory (bitvector_of_nat … pc) (bitvector_of_nat … intermediate_pc) l1 ∧
823    encoding_check code_memory (bitvector_of_nat … intermediate_pc) (bitvector_of_nat … final_pc) l2.
824 #code_memory #final_pc #l1 elim l1
825  [ #pc #l2 whd in ⊢ (????% → ?) #H <plus_n_O whd whd in ⊢ (?%?) /2/
826  | #hd #tl #IH #pc #l2 * #H1 #H2 >half_add_SO in H2; #H2 cases (IH … H2) <plus_n_Sm
827    #K1 #K2 % [2:@K2] whd % // >half_add_SO @K1 ]
828qed.
829
830axiom bitvector_3_elim_prop:
831 ∀P: BitVector 3 → Prop.
832  P [[false;false;false]] → P [[false;false;true]] → P [[false;true;false]] →
833  P [[false;true;true]] → P [[true;false;false]] → P [[true;false;true]] →
834  P [[true;true;false]] → P [[true;true;true]] → ∀v. P v.
835
836definition ticks_of_instruction ≝
837 λi.
838  let trivial_code_memory ≝ assembly1 i in
839  let trivial_status ≝ load_code_memory trivial_code_memory in
840   \snd (fetch trivial_status (zero ?)).
841
842axiom fetch_assembly:
843  ∀pc,i,code_memory,assembled.
844    assembled = assembly1 i →
845      let len ≝ length … assembled in
846      encoding_check code_memory (bitvector_of_nat … pc) (bitvector_of_nat … (pc + len)) assembled →
847      let fetched ≝ fetch code_memory (bitvector_of_nat … pc) in
848      let 〈instr_pc, ticks〉 ≝ fetched in
849      let 〈instr,pc'〉 ≝ instr_pc in
850       (eq_instruction instr i ∧ eqb ticks (ticks_of_instruction instr) ∧ eq_bv … pc' (bitvector_of_nat … (pc + len))) = true.
851(* #pc #i #code_memory #assembled cases i [8: *]
852 [16,20,29: * * |18,19: * * [1,2,4,5: *] |28: * * [1,2: * [1,2: * [1,2: * [1,2: *]]]]]
853 [47,48,49:
854 |*: #arg @(list_addressing_mode_tags_elim_prop … arg) whd try % -arg
855  [2,3,5,7,10,12,16,17,18,21,25,26,27,30,31,32,37,38,39,40,41,42,43,44,45,48,51,58,
856   59,60,63,64,65,66,67: #ARG]]
857 [4,5,6,7,8,9,10,11,12,13,22,23,24,27,28,39,40,41,42,43,44,45,46,47,48,49,50,51,52,
858  56,57,69,70,72,73,75: #arg2 @(list_addressing_mode_tags_elim_prop … arg2) whd try % -arg2
859  [1,2,4,7,9,10,12,13,15,16,17,18,20,22,23,24,25,26,27,28,29,30,31,32,33,36,37,38,
860   39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,
861   68,69,70,71: #ARG2]]
862 [1,2,19,20: #arg3 @(list_addressing_mode_tags_elim_prop … arg3) whd try % -arg3 #ARG3]
863 normalize in ⊢ (???% → ?)
864 [92,94,42,93,95: @split_elim #vl #vm #E >E -E; [2,4: @(bitvector_3_elim_prop … vl)]
865  normalize in ⊢ (???% → ?)]
866 #H >H * #H1 try (change in ⊢ (% → ?) with (? ∧ ?) * #H2)
867 try (change in ⊢ (% → ?) with (? ∧ ?) * #H3) whd in ⊢ (% → ?) #H4
868 change in ⊢ (let fetched ≝ % in ?) with (fetch0 ??)
869 whd in ⊢ (let fetched ≝ ??% in ?) <H1 whd in ⊢ (let fetched ≝ % in ?)
870 [17,18,19,20,21,22,23,24,25,26,31,34,35,36,37,38: <H3]
871 [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,
872  30,31,32,33,34,35,36,37,38,39,40,43,45,48,49,52,53,54,55,56,57,60,61,62,65,66,
873  69,70,73,74,78,80,81,84,85,95,98,101,102,103,104,105,106,107,108,109,110: <H2]
874 whd >eq_instruction_refl >H4 @eq_bv_refl
875qed. *)
876
877let rec fetch_many code_memory final_pc pc expected on expected: Prop ≝
878 match expected with
879  [ nil ⇒ eq_bv … pc final_pc = true
880  | cons i tl ⇒
881     let fetched ≝ fetch code_memory pc in
882     let 〈instr_pc, ticks〉 ≝ fetched in
883     let 〈instr,pc'〉 ≝ instr_pc in
884      eq_instruction instr i = true ∧
885      ticks = (ticks_of_instruction i) ∧
886      fetch_many code_memory final_pc pc' tl].
887
888lemma option_destruct_Some: ∀A,a,b. Some A a = Some A b → a=b.
889 #A #a #b #EQ destruct //
890qed.
891
892lemma pair_destruct: ∀A,B,a1,a2,b1,b2. pair A B a1 a2 = 〈b1,b2〉 → a1=b1 ∧ a2=b2.
893 #A #B #a1 #a2 #b1 #b2 #EQ destruct /2/
894qed.
895
896axiom eq_bv_to_eq: ∀n.∀v1,v2: BitVector n. eq_bv … v1 v2 = true → v1=v2.
897
898axiom eq_instruction_to_eq: ∀i1,i2. eq_instruction i1 i2 = true → i1 = i2.
899
900lemma fetch_assembly_pseudo:
901 ∀program,ppc,lookup_labels,lookup_datalabels.
902  ∀pi,code_memory,len,assembled,instructions,pc.
903   let expansion ≝ jump_expansion ppc program in
904   Some ? instructions = expand_pseudo_instruction lookup_labels lookup_datalabels (bitvector_of_nat ? pc) expansion pi →
905    Some … 〈len,assembled〉 = assembly_1_pseudoinstruction program ppc (bitvector_of_nat ? pc) lookup_labels lookup_datalabels pi →
906     encoding_check code_memory (bitvector_of_nat … pc) (bitvector_of_nat … (pc + len)) assembled →
907      fetch_many code_memory (bitvector_of_nat … (pc + len)) (bitvector_of_nat … pc) instructions.
908 #program #ppc #lookup_labels #lookup_datalabels #pi #code_memory #len #assembled #instructions #pc
909 #EQ1 whd in ⊢ (???% → ?) <EQ1 whd in ⊢ (???% → ?) #EQ2
910 cases (pair_destruct ?????? (option_destruct_Some … EQ2)) -EQ2; #EQ2a #EQ2b
911 >EQ2a >EQ2b -EQ2a EQ2b;
912  generalize in match (pc + |flatten … (map … assembly1 instructions)|); #final_pc
913  generalize in match pc elim instructions
914  [ #pc whd in ⊢ (% → %) #H >H @eq_bv_refl
915  | #i #tl #IH #pc #H whd cases (encoding_check_append … H); -H; #H1 #H2 whd
916    generalize in match (fetch_assembly pc i code_memory … (refl …) H1)
917    cases (fetch code_memory (bitvector_of_nat … pc)) #newi_pc #ticks whd in ⊢ (% → %)
918    cases newi_pc #newi #newpc whd in ⊢ (% → %) #K cases (conjunction_true … K) -K; #K1
919    cases (conjunction_true … K1) -K1; #K1 #K2 #K3 % try % //
920    [ @eqb_true_to_eq <(eq_instruction_to_eq … K1) // | >(eq_bv_to_eq … K3) @IH @H2 ]
921qed.
922
923(* This establishes the correspondence between pseudo program counters and
924   program counters. It is at the heart of the proof. *)
925(*CSC: code taken from build_maps *)
926definition sigma00: pseudo_assembly_program → list ? → option (nat × (nat × (BitVectorTrie Word 16))) ≝
927 λinstr_list.λl:list labelled_instruction.
928  foldl ??
929   (λt,i.
930       match t with
931       [ None ⇒ None ?
932       | Some ppc_pc_map ⇒
933         let 〈ppc,pc_map〉 ≝ ppc_pc_map in
934         let 〈program_counter, sigma_map〉 ≝ pc_map in
935         let 〈label, i〉 ≝ i in
936          match construct_costs instr_list ppc program_counter (λx. zero ?) (λx. zero ?) (Stub …) i with
937           [ None ⇒ None ?
938           | Some pc_ignore ⇒
939              let 〈pc,ignore〉 ≝ pc_ignore in
940              Some … 〈S ppc,〈pc, insert ? ? (bitvector_of_nat ? ppc) (bitvector_of_nat ? pc) sigma_map〉〉 ]
941       ]) (Some ? 〈0, 〈0, (Stub ? ?)〉〉) l.
942
943definition sigma0: pseudo_assembly_program → option (nat × (nat × (BitVectorTrie Word 16)))
944 ≝ λprog.sigma00 prog (\snd prog).
945
946definition tech_pc_sigma00: pseudo_assembly_program → list labelled_instruction → option (nat × nat) ≝
947 λprogram,instr_list.
948  match sigma00 program instr_list with
949   [ None ⇒ None …
950   | Some result ⇒
951      let 〈ppc,pc_sigma_map〉 ≝ result in
952      let 〈pc,map〉 ≝ pc_sigma_map in
953       Some … 〈ppc,pc〉 ].
954
955definition sigma_safe: pseudo_assembly_program → option (Word → Word) ≝       
956 λinstr_list.
957  match sigma0 instr_list with
958  [ None ⇒ None ?
959  | Some result ⇒
960    let 〈ppc,pc_sigma_map〉 ≝ result in
961    let 〈pc, sigma_map〉 ≝ pc_sigma_map in
962      if gtb pc (2^16) then
963        None ?
964      else
965        Some ? (λx.lookup ?? x sigma_map (zero …)) ].
966
967axiom policy_ok: ∀p. sigma_safe p ≠ None ….
968
969definition sigma: pseudo_assembly_program → Word → Word ≝
970 λp.
971  match sigma_safe p return λr:option (Word → Word). r ≠ None … → Word → Word with
972   [ None ⇒ λabs. ⊥
973   | Some r ⇒ λ_.r] (policy_ok p).
974 cases abs //
975qed.
976
977lemma length_append:
978 ∀A.∀l1,l2:list A.
979  |l1 @ l2| = |l1| + |l2|.
980 #A #l1 elim l1
981  [ //
982  | #hd #tl #IH #l2 normalize <IH //]
983qed.
984
985let rec does_not_occur (id:Identifier) (l:list labelled_instruction) on l: bool ≝
986 match l with
987  [ nil ⇒ true
988  | cons hd tl ⇒ notb (instruction_matches_identifier id hd) ∧ does_not_occur id tl].
989
990lemma does_not_occur_None:
991 ∀id,i,list_instr.
992  does_not_occur id (list_instr@[〈None …,i〉]) =
993  does_not_occur id list_instr.
994 #id #i #list_instr elim list_instr
995  [ % | #hd #tl #IH whd in ⊢ (??%%) >IH %]
996qed.
997
998lemma does_not_occur_Some:
999 ∀id,id',i,list_instr.
1000  eq_bv ? id' id = false →
1001   does_not_occur id (list_instr@[〈Some ? id',i〉]) =
1002    does_not_occur id list_instr.
1003 #id #id' #i #list_instr elim list_instr
1004  [ #H normalize in H ⊢ %; >H %
1005  | * #x #i' #tl #IH #H whd in ⊢ (??%%) >(IH H) %]
1006qed.
1007
1008lemma does_not_occur_absurd:
1009 ∀id,i,list_instr.
1010  does_not_occur id (list_instr@[〈Some ? id,i〉]) = false.
1011 #id #i #list_instr elim list_instr
1012  [ normalize change with (if (if eq_bv ??? then ? else ?) then ? else ? = ?)
1013    >eq_bv_refl %
1014  | * #x #i' #tl #IH whd in ⊢ (??%%) >IH cases (notb ?) %]
1015qed.
1016
1017let rec occurs_exactly_once (id:Identifier) (l:list labelled_instruction) on l : bool ≝
1018 match l with
1019  [ nil ⇒ false
1020  | cons hd tl ⇒
1021     if instruction_matches_identifier id hd then
1022      does_not_occur id tl
1023     else
1024      occurs_exactly_once id tl ].
1025
1026lemma occurs_exactly_once_None:
1027 ∀id,i,list_instr.
1028  occurs_exactly_once id (list_instr@[〈None …,i〉]) =
1029  occurs_exactly_once id list_instr.
1030 #id #i #list_instr elim list_instr
1031  [ % | #hd #tl #IH whd in ⊢ (??%%) >IH >does_not_occur_None %]
1032qed.
1033
1034lemma occurs_exactly_once_Some:
1035 ∀id,id',i,prefix.
1036  occurs_exactly_once id (prefix@[〈Some ? id',i〉]) → eq_bv ? id' id ∨ occurs_exactly_once id prefix.
1037 #id #id' #i #prefix elim prefix
1038  [ whd in ⊢ (?% → ?) whd in ⊢ (?(match % with [_ ⇒ ? | _ ⇒ ?]) → ?)
1039    change with (? → eq_v ?? eq_b id' id ∨ ?) cases (eq_v ?????) normalize nodelta; /2/
1040  | *; #he #i' #tl #IH whd in ⊢ (?% → ?) whd in ⊢ (?(match % with [_ ⇒ ? | _ ⇒ ?]) → ?)
1041    cases he; normalize nodelta
1042     [ #H @ (IH H)
1043     | #x whd in ⊢ (? → ?(??%)) whd in match (instruction_matches_identifier ??)
1044       change in match (eq_v ???x id) with (eq_bv ? x id) cases (eq_bv ???) normalize nodelta;
1045       [generalize in match (refl … (eq_bv 16 id' id)) cases (eq_bv ???) in ⊢ (??%? → %) normalize nodelta;
1046        /2/ #H >does_not_occur_Some //
1047       | #H @IH @H]]]
1048qed.
1049
1050lemma index_of_internal_None: ∀i,id,instr_list,n.
1051 occurs_exactly_once id (instr_list@[〈None …,i〉]) →
1052  index_of_internal ? (instruction_matches_identifier id) instr_list n =
1053   index_of_internal ? (instruction_matches_identifier id) (instr_list@[〈None …,i〉]) n.
1054 #i #id #instr_list elim instr_list
1055  [ #n #abs whd in abs; cases abs
1056  | #hd #tl #IH #n whd in ⊢ (% → ??%%); whd in ⊢ (match % with [_ ⇒ ? | _ ⇒ ?] → ?)
1057    cases (instruction_matches_identifier id hd) whd in ⊢ (match % with [_ ⇒ ? | _ ⇒ ?] → ??%%)
1058    [ #H %
1059    | #H @IH whd in H; cases (occurs_exactly_once ??) in H ⊢ %
1060      [ #_ % | #abs cases abs ]]]
1061qed.
1062
1063lemma index_of_internal_Some_miss: ∀i,id,id'.
1064 eq_bv ? id' id = false →
1065 ∀instr_list,n.
1066 occurs_exactly_once id (instr_list@[〈Some ? id',i〉]) →
1067  index_of_internal ? (instruction_matches_identifier id) instr_list n =
1068   index_of_internal ? (instruction_matches_identifier id) (instr_list@[〈Some ? id',i〉]) n.
1069 #i #id #id' #EQ #instr_list #n #H generalize in match (occurs_exactly_once_Some … H) in ⊢ ?; >EQ
1070 change with (occurs_exactly_once ?? → ?) generalize in match n; -n H; elim instr_list
1071  [ #n #abs cases abs
1072  | #hd #tl #IH #n whd in ⊢ (?% → ??%%) cases (instruction_matches_identifier id hd) normalize nodelta;
1073    [ // | #K @IH //]]
1074qed.
1075
1076lemma address_of_word_labels_code_mem_None: ∀i,id,instr_list.
1077 occurs_exactly_once id (instr_list@[〈None …,i〉]) →
1078  address_of_word_labels_code_mem instr_list id =
1079  address_of_word_labels_code_mem (instr_list@[〈None …,i〉]) id.
1080 #i #id #instr_list #H whd in ⊢ (??%%) whd in ⊢ (??(??%?)(??%?))
1081 >(index_of_internal_None … H) %
1082qed.
1083
1084lemma address_of_word_labels_code_mem_Some_miss: ∀i,id,id',instr_list.
1085 eq_bv ? id' id = false →
1086  occurs_exactly_once id (instr_list@[〈Some ? id',i〉]) →
1087   address_of_word_labels_code_mem instr_list id =
1088   address_of_word_labels_code_mem (instr_list@[〈Some … id',i〉]) id.
1089 #i #id #id' #instr_list #EQ #H whd in ⊢ (??%%) whd in ⊢ (??(??%?)(??%?))
1090 >(index_of_internal_Some_miss … H) //
1091qed.
1092
1093axiom tech_pc_sigma00_append_Some:
1094 ∀program,prefix,costs,label,i,pc',code,ppc,pc.
1095  tech_pc_sigma00 program prefix = Some … 〈ppc,pc〉 →
1096   construct_costs program … ppc pc (λx.zero 16) (λx. zero 16) costs i = Some … 〈pc',code〉 →
1097    tech_pc_sigma00 program (prefix@[〈label,i〉]) = Some … 〈S ppc,pc'〉.
1098
1099axiom tech_pc_sigma00_append_None:
1100 ∀program,prefix,i,ppc,pc,costs.
1101  tech_pc_sigma00 program prefix = Some … 〈ppc,pc〉 →
1102   construct_costs program … ppc pc (λx.zero 16) (λx. zero 16) costs i = None …
1103    → False.
1104
1105lemma eq_false_to_notb: ∀b. b = false → ¬ b.
1106 *; //
1107qed.
1108
1109lemma eq_bv_sym: ∀n,v1,v2. eq_bv n v1 v2 = eq_bv n v2 v1.
1110 #n #v1 #v2 @(eq_bv_elim … v1 v2) [// | #H >eq_bv_false /2/]
1111qed.
1112
1113definition build_maps' ≝
1114  λpseudo_program.
1115  let result ≝
1116   foldl_strong
1117    (option Identifier × pseudo_instruction)
1118    (λpre. Σres:((BitVectorTrie Word 16) × (nat × (nat × (BitVectorTrie Word 16)))).
1119      let 〈labels,ppc_pc_costs〉 ≝ res in
1120      let 〈ppc',pc_costs〉 ≝ ppc_pc_costs in
1121      let 〈pc',costs〉 ≝ pc_costs in
1122       tech_pc_sigma00 pseudo_program pre = Some ? 〈ppc',pc'〉 ∧
1123       ∀id. occurs_exactly_once id pre →
1124        lookup ?? id labels (zero …) = sigma pseudo_program (address_of_word_labels_code_mem pre id))
1125    (\snd pseudo_program)
1126    (λprefix,i,tl,prf,t.
1127      let 〈labels, ppc_pc_costs〉 ≝ t in
1128      let 〈ppc, pc_costs〉 ≝ ppc_pc_costs in
1129      let 〈pc,costs〉 ≝ pc_costs in
1130       let 〈label, i'〉 ≝ i in
1131       let labels ≝
1132         match label with
1133         [ None ⇒ labels
1134         | Some label ⇒
1135           let program_counter_bv ≝ bitvector_of_nat ? pc in
1136             insert ? ? label program_counter_bv labels
1137         ]
1138       in
1139         match construct_costs pseudo_program ppc pc (λx. zero ?) (λx. zero ?) costs i' with
1140         [ None ⇒
1141            let dummy ≝ 〈labels,ppc_pc_costs〉 in
1142             dummy
1143         | Some construct ⇒ 〈labels, 〈S ppc,construct〉〉
1144         ]
1145    ) 〈(Stub ? ?), 〈0, 〈0, Stub ? ?〉〉〉
1146  in
1147   let 〈labels, ppc_pc_costs〉 ≝ result in
1148   let 〈ppc,pc_costs〉 ≝ ppc_pc_costs in
1149   let 〈pc, costs〉 ≝ pc_costs in
1150    〈labels, costs〉.
1151 [3: whd % // #id normalize in ⊢ (% → ?) #abs @⊥ //
1152 | whd generalize in match (sig2 … t) >p >p1 >p2 >p3 *; #IH1 #IH2
1153   cases construct in p4 #PC #CODE #JMEQ %
1154   [ @(tech_pc_sigma00_append_Some … IH1 (jmeq_to_eq … JMEQ))
1155   | #id normalize nodelta; -labels1; cases label; normalize nodelta
1156     [ #K <address_of_word_labels_code_mem_None [2:@K] @IH2 //
1157     | #l #H generalize in match (occurs_exactly_once_Some ???? H) in ⊢ ?;
1158       generalize in match (refl … (eq_bv ? l id)); cases (eq_bv … l id) in ⊢ (???% → %)
1159        [ #EQ #_ <(eq_bv_to_eq … EQ) >lookup_insert_hit
1160         
1161        | #EQ change with (occurs_exactly_once ?? → ?) #K >lookup_insert_miss [2: /2/]
1162          <(address_of_word_labels_code_mem_Some_miss … EQ … H) @IH2 //]]]
1163 | (* dummy case *) @⊥ generalize in match (sig2 … t) >p >p1 >p2 >p3 *; #IH1 #IH2
1164   @(tech_pc_sigma00_append_None … IH1 (jmeq_to_eq ??? p4)) ]
1165qed.
1166
1167lemma build_maps_ok:
1168 ∀p:pseudo_assembly_program.
1169  let 〈labels,costs〉 ≝ build_maps' p in
1170   ∀pc.
1171    (nat_of_bitvector … pc) < length … (\snd p) →
1172     lookup ?? pc labels (zero …) = sigma p (\snd (fetch_pseudo_instruction (\snd p) pc)).
1173 #p cases p #preamble #instr_list
1174  elim instr_list
1175   [ whd #pc #abs normalize in abs; cases (not_le_Sn_O ?) [#H cases (H abs) ]
1176   | #hd #tl #IH
1177    whd in ⊢ (match % with [ _ ⇒ ?])
1178   ]
1179qed.
1180*)
1181
1182(*
1183lemma rev_preserves_length:
1184 ∀A.∀l. length … (rev A l) = length … l.
1185  #A #l elim l
1186   [ %
1187   | #hd #tl #IH normalize >length_append normalize /2/ ]
1188qed.
1189
1190lemma rev_append:
1191 ∀A.∀l1,l2.
1192  rev A (l1@l2) = rev A l2 @ rev A l1.
1193 #A #l1 elim l1 normalize //
1194qed.
1195 
1196lemma rev_rev: ∀A.∀l. rev … (rev A l) = l.
1197 #A #l elim l
1198  [ //
1199  | #hd #tl #IH normalize >rev_append normalize // ]
1200qed.
1201
1202lemma split_len_Sn:
1203 ∀A:Type[0].∀l:list A.∀len.
1204  length … l = S len →
1205   Σl'.Σa. l = l'@[a] ∧ length … l' = len.
1206 #A #l elim l
1207  [ normalize #len #abs destruct
1208  | #hd #tl #IH #len
1209    generalize in match (rev_rev … tl)
1210    cases (rev A tl) in ⊢ (??%? → ?)
1211     [ #H <H normalize #EQ % [@[ ]] % [@hd] normalize /2/ 
1212     | #a #l' #H <H normalize #EQ
1213      %[@(hd::rev … l')] %[@a] % //
1214      >length_append in EQ #EQ normalize in EQ; normalize;
1215      generalize in match (injective_S … EQ) #EQ2 /2/ ]]
1216qed.
1217
1218lemma list_elim_rev:
1219 ∀A:Type[0].∀P:list A → Type[0].
1220  P [ ] → (∀l,a. P l → P (l@[a])) →
1221   ∀l. P l.
1222 #A #P #H1 #H2 #l
1223 generalize in match (refl … (length … l))
1224 generalize in ⊢ (???% → ?) #n generalize in match l
1225 elim n
1226  [ #L cases L [ // | #x #w #abs (normalize in abs) @⊥ // ]
1227  | #m #IH #L #EQ
1228    cases (split_len_Sn … EQ) #l' * #a * /3/ ]
1229qed.
1230
1231axiom is_prefix: ∀A:Type[0]. list A → list A → Prop.
1232axiom prefix_of_append:
1233 ∀A:Type[0].∀l,l1,l2:list A.
1234  is_prefix … l l1 → is_prefix … l (l1@l2).
1235axiom prefix_reflexive: ∀A,l. is_prefix A l l.
1236axiom nil_prefix: ∀A,l. is_prefix A [ ] l.
1237
1238record Propify (A:Type[0]) : Type[0] (*Prop*) ≝ { in_propify: A }.
1239
1240definition Propify_elim: ∀A. ∀P:Prop. (A → P) → (Propify A → P) ≝
1241 λA,P,H,x. match x with [ mk_Propify p ⇒ H p ].
1242
1243definition app ≝
1244 λA:Type[0].λl1:Propify (list A).λl2:list A.
1245  match l1 with
1246   [ mk_Propify l1 ⇒ mk_Propify … (l1@l2) ].
1247
1248lemma app_nil: ∀A,l1. app A l1 [ ] = l1.
1249 #A * /3/
1250qed.
1251
1252lemma app_assoc: ∀A,l1,l2,l3. app A (app A l1 l2) l3 = app A l1 (l2@l3).
1253 #A * #l1 normalize //
1254qed.
1255
1256let rec foldli (A: Type[0]) (B: Propify (list A) → Type[0])
1257 (f: ∀prefix. B prefix → ∀x.B (app … prefix [x]))
1258 (prefix: Propify (list A)) (b: B prefix) (l: list A) on l :
1259 B (app … prefix l) ≝
1260  match l with
1261  [ nil ⇒ ? (* b *)
1262  | cons hd tl ⇒ ? (*foldli A B f (prefix@[hd]) (f prefix b hd) tl*)
1263  ].
1264 [ applyS b
1265 | <(app_assoc ?? [hd]) @(foldli A B f (app … prefix [hd]) (f prefix b hd) tl) ]
1266qed.
1267
1268(*
1269let rec foldli (A: Type[0]) (B: list A → Type[0]) (f: ∀prefix. B prefix → ∀x. B (prefix@[x]))
1270 (prefix: list A) (b: B prefix) (l: list A) on l : B (prefix@l) ≝
1271  match l with
1272  [ nil ⇒ ? (* b *)
1273  | cons hd tl ⇒
1274     ? (*foldli A B f (prefix@[hd]) (f prefix b hd) tl*)
1275  ].
1276 [ applyS b
1277 | applyS (foldli A B f (prefix@[hd]) (f prefix b hd) tl) ]
1278qed.
1279*)
1280
1281definition foldll:
1282 ∀A:Type[0].∀B: Propify (list A) → Type[0].
1283  (∀prefix. B prefix → ∀x. B (app … prefix [x])) →
1284   B (mk_Propify … []) → ∀l: list A. B (mk_Propify … l)
1285 ≝ λA,B,f. foldli A B f (mk_Propify … [ ]).
1286
1287axiom is_pprefix: ∀A:Type[0]. Propify (list A) → list A → Prop.
1288axiom pprefix_of_append:
1289 ∀A:Type[0].∀l,l1,l2.
1290  is_pprefix A l l1 → is_pprefix A l (l1@l2).
1291axiom pprefix_reflexive: ∀A,l. is_pprefix A (mk_Propify … l) l.
1292axiom nil_pprefix: ∀A,l. is_pprefix A (mk_Propify … [ ]) l.
1293
1294
1295axiom foldll':
1296 ∀A:Type[0].∀l: list A.
1297  ∀B: ∀prefix:Propify (list A). is_pprefix ? prefix l → Type[0].
1298  (∀prefix,proof. B prefix proof → ∀x,proof'. B (app … prefix [x]) proof') →
1299   B (mk_Propify … [ ]) (nil_pprefix …) → B (mk_Propify … l) (pprefix_reflexive … l).
1300 #A #l #B
1301 generalize in match (foldll A (λprefix. is_pprefix ? prefix l)) #HH
1302 
1303 
1304  #H #acc
1305 @foldll
1306  [
1307  |
1308  ]
1309 
1310 ≝ λA,B,f. foldli A B f (mk_Propify … [ ]).
1311
1312
1313(*
1314record subset (A:Type[0]) (P: A → Prop): Type[0] ≝
1315 { subset_wit:> A;
1316   subset_proof: P subset_wit
1317 }.
1318*)
1319
1320definition build_maps' ≝
1321  λpseudo_program.
1322  let 〈preamble,instr_list〉 ≝ pseudo_program in
1323  let result ≝
1324   foldll
1325    (option Identifier × pseudo_instruction)
1326    (λprefix.
1327      Σt:((BitVectorTrie Word 16) × (nat × (BitVectorTrie Word 16))).
1328       match prefix return λ_.Prop with [mk_Propify prefix ⇒ tech_pc_sigma0 〈preamble,prefix〉 ≠ None ?])
1329    (λprefix,t,i.
1330      let 〈labels, pc_costs〉 ≝ t in
1331      let 〈program_counter, costs〉 ≝ pc_costs in
1332       let 〈label, i'〉 ≝ i in
1333       let labels ≝
1334         match label with
1335         [ None ⇒ labels
1336         | Some label ⇒
1337           let program_counter_bv ≝ bitvector_of_nat ? program_counter in
1338             insert ? ? label program_counter_bv labels
1339         ]
1340       in
1341         match construct_costs pseudo_program program_counter (λx. zero ?) (λx. zero ?) costs i' with
1342         [ None ⇒
1343            let dummy ≝ 〈labels,pc_costs〉 in
1344              dummy
1345         | Some construct ⇒ 〈labels, construct〉
1346         ]
1347    ) 〈(Stub ? ?), 〈0, (Stub ? ?)〉〉 instr_list
1348  in
1349   let 〈labels, pc_costs〉 ≝ result in
1350   let 〈pc, costs〉 ≝ pc_costs in
1351    〈labels, costs〉.
1352 [
1353 | @⊥
1354 | normalize % //
1355 ]
1356qed.
1357
1358definition build_maps' ≝
1359  λpseudo_program.
1360  let 〈preamble,instr_list〉 ≝ pseudo_program in
1361  let result ≝
1362   foldl
1363    (Σt:((BitVectorTrie Word 16) × (nat × (BitVectorTrie Word 16))).
1364          ∃instr_list_prefix. is_prefix ? instr_list_prefix instr_list ∧
1365           tech_pc_sigma0 〈preamble,instr_list_prefix〉 = Some ? (\fst (\snd t)))
1366    (Σi:option Identifier × pseudo_instruction. ∀instr_list_prefix.
1367          let instr_list_prefix' ≝ instr_list_prefix @ [i] in
1368           is_prefix ? instr_list_prefix' instr_list →
1369           tech_pc_sigma0 〈preamble,instr_list_prefix'〉 ≠ None ?)
1370    (λt: Σt:((BitVectorTrie Word 16) × (nat × (BitVectorTrie Word 16))).
1371          ∃instr_list_prefix. is_prefix ? instr_list_prefix instr_list ∧
1372           tech_pc_sigma0 〈preamble,instr_list_prefix〉 = Some ? (\fst (\snd t)).
1373     λi: Σi:option Identifier × pseudo_instruction. ∀instr_list_prefix.
1374          let instr_list_prefix' ≝ instr_list_prefix @ [i] in
1375           is_prefix ? instr_list_prefix' instr_list →
1376           tech_pc_sigma0 〈preamble,instr_list_prefix'〉 ≠ None ? .
1377      let 〈labels, pc_costs〉 ≝ t in
1378      let 〈program_counter, costs〉 ≝ pc_costs in
1379       let 〈label, i'〉 ≝ i in
1380       let labels ≝
1381         match label with
1382         [ None ⇒ labels
1383         | Some label ⇒
1384           let program_counter_bv ≝ bitvector_of_nat ? program_counter in
1385             insert ? ? label program_counter_bv labels
1386         ]
1387       in
1388         match construct_costs pseudo_program program_counter (λx. zero ?) (λx. zero ?) costs i' with
1389         [ None ⇒
1390            let dummy ≝ 〈labels,pc_costs〉 in
1391              dummy
1392         | Some construct ⇒ 〈labels, construct〉
1393         ]
1394    ) 〈(Stub ? ?), 〈0, (Stub ? ?)〉〉 ?(*instr_list*)
1395  in
1396   let 〈labels, pc_costs〉 ≝ result in
1397   let 〈pc, costs〉 ≝ pc_costs in
1398    〈labels, costs〉.
1399 [4: @(list_elim_rev ?
1400       (λinstr_list. list (
1401        (Σi:option Identifier × pseudo_instruction. ∀instr_list_prefix.
1402          let instr_list_prefix' ≝ instr_list_prefix @ [i] in
1403           is_prefix ? instr_list_prefix' instr_list →
1404           tech_pc_sigma0 〈preamble,instr_list_prefix'〉 ≠ None ?)))
1405       ?? instr_list) (* CSC: BAD ORDER FOR CODE EXTRACTION *)
1406      [ @[ ]
1407      | #l' #a #limage %2
1408        [ %[@a] #PREFIX #PREFIX_OK
1409        | (* CSC: EVEN WORST CODE FOR EXTRACTION: WE SHOULD STRENGTHEN
1410             THE INDUCTION HYPOTHESIS INSTEAD *)
1411          elim limage
1412           [ %1
1413           | #HD #TL #IH @(?::IH) cases HD #ELEM #K1 %[@ELEM] #K2 #K3
1414             @K1 @(prefix_of_append ???? K3)
1415           ] 
1416        ]
1417       
1418       
1419     
1420 
1421  cases t in c2 ⊢ % #t' * #LIST_PREFIX * #H1t' #H2t' #HJMt'
1422     % [@ (LIST_PREFIX @ [i])] %
1423      [ cases (sig2 … i LIST_PREFIX) #K1 #K2 @K1
1424      | (* DOABLE IN PRINCIPLE *)
1425      ]
1426 | (* assert false case *)
1427 |3: % [@ ([ ])] % [2: % | (* DOABLE *)]
1428 |   
1429*)
1430
1431axiom assembly_ok:
1432 ∀program,assembled,costs,labels.
1433  Some … 〈labels,costs〉 = build_maps program →
1434  Some … 〈assembled,costs〉 = assembly program →
1435  let code_memory ≝ load_code_memory assembled in
1436  let preamble ≝ \fst program in
1437  let datalabels ≝ construct_datalabels preamble in
1438  let lookup_labels ≝ λx. sigma program (address_of_word_labels_code_mem (\snd program) x) in
1439  let lookup_datalabels ≝ λx. lookup ?? x datalabels (zero ?) in
1440   ∀ppc,len,assembledi.
1441    let 〈pi,newppc〉 ≝ fetch_pseudo_instruction (\snd program) ppc in
1442     Some … 〈len,assembledi〉 = assembly_1_pseudoinstruction program ppc (sigma program ppc) lookup_labels lookup_datalabels pi →
1443      encoding_check code_memory (sigma program ppc) (bitvector_of_nat … (nat_of_bitvector … (sigma program ppc) + len)) assembledi ∧
1444       sigma program newppc = bitvector_of_nat … (nat_of_bitvector … (sigma program ppc) + len).
1445
1446axiom bitvector_of_nat_nat_of_bitvector:
1447  ∀n,v.
1448    bitvector_of_nat n (nat_of_bitvector n v) = v.
1449
1450axiom assembly_ok_to_expand_pseudo_instruction_ok:
1451 ∀program,assembled,costs.
1452  Some … 〈assembled,costs〉 = assembly program →
1453   ∀ppc.
1454    let code_memory ≝ load_code_memory assembled in
1455    let preamble ≝ \fst program in   
1456    let data_labels ≝ construct_datalabels preamble in
1457    let lookup_labels ≝ λx. sigma program (address_of_word_labels_code_mem (\snd program) x) in
1458    let lookup_datalabels ≝ λx. lookup ? ? x data_labels (zero ?) in
1459    let expansion ≝ jump_expansion ppc program in
1460    let 〈pi,newppc〉 ≝ fetch_pseudo_instruction (\snd program) ppc in
1461     ∃instructions.
1462      Some ? instructions = expand_pseudo_instruction lookup_labels lookup_datalabels (sigma program ppc) expansion pi.
1463
1464lemma fetch_assembly_pseudo2:
1465 ∀program,assembled,costs,labels.
1466  Some … 〈labels,costs〉 = build_maps program →
1467  Some … 〈assembled,costs〉 = assembly program →
1468   ∀ppc.
1469    let code_memory ≝ load_code_memory assembled in
1470    let preamble ≝ \fst program in
1471    let data_labels ≝ construct_datalabels preamble in
1472    let lookup_labels ≝ λx. sigma program (address_of_word_labels_code_mem (\snd program) x) in
1473    let lookup_datalabels ≝ λx. lookup ? ? x data_labels (zero ?) in
1474    let expansion ≝ jump_expansion ppc program in
1475    let 〈pi,newppc〉 ≝ fetch_pseudo_instruction (\snd program) ppc in
1476     ∃instructions.
1477      Some ? instructions = expand_pseudo_instruction lookup_labels lookup_datalabels (sigma program ppc) expansion pi ∧
1478       fetch_many code_memory (sigma program newppc) (sigma program ppc) instructions.
1479 #program #assembled #costs #labels #BUILD_MAPS #ASSEMBLY #ppc
1480 generalize in match (assembly_ok_to_expand_pseudo_instruction_ok program assembled costs ASSEMBLY ppc)
1481 letin code_memory ≝ (load_code_memory assembled)
1482 letin preamble ≝ (\fst program)
1483 letin data_labels ≝ (construct_datalabels preamble)
1484 letin lookup_labels ≝ (λx. sigma program (address_of_word_labels_code_mem (\snd program) x))
1485 letin lookup_datalabels ≝ (λx. lookup ? ? x data_labels (zero ?))
1486 whd in ⊢ (% → %)
1487 generalize in match (assembly_ok … BUILD_MAPS ASSEMBLY ppc)
1488 cases (fetch_pseudo_instruction (\snd program) ppc) #pi #newppc
1489 generalize in match (fetch_assembly_pseudo program ppc
1490  (λx. sigma program (address_of_word_labels_code_mem (\snd program) x)) (λx. lookup ?? x data_labels (zero ?)) pi
1491  (load_code_memory assembled));
1492 whd in ⊢ ((∀_.∀_.∀_.∀_.%) → (∀_.∀_.%) → % → %) #H1 #H2 * #instructions #EXPAND
1493 whd in H1:(∀_.∀_.∀_.∀_.? → ???% → ?) H2:(∀_.∀_.???% → ?);
1494 normalize nodelta in EXPAND; (* HERE *)
1495 generalize in match (λlen, assembled.H1 len assembled instructions (nat_of_bitvector … (sigma program ppc))) -H1; #H1
1496 >bitvector_of_nat_nat_of_bitvector in H1; #H1
1497 <EXPAND in H1 H2; whd in ⊢ ((∀_.∀_.? → ???% → ?) → (∀_.∀_.???% → ?) → ?)
1498 #H1 #H2
1499 cases (H2 ?? (refl …)) -H2; #K1 #K2 >K2
1500 generalize in match (H1 ?? (refl …) (refl …) ?) -H1;
1501  [ #K3 % [2: % [% | @K3]] | @K1 ]
1502qed.
1503
1504(* OLD?
1505definition assembly_specification:
1506  ∀assembly_program: pseudo_assembly_program.
1507  ∀code_mem: BitVectorTrie Byte 16. Prop ≝
1508  λpseudo_assembly_program.
1509  λcode_mem.
1510    ∀pc: Word.
1511      let 〈preamble, instr_list〉 ≝ pseudo_assembly_program in
1512      let 〈pre_instr, pre_new_pc〉 ≝ fetch_pseudo_instruction instr_list pc in
1513      let labels ≝ λx. sigma' pseudo_assembly_program (address_of_word_labels_code_mem instr_list x) in
1514      let datalabels ≝ λx. sigma' pseudo_assembly_program (lookup ? ? x (construct_datalabels preamble) (zero ?)) in
1515      let pre_assembled ≝ assembly_1_pseudoinstruction pseudo_assembly_program
1516       (sigma' pseudo_assembly_program pc) labels datalabels pre_instr in
1517      match pre_assembled with
1518       [ None ⇒ True
1519       | Some pc_code ⇒
1520          let 〈new_pc,code〉 ≝ pc_code in
1521           encoding_check code_mem pc (sigma' pseudo_assembly_program pre_new_pc) code ].
1522
1523axiom assembly_meets_specification:
1524  ∀pseudo_assembly_program.
1525    match assembly pseudo_assembly_program with
1526    [ None ⇒ True
1527    | Some code_mem_cost ⇒
1528      let 〈code_mem, cost〉 ≝ code_mem_cost in
1529        assembly_specification pseudo_assembly_program (load_code_memory code_mem)
1530    ].
1531(*
1532  # PROGRAM
1533  [ cases PROGRAM
1534    # PREAMBLE
1535    # INSTR_LIST
1536    elim INSTR_LIST
1537    [ whd
1538      whd in ⊢ (∀_. %)
1539      # PC
1540      whd
1541    | # INSTR
1542      # INSTR_LIST_TL
1543      # H
1544      whd
1545      whd in ⊢ (match % with [ _ ⇒ ? | _ ⇒ ?])
1546    ]
1547  | cases not_implemented
1548  ] *)
1549*)
1550
1551definition internal_pseudo_address_map ≝ list (BitVector 8).
1552
1553axiom low_internal_ram_of_pseudo_low_internal_ram:
1554 ∀M:internal_pseudo_address_map.∀ram:BitVectorTrie Byte 7.BitVectorTrie Byte 7.
1555
1556axiom high_internal_ram_of_pseudo_high_internal_ram:
1557 ∀M:internal_pseudo_address_map.∀ram:BitVectorTrie Byte 7.BitVectorTrie Byte 7.
1558
1559axiom low_internal_ram_of_pseudo_internal_ram_hit:
1560 ∀M:internal_pseudo_address_map.∀s:PseudoStatus.∀addr:BitVector 7.
1561  member ? (eq_bv 8) (false:::addr) M = true →
1562   let ram ≝ low_internal_ram_of_pseudo_low_internal_ram M (low_internal_ram … s) in
1563   let pbl ≝ lookup ? 7 addr (low_internal_ram ? s) (zero 8) in
1564   let pbu ≝ lookup ? 7 (\snd (half_add ? addr (bitvector_of_nat 7 1))) (low_internal_ram ? s) (zero 8) in
1565   let bl ≝ lookup ? 7 addr ram (zero 8) in
1566   let bu ≝ lookup ? 7 (\snd (half_add ? addr (bitvector_of_nat 7 1))) ram (zero 8) in
1567    bu@@bl = sigma (code_memory … s) (pbu@@pbl).
1568
1569(* changed from add to sub *)
1570axiom low_internal_ram_of_pseudo_internal_ram_miss:
1571 ∀T.∀M:internal_pseudo_address_map.∀s:PreStatus T.∀addr:BitVector 7.
1572  let ram ≝ low_internal_ram_of_pseudo_low_internal_ram M (low_internal_ram … s) in
1573  let 〈Saddr,flags〉 ≝ sub_7_with_carry addr (bitvector_of_nat 7 1) false in
1574  let carr ≝ get_index_v ? ? flags 1 ? in
1575  carr = false →
1576  member ? (eq_bv 8) (false:::Saddr) M = false →
1577   member ? (eq_bv 8) (false:::addr) M = false →
1578    lookup ? 7 addr ram (zero ?) = lookup ? 7 addr (low_internal_ram … s) (zero ?).
1579  //
1580qed.
1581
1582definition addressing_mode_ok ≝
1583 λT.λM:internal_pseudo_address_map.λs:PreStatus T.
1584  λaddr:addressing_mode.
1585   match addr with
1586    [ DIRECT d ⇒
1587       ¬(member ? (eq_bv 8) d M) ∧
1588       ¬(member ? (eq_bv 8) (\fst (sub_8_with_carry d (bitvector_of_nat 8 1) false)) M)
1589    | INDIRECT i ⇒
1590       let d ≝ get_register ? s [[false;false;i]] in
1591       ¬(member ? (eq_bv 8) d M) ∧
1592       ¬(member ? (eq_bv 8) (\fst (sub_8_with_carry d (bitvector_of_nat 8 1) false)) M)
1593    | EXT_INDIRECT _ ⇒ true
1594    | REGISTER _ ⇒ true
1595    | ACC_A ⇒ true
1596    | ACC_B ⇒ true
1597    | DPTR ⇒ true
1598    | DATA _ ⇒ true
1599    | DATA16 _ ⇒ true
1600    | ACC_DPTR ⇒ true
1601    | ACC_PC ⇒ true
1602    | EXT_INDIRECT_DPTR ⇒ true
1603    | INDIRECT_DPTR ⇒ true
1604    | CARRY ⇒ true
1605    | BIT_ADDR _ ⇒ ¬true (* TO BE COMPLETED *)
1606    | N_BIT_ADDR _ ⇒ ¬true (* TO BE COMPLETED *)
1607    | RELATIVE _ ⇒ true
1608    | ADDR11 _ ⇒ true
1609    | ADDR16 _ ⇒ true ].
1610   
1611definition next_internal_pseudo_address_map0 ≝
1612  λT.
1613  λfetched.
1614  λM: internal_pseudo_address_map.
1615  λs: PreStatus T.
1616   match fetched with
1617    [ Comment _ ⇒ Some ? M
1618    | Cost _ ⇒ Some … M
1619    | Jmp _ ⇒ Some … M
1620    | Call _ ⇒
1621       Some … (\snd (half_add ? (get_8051_sfr … s SFR_SP) (bitvector_of_nat 8 1))::M)
1622    | Mov _ _ ⇒ Some … M
1623    | Instruction instr ⇒
1624       match instr with
1625        [ ADD addr1 addr2 ⇒
1626           if addressing_mode_ok T M s addr1 ∧ addressing_mode_ok T M s addr2 then
1627            Some ? M
1628           else
1629            None ?
1630        | ADDC addr1 addr2 ⇒
1631           if addressing_mode_ok T M s addr1 ∧ addressing_mode_ok T M s addr2 then
1632            Some ? M
1633           else
1634            None ?
1635        | SUBB addr1 addr2 ⇒
1636           if addressing_mode_ok T M s addr1 ∧ addressing_mode_ok T M s addr2 then
1637            Some ? M
1638           else
1639            None ?       
1640        | _ ⇒ (* TO BE COMPLETED *) Some ? M ]].
1641 
1642
1643definition next_internal_pseudo_address_map ≝
1644 λM:internal_pseudo_address_map.
1645  λs:PseudoStatus.
1646    next_internal_pseudo_address_map0 ?
1647     (\fst (fetch_pseudo_instruction (\snd (code_memory ? s)) (program_counter ? s))) M s.
1648   
1649definition status_of_pseudo_status:
1650 internal_pseudo_address_map → PseudoStatus → option Status ≝
1651 λM,ps.
1652  let pap ≝ code_memory … ps in
1653   match assembly pap with
1654    [ None ⇒ None …
1655    | Some p ⇒
1656       let cm ≝ load_code_memory (\fst p) in
1657       let pc ≝ sigma pap (program_counter ? ps) in
1658       let lir ≝ low_internal_ram_of_pseudo_low_internal_ram M (low_internal_ram … ps) in
1659       let hir ≝ high_internal_ram_of_pseudo_high_internal_ram M (high_internal_ram … ps) in
1660        Some …
1661         (mk_PreStatus (BitVectorTrie Byte 16)
1662           cm
1663           lir
1664           hir
1665           (external_ram … ps)
1666           pc
1667           (special_function_registers_8051 … ps)
1668           (special_function_registers_8052 … ps)
1669           (p1_latch … ps)
1670           (p3_latch … ps)
1671           (clock … ps)) ].
1672
1673(*
1674definition write_at_stack_pointer':
1675 ∀M. ∀ps: PreStatus M. Byte → Σps':PreStatus M.(code_memory … ps = code_memory … ps') ≝
1676  λM: Type[0].
1677  λs: PreStatus M.
1678  λv: Byte.
1679    let 〈 nu, nl 〉 ≝ split … 4 4 (get_8051_sfr ? s SFR_SP) in
1680    let bit_zero ≝ get_index_v… nu O ? in
1681    let bit_1 ≝ get_index_v… nu 1 ? in
1682    let bit_2 ≝ get_index_v… nu 2 ? in
1683    let bit_3 ≝ get_index_v… nu 3 ? in
1684      if bit_zero then
1685        let memory ≝ insert … ([[ bit_1 ; bit_2 ; bit_3 ]] @@ nl)
1686                              v (low_internal_ram ? s) in
1687          set_low_internal_ram ? s memory
1688      else
1689        let memory ≝ insert … ([[ bit_1 ; bit_2 ; bit_3 ]] @@ nl)
1690                              v (high_internal_ram ? s) in
1691          set_high_internal_ram ? s memory.
1692  [ cases l0 %
1693  |2,3,4,5: normalize repeat (@ le_S_S) @ le_O_n ]
1694qed.
1695
1696definition execute_1_pseudo_instruction': (Word → nat) → ∀ps:PseudoStatus.
1697 Σps':PseudoStatus.(code_memory … ps = code_memory … ps')
1698
1699  λticks_of.
1700  λs.
1701  let 〈instr, pc〉 ≝ fetch_pseudo_instruction (\snd (code_memory ? s)) (program_counter ? s) in
1702  let ticks ≝ ticks_of (program_counter ? s) in
1703  let s ≝ set_clock ? s (clock ? s + ticks) in
1704  let s ≝ set_program_counter ? s pc in
1705    match instr with
1706    [ Instruction instr ⇒
1707       execute_1_preinstruction … (λx, y. address_of_word_labels y x) instr s
1708    | Comment cmt ⇒ s
1709    | Cost cst ⇒ s
1710    | Jmp jmp ⇒ set_program_counter ? s (address_of_word_labels s jmp)
1711    | Call call ⇒
1712      let a ≝ address_of_word_labels s call in
1713      let 〈carry, new_sp〉 ≝ half_add ? (get_8051_sfr ? s SFR_SP) (bitvector_of_nat 8 1) in
1714      let s ≝ set_8051_sfr ? s SFR_SP new_sp in
1715      let 〈pc_bu, pc_bl〉 ≝ split ? 8 8 (program_counter ? s) in
1716      let s ≝ write_at_stack_pointer' ? s pc_bl in
1717      let 〈carry, new_sp〉 ≝ half_add ? (get_8051_sfr ? s SFR_SP) (bitvector_of_nat 8 1) in
1718      let s ≝ set_8051_sfr ? s SFR_SP new_sp in
1719      let s ≝ write_at_stack_pointer' ? s pc_bu in
1720        set_program_counter ? s a
1721    | Mov dptr ident ⇒
1722       set_arg_16 ? s (get_arg_16 ? s (DATA16 (address_of_word_labels s ident))) dptr
1723    ].
1724 [
1725 |2,3,4: %
1726 | <(sig2 … l7) whd in ⊢ (??? (??%)) <(sig2 … l5) %
1727 |
1728 | %
1729 ]
1730 cases not_implemented
1731qed.
1732*)
1733
1734axiom execute_1_pseudo_instruction_preserves_code_memory:
1735 ∀ticks_of,ps.
1736  code_memory … (execute_1_pseudo_instruction ticks_of ps) = code_memory … ps.
1737
1738(*
1739lemma execute_code_memory_unchanged:
1740 ∀ticks_of,ps. code_memory ? ps = code_memory ? (execute_1_pseudo_instruction ticks_of ps).
1741 #ticks #ps whd in ⊢ (??? (??%))
1742 cases (fetch_pseudo_instruction (\snd (code_memory pseudo_assembly_program ps))
1743  (program_counter pseudo_assembly_program ps)) #instr #pc
1744 whd in ⊢ (??? (??%)) cases instr
1745  [ #pre cases pre
1746     [ #a1 #a2 whd in ⊢ (??? (??%)) cases (add_8_with_carry ???) #y1 #y2 whd in ⊢ (??? (??%))
1747       cases (split ????) #z1 #z2 %
1748     | #a1 #a2 whd in ⊢ (??? (??%)) cases (add_8_with_carry ???) #y1 #y2 whd in ⊢ (??? (??%))
1749       cases (split ????) #z1 #z2 %
1750     | #a1 #a2 whd in ⊢ (??? (??%)) cases (sub_8_with_carry ???) #y1 #y2 whd in ⊢ (??? (??%))
1751       cases (split ????) #z1 #z2 %
1752     | #a1 whd in ⊢ (??? (??%)) cases a1 #x #H whd in ⊢ (??? (??%)) cases x
1753       [ #x1 whd in ⊢ (??? (??%))
1754     | *: cases not_implemented
1755     ]
1756  | #comment %
1757  | #cost %
1758  | #label %
1759  | #label whd in ⊢ (??? (??%)) cases (half_add ???) #x1 #x2 whd in ⊢ (??? (??%))
1760    cases (split ????) #y1 #y2 whd in ⊢ (??? (??%)) cases (half_add ???) #z1 #z2
1761    whd in ⊢ (??? (??%)) whd in ⊢ (??? (??%)) cases (split ????) #w1 #w2
1762    whd in ⊢ (??? (??%)) cases (get_index_v bool ????) whd in ⊢ (??? (??%))
1763    (* CSC: ??? *)
1764  | #dptr #label (* CSC: ??? *)
1765  ]
1766  cases not_implemented
1767qed.
1768*)
1769
1770lemma status_of_pseudo_status_failure_depends_only_on_code_memory:
1771 ∀M:internal_pseudo_address_map.
1772 ∀ps,ps': PseudoStatus.
1773  code_memory … ps = code_memory … ps' →
1774   match status_of_pseudo_status M ps with
1775    [ None ⇒ status_of_pseudo_status M ps' = None …
1776    | Some _ ⇒ ∃w. status_of_pseudo_status M ps' = Some … w
1777    ].
1778 #M #ps #ps' #H whd in ⊢ (match % with [ _ ⇒ ? | _ ⇒ ? ])
1779 generalize in match (refl … (assembly (code_memory … ps)))
1780 cases (assembly ?) in ⊢ (???% → %)
1781  [ #K whd whd in ⊢ (??%?) <H >K %
1782  | #x #K whd whd in ⊢ (?? (λ_.??%?)) <H >K % [2: % ] ]
1783qed.
1784
1785definition ticks_of0: pseudo_assembly_program → Word → ? → nat × nat ≝
1786  λprogram: pseudo_assembly_program.
1787  λppc: Word.
1788  λfetched.
1789    match fetched with
1790    [ Instruction instr ⇒
1791      match instr with
1792      [ JC lbl ⇒
1793        match jump_expansion ppc program with
1794        [ short_jump ⇒ 〈2, 2〉
1795        | medium_jump ⇒ ?
1796        | long_jump ⇒ 〈4, 4〉
1797        ]
1798      | JNC lbl ⇒
1799        match jump_expansion ppc program with
1800        [ short_jump ⇒ 〈2, 2〉
1801        | medium_jump ⇒ ?
1802        | long_jump ⇒ 〈4, 4〉
1803        ]
1804      | JB bit lbl ⇒
1805        match jump_expansion ppc program with
1806        [ short_jump ⇒ 〈2, 2〉
1807        | medium_jump ⇒ ?
1808        | long_jump ⇒ 〈4, 4〉
1809        ]
1810      | JNB bit lbl ⇒
1811        match jump_expansion ppc program with
1812        [ short_jump ⇒ 〈2, 2〉
1813        | medium_jump ⇒ ?
1814        | long_jump ⇒ 〈4, 4〉
1815        ]
1816      | JBC bit lbl ⇒
1817        match jump_expansion ppc program with
1818        [ short_jump ⇒ 〈2, 2〉
1819        | medium_jump ⇒ ?
1820        | long_jump ⇒ 〈4, 4〉
1821        ]
1822      | JZ lbl ⇒
1823        match jump_expansion ppc program with
1824        [ short_jump ⇒ 〈2, 2〉
1825        | medium_jump ⇒ ?
1826        | long_jump ⇒ 〈4, 4〉
1827        ]
1828      | JNZ lbl ⇒
1829        match jump_expansion ppc program with
1830        [ short_jump ⇒ 〈2, 2〉
1831        | medium_jump ⇒ ?
1832        | long_jump ⇒ 〈4, 4〉
1833        ]
1834      | CJNE arg lbl ⇒
1835        match jump_expansion ppc program with
1836        [ short_jump ⇒ 〈2, 2〉
1837        | medium_jump ⇒ ?
1838        | long_jump ⇒ 〈4, 4〉
1839        ]
1840      | DJNZ arg lbl ⇒
1841        match jump_expansion ppc program with
1842        [ short_jump ⇒ 〈2, 2〉
1843        | medium_jump ⇒ ?
1844        | long_jump ⇒ 〈4, 4〉
1845        ]
1846      | ADD arg1 arg2 ⇒
1847        let ticks ≝ ticks_of_instruction (ADD ? arg1 arg2) in
1848         〈ticks, ticks〉
1849      | ADDC arg1 arg2 ⇒
1850        let ticks ≝ ticks_of_instruction (ADDC ? arg1 arg2) in
1851         〈ticks, ticks〉
1852      | SUBB arg1 arg2 ⇒
1853        let ticks ≝ ticks_of_instruction (SUBB ? arg1 arg2) in
1854         〈ticks, ticks〉
1855      | INC arg ⇒
1856        let ticks ≝ ticks_of_instruction (INC ? arg) in
1857         〈ticks, ticks〉
1858      | DEC arg ⇒
1859        let ticks ≝ ticks_of_instruction (DEC ? arg) in
1860         〈ticks, ticks〉
1861      | MUL arg1 arg2 ⇒
1862        let ticks ≝ ticks_of_instruction (MUL ? arg1 arg2) in
1863         〈ticks, ticks〉
1864      | DIV arg1 arg2 ⇒
1865        let ticks ≝ ticks_of_instruction (DIV ? arg1 arg2) in
1866         〈ticks, ticks〉
1867      | DA arg ⇒
1868        let ticks ≝ ticks_of_instruction (DA ? arg) in
1869         〈ticks, ticks〉
1870      | ANL arg ⇒
1871        let ticks ≝ ticks_of_instruction (ANL ? arg) in
1872         〈ticks, ticks〉
1873      | ORL arg ⇒
1874        let ticks ≝ ticks_of_instruction (ORL ? arg) in
1875         〈ticks, ticks〉
1876      | XRL arg ⇒
1877        let ticks ≝ ticks_of_instruction (XRL ? arg) in
1878         〈ticks, ticks〉
1879      | CLR arg ⇒
1880        let ticks ≝ ticks_of_instruction (CLR ? arg) in
1881         〈ticks, ticks〉
1882      | CPL arg ⇒
1883        let ticks ≝ ticks_of_instruction (CPL ? arg) in
1884         〈ticks, ticks〉
1885      | RL arg ⇒
1886        let ticks ≝ ticks_of_instruction (RL ? arg) in
1887         〈ticks, ticks〉
1888      | RLC arg ⇒
1889        let ticks ≝ ticks_of_instruction (RLC ? arg) in
1890         〈ticks, ticks〉
1891      | RR arg ⇒
1892        let ticks ≝ ticks_of_instruction (RR ? arg) in
1893         〈ticks, ticks〉
1894      | RRC arg ⇒
1895        let ticks ≝ ticks_of_instruction (RRC ? arg) in
1896         〈ticks, ticks〉
1897      | SWAP arg ⇒
1898        let ticks ≝ ticks_of_instruction (SWAP ? arg) in
1899         〈ticks, ticks〉
1900      | MOV arg ⇒
1901        let ticks ≝ ticks_of_instruction (MOV ? arg) in
1902         〈ticks, ticks〉
1903      | MOVX arg ⇒
1904        let ticks ≝ ticks_of_instruction (MOVX ? arg) in
1905         〈ticks, ticks〉
1906      | SETB arg ⇒
1907        let ticks ≝ ticks_of_instruction (SETB ? arg) in
1908         〈ticks, ticks〉
1909      | PUSH arg ⇒
1910        let ticks ≝ ticks_of_instruction (PUSH ? arg) in
1911         〈ticks, ticks〉
1912      | POP arg ⇒
1913        let ticks ≝ ticks_of_instruction (POP ? arg) in
1914         〈ticks, ticks〉
1915      | XCH arg1 arg2 ⇒
1916        let ticks ≝ ticks_of_instruction (XCH ? arg1 arg2) in
1917         〈ticks, ticks〉
1918      | XCHD arg1 arg2 ⇒
1919        let ticks ≝ ticks_of_instruction (XCHD ? arg1 arg2) in
1920         〈ticks, ticks〉
1921      | RET ⇒
1922        let ticks ≝ ticks_of_instruction (RET ?) in
1923         〈ticks, ticks〉
1924      | RETI ⇒
1925        let ticks ≝ ticks_of_instruction (RETI ?) in
1926         〈ticks, ticks〉
1927      | NOP ⇒
1928        let ticks ≝ ticks_of_instruction (NOP ?) in
1929         〈ticks, ticks〉
1930      ]
1931    | Comment comment ⇒ 〈0, 0〉
1932    | Cost cost ⇒ 〈0, 0〉
1933    | Jmp jmp ⇒ 〈2, 2〉
1934    | Call call ⇒ 〈2, 2〉
1935    | Mov dptr tgt ⇒ 〈2, 2〉
1936    ].
1937  cases not_implemented (* policy returned medium_jump for conditional jumping = impossible *)
1938qed.
1939
1940definition ticks_of: pseudo_assembly_program → Word → nat × nat ≝
1941  λprogram: pseudo_assembly_program.
1942  λppc: Word.
1943    let 〈preamble, pseudo〉 ≝ program in
1944    let 〈fetched, new_ppc〉 ≝ fetch_pseudo_instruction pseudo ppc in
1945     ticks_of0 program ppc fetched.
1946
1947lemma get_register_set_program_counter:
1948 ∀T,s,pc. get_register T (set_program_counter … s pc) = get_register … s.
1949 #T #s #pc %
1950qed.
1951
1952lemma get_8051_sfr_set_program_counter:
1953 ∀T,s,pc. get_8051_sfr T (set_program_counter … s pc) = get_8051_sfr … s.
1954 #T #s #pc %
1955qed.
1956
1957lemma get_bit_addressable_sfr_set_program_counter:
1958 ∀T,s,pc. get_bit_addressable_sfr T (set_program_counter … s pc) = get_bit_addressable_sfr … s.
1959 #T #s #pc %
1960qed.
1961
1962lemma low_internal_ram_set_program_counter:
1963 ∀T,s,pc. low_internal_ram T (set_program_counter … s pc) = low_internal_ram … s.
1964 #T #s #pc %
1965qed.
1966
1967lemma get_arg_8_set_program_counter:
1968 ∀n.∀l:Vector addressing_mode_tag (S n). ¬(is_in ? l ACC_PC) →
1969  ∀T,s,pc,b.∀arg:l.
1970   get_arg_8 T (set_program_counter … s pc) b arg = get_arg_8 … s b arg.
1971 [2,3: cases arg; *; normalize //]
1972 #n #l #H #T #s #pc #b * *; [11: #NH @⊥ //] #X try #Y %
1973qed.
1974
1975lemma set_bit_addressable_sfr_set_code_memory:
1976  ∀T, U: Type[0].
1977  ∀ps: PreStatus ?.
1978  ∀code_mem.
1979  ∀x.
1980  ∀val.
1981  set_bit_addressable_sfr ? (set_code_memory T U ps code_mem) x val =
1982  set_code_memory T U (set_bit_addressable_sfr ? ps x val) code_mem.
1983  #T #U #ps #code_mem #x #val
1984  whd in ⊢ (??%?)
1985  whd in ⊢ (???(???%?))
1986  cases (eqb ? 128) [ normalize nodelta cases not_implemented
1987  | normalize nodelta
1988  cases (eqb (nat_of_bitvector 8 x) ?) [ normalize nodelta cases not_implemented
1989  | normalize nodelta
1990  cases (eqb (nat_of_bitvector 8 x) ?) [ normalize nodelta cases not_implemented
1991  | normalize nodelta
1992  cases (eqb ? 176) [ normalize nodelta %
1993  | normalize nodelta
1994  cases (eqb ? 153) [ normalize nodelta %
1995  | normalize nodelta
1996  cases (eqb ? 138) [ normalize nodelta %
1997  | normalize nodelta
1998  cases (eqb ? 139) [ normalize nodelta %
1999  | normalize nodelta
2000  cases (eqb ? 140) [ normalize nodelta %
2001  | normalize nodelta
2002  cases (eqb ? 141) [ normalize nodelta %
2003  | normalize nodelta
2004  cases (eqb ? 200) [ normalize nodelta %
2005  | normalize nodelta
2006  cases (eqb ? 202) [ normalize nodelta %
2007  | normalize nodelta
2008  cases (eqb ? 203) [ normalize nodelta %
2009  | normalize nodelta
2010  cases (eqb ? 204) [ normalize nodelta %
2011  | normalize nodelta
2012  cases (eqb ? 205) [ normalize nodelta %
2013  | normalize nodelta
2014  cases (eqb ? 135) [ normalize nodelta %
2015  | normalize nodelta
2016  cases (eqb ? 136) [ normalize nodelta %
2017  | normalize nodelta
2018  cases (eqb ? 137) [ normalize nodelta %
2019  | normalize nodelta
2020  cases (eqb ? 152) [ normalize nodelta %
2021  | normalize nodelta
2022  cases (eqb ? 168) [ normalize nodelta %
2023  | normalize nodelta
2024  cases (eqb ? 184) [ normalize nodelta %
2025  | normalize nodelta
2026  cases (eqb ? 129) [ normalize nodelta %
2027  | normalize nodelta
2028  cases (eqb ? 130) [ normalize nodelta %
2029  | normalize nodelta
2030  cases (eqb ? 131) [ normalize nodelta %
2031  | normalize nodelta
2032  cases (eqb ? 208) [ normalize nodelta %
2033  | normalize nodelta
2034  cases (eqb ? 224) [ normalize nodelta %
2035  | normalize nodelta
2036  cases (eqb ? 240) [ normalize nodelta %
2037  | normalize nodelta
2038    cases not_implemented
2039  ]]]]]]]]]]]]]]]]]]]]]]]]]]
2040qed.
2041
2042lemma set_arg_8_set_code_memory:
2043  ∀n:nat.
2044  ∀l:Vector addressing_mode_tag (S n).
2045    ¬(is_in ? l ACC_PC) →
2046    ∀T: Type[0].
2047    ∀U: Type[0].
2048    ∀ps: PreStatus ?.
2049    ∀code_mem.
2050    ∀val.
2051    ∀b: l.
2052  set_arg_8 ? (set_code_memory T U ps code_mem) b val =
2053  set_code_memory T U (set_arg_8 ? ps b val) code_mem.
2054  [2,3: cases b; *; normalize //]
2055  #n #l #prf #T #U #ps #code_mem #val * *;
2056  [*:
2057    [1,2,3,4,8,9,15,16,17,18,19: #x]
2058    try #y whd in ⊢ (??(%)?)
2059    whd in ⊢ (???(???(%)?))
2060    [1,2:
2061      cases (split bool 4 4 ?)
2062      #nu' #nl'
2063      normalize nodelta
2064      cases (split bool 1 3 nu')
2065      #bit1' #ignore'
2066      normalize nodelta
2067      cases (get_index_v bool 4 nu' 0 ?)
2068      [1,2,3,4:
2069        normalize nodelta
2070        try %
2071        try (@(set_bit_addressable_sfr_set_code_memory T U ps code_mem x val))
2072        try (normalize in ⊢ (???(???%?)))
2073      ]
2074    |3,4: %
2075    |*:
2076       try normalize nodelta
2077       normalize cases (not_implemented)
2078    ]
2079 ]
2080 
2081
2082qed.
2083
2084axiom set_arg_8_set_program_counter:
2085  ∀n:nat.
2086  ∀l:Vector addressing_mode_tag (S n).
2087    ¬(is_in ? l ACC_PC) →
2088    ∀T: Type[0].
2089    ∀ps: PreStatus ?.
2090    ∀pc.
2091    ∀val.
2092    ∀b: l.
2093  set_arg_8 ? (set_program_counter T ps pc) b val =
2094  set_program_counter T (set_arg_8 ? ps b val) pc.
2095  [1,2: cases b; *; normalize //]
2096qed.
2097 
2098
2099lemma get_arg_8_set_code_memory:
2100 ∀T1,T2,s,code_mem,b,arg.
2101   get_arg_8 T1 (set_code_memory T2 T1 s code_mem) b arg = get_arg_8 … s b arg.
2102 #T1 #T2 #s #code_mem #b #arg %
2103qed.
2104
2105lemma set_code_memory_set_flags:
2106 ∀T1,T2,s,f1,f2,f3,code_mem.
2107  set_code_memory T1 T2 (set_flags T1 s f1 f2 f3) code_mem =
2108   set_flags … (set_code_memory … s code_mem) f1 f2 f3.
2109 #T1 #T2 #s #f1 #f2 #f3 #code_mem %
2110qed.
2111
2112lemma set_program_counter_set_flags:
2113 ∀T1,s,f1,f2,f3,pc.
2114  set_program_counter T1 (set_flags T1 s f1 f2 f3) pc =
2115   set_flags … (set_program_counter … s pc) f1 f2 f3.
2116 #T1 #s #f1 #f2 #f3 #pc  %
2117qed.
2118
2119lemma program_counter_set_flags:
2120 ∀T1,s,f1,f2,f3.
2121  program_counter T1 (set_flags T1 s f1 f2 f3) = program_counter … s.
2122 #T1 #s #f1 #f2 #f3 %
2123qed.
2124
2125lemma special_function_registers_8051_write_at_stack_pointer:
2126 ∀T,s,x.
2127    special_function_registers_8051 T (write_at_stack_pointer T s x)
2128  = special_function_registers_8051 T s.
2129 #T #s #x whd in ⊢ (??(??%)?)
2130 cases (split ????) #nu #nl normalize nodelta;
2131 cases (get_index_v bool ????) %
2132qed.
2133
2134lemma get_8051_sfr_write_at_stack_pointer:
2135 ∀T,s,x,y. get_8051_sfr T (write_at_stack_pointer T s x) y = get_8051_sfr T s y.
2136 #T #s #x #y whd in ⊢ (??%%) //
2137qed.
2138
2139lemma code_memory_write_at_stack_pointer:
2140 ∀T,s,x. code_memory T (write_at_stack_pointer T s x) = code_memory T s.
2141 #T #s #x whd in ⊢ (??(??%)?)
2142 cases (split ????) #nu #nl normalize nodelta;
2143 cases (get_index_v bool ????) %
2144qed.
2145
2146axiom low_internal_ram_write_at_stack_pointer:
2147 ∀T1,T2,M,s1,s2,s3.∀pbu,pbl,bu,bl,sp1,sp2:BitVector 8.
2148  get_8051_sfr ? s2 SFR_SP = get_8051_sfr ? s3 SFR_SP →
2149  low_internal_ram ? s2 = low_internal_ram T2 s3 →
2150  sp1 = \snd (half_add ? (get_8051_sfr ? s1 SFR_SP) (bitvector_of_nat 8 1)) →
2151  sp2 = \snd (half_add ? sp1 (bitvector_of_nat 8 1)) →
2152  bu@@bl = sigma (code_memory … s2) (pbu@@pbl) →
2153   low_internal_ram T1
2154     (write_at_stack_pointer ?
2155       (set_8051_sfr ?
2156         (write_at_stack_pointer ?
2157           (set_8051_sfr ?
2158             (set_low_internal_ram ? s1
2159               (low_internal_ram_of_pseudo_low_internal_ram M (low_internal_ram ? s2)))
2160             SFR_SP sp1)
2161          bl)
2162        SFR_SP sp2)
2163      bu)
2164   = low_internal_ram_of_pseudo_low_internal_ram (sp1::M)
2165      (low_internal_ram ?
2166       (write_at_stack_pointer ?
2167         (set_8051_sfr ?
2168           (write_at_stack_pointer ? (set_8051_sfr ? s3 SFR_SP sp1) pbl)
2169          SFR_SP sp2)
2170        pbu)).
2171       
2172axiom high_internal_ram_write_at_stack_pointer:
2173 ∀T1,T2,M,s1,s2,s3.∀pbu,pbl,bu,bl,sp1,sp2:BitVector 8.
2174  get_8051_sfr ? s2 SFR_SP = get_8051_sfr ? s3 SFR_SP →
2175  high_internal_ram ? s2 = high_internal_ram T2 s3 →
2176  sp1 = \snd (half_add ? (get_8051_sfr ? s1 SFR_SP) (bitvector_of_nat 8 1)) →
2177  sp2 = \snd (half_add ? sp1 (bitvector_of_nat 8 1)) →
2178  bu@@bl = sigma (code_memory … s2) (pbu@@pbl) →
2179   high_internal_ram T1
2180     (write_at_stack_pointer ?
2181       (set_8051_sfr ?
2182         (write_at_stack_pointer ?
2183           (set_8051_sfr ?
2184             (set_high_internal_ram ? s1
2185               (high_internal_ram_of_pseudo_high_internal_ram M (high_internal_ram ? s2)))
2186             SFR_SP sp1)
2187          bl)
2188        SFR_SP sp2)
2189      bu)
2190   = high_internal_ram_of_pseudo_high_internal_ram (sp1::M)
2191      (high_internal_ram ?
2192       (write_at_stack_pointer ?
2193         (set_8051_sfr ?
2194           (write_at_stack_pointer ? (set_8051_sfr ? s3 SFR_SP sp1) pbl)
2195          SFR_SP sp2)
2196        pbu)).
2197
2198lemma set_program_counter_set_low_internal_ram:
2199 ∀T,s,x,y.
2200  set_program_counter T (set_low_internal_ram … s x) y =
2201   set_low_internal_ram … (set_program_counter … s y) x.
2202 //
2203qed.
2204
2205lemma set_clock_set_low_internal_ram:
2206 ∀T,s,x,y.
2207  set_clock T (set_low_internal_ram … s x) y =
2208   set_low_internal_ram … (set_clock … s y) x.
2209 //
2210qed.
2211
2212lemma set_program_counter_set_high_internal_ram:
2213 ∀T,s,x,y.
2214  set_program_counter T (set_high_internal_ram … s x) y =
2215   set_high_internal_ram … (set_program_counter … s y) x.
2216 //
2217qed.
2218
2219lemma set_clock_set_high_internal_ram:
2220 ∀T,s,x,y.
2221  set_clock T (set_high_internal_ram … s x) y =
2222   set_high_internal_ram … (set_clock … s y) x.
2223 //
2224qed.
2225
2226lemma set_low_internal_ram_set_high_internal_ram:
2227 ∀T,s,x,y.
2228  set_low_internal_ram T (set_high_internal_ram … s x) y =
2229   set_high_internal_ram … (set_low_internal_ram … s y) x.
2230 //
2231qed.
2232
2233lemma external_ram_write_at_stack_pointer:
2234 ∀T,s,x. external_ram T (write_at_stack_pointer T s x) = external_ram T s.
2235 #T #s #x whd in ⊢ (??(??%)?)
2236 cases (split ????) #nu #nl normalize nodelta;
2237 cases (get_index_v bool ????) %
2238qed.
2239
2240lemma special_function_registers_8052_write_at_stack_pointer:
2241 ∀T,s,x.
2242    special_function_registers_8052 T (write_at_stack_pointer T s x)
2243  = special_function_registers_8052 T s.
2244 #T #s #x whd in ⊢ (??(??%)?)
2245 cases (split ????) #nu #nl normalize nodelta;
2246 cases (get_index_v bool ????) %
2247qed.
2248
2249lemma p1_latch_write_at_stack_pointer:
2250 ∀T,s,x. p1_latch T (write_at_stack_pointer T s x) = p1_latch T s.
2251 #T #s #x whd in ⊢ (??(??%)?)
2252 cases (split ????) #nu #nl normalize nodelta;
2253 cases (get_index_v bool ????) %
2254qed.
2255
2256lemma p3_latch_write_at_stack_pointer:
2257 ∀T,s,x. p3_latch T (write_at_stack_pointer T s x) = p3_latch T s.
2258 #T #s #x whd in ⊢ (??(??%)?)
2259 cases (split ????) #nu #nl normalize nodelta;
2260 cases (get_index_v bool ????) %
2261qed.
2262
2263lemma clock_write_at_stack_pointer:
2264 ∀T,s,x. clock T (write_at_stack_pointer T s x) = clock T s.
2265 #T #s #x whd in ⊢ (??(??%)?)
2266 cases (split ????) #nu #nl normalize nodelta;
2267 cases (get_index_v bool ????) %
2268qed.
2269
2270axiom get_index_v_set_index:
2271 ∀T,n,x,m,p,y. get_index_v T n (set_index T n x m y p) m p = y.
2272
2273lemma get_8051_sfr_set_8051_sfr:
2274 ∀T,s,x,y. get_8051_sfr T (set_8051_sfr ? s x y) x = y.
2275 #T *; #A #B #C #D #E #F #G #H #I #J *; #y whd in ⊢ (??(??%?)?)
2276 whd in match get_8051_sfr; normalize nodelta @get_index_v_set_index
2277qed.
2278
2279lemma program_counter_set_8051_sfr:
2280 ∀T,s,x,y. program_counter T (set_8051_sfr ? s x y) = program_counter ? s.
2281 //
2282qed.
2283
2284lemma eq_rect_Type1_r:
2285  ∀A: Type[1].
2286  ∀a:A.
2287  ∀P: ∀x:A. eq ? x a → Type[1]. P a (refl A a) → ∀x: A.∀p:eq ? x a. P x p.
2288  #A #a #P #H #x #p
2289  generalize in match H
2290  generalize in match P
2291  cases p
2292  //
2293qed.
2294
2295lemma split_eq_status:
2296 ∀T.
2297 ∀A1,A2,A3,A4,A5,A6,A7,A8,A9,A10.
2298 ∀B1,B2,B3,B4,B5,B6,B7,B8,B9,B10.
2299  A1=B1 → A2=B2 → A3=B3 → A4=B4 → A5=B5 → A6=B6 → A7=B7 → A8=B8 → A9=B9 → A10=B10 →
2300   mk_PreStatus T A1 A2 A3 A4 A5 A6 A7 A8 A9 A10 =
2301   mk_PreStatus T B1 B2 B3 B4 B5 B6 B7 B8 B9 B10.
2302 //
2303qed.
2304
2305axiom pair_elim':
2306  ∀A,B,C: Type[0].
2307  ∀T: A → B → C.
2308  ∀p.
2309  ∀P: A×B → C → Prop.
2310    (∀lft, rgt. p = 〈lft,rgt〉 → P 〈lft,rgt〉 (T lft rgt)) →
2311      P p (let 〈lft, rgt〉 ≝ p in T lft rgt).
2312
2313axiom pair_elim'':
2314  ∀A,B,C,C': Type[0].
2315  ∀T: A → B → C.
2316  ∀T': A → B → C'.
2317  ∀p.
2318  ∀P: A×B → C → C' → Prop.
2319    (∀lft, rgt. p = 〈lft,rgt〉 → P 〈lft,rgt〉 (T lft rgt) (T' lft rgt)) →
2320      P p (let 〈lft, rgt〉 ≝ p in T lft rgt) (let 〈lft, rgt〉 ≝ p in T' lft rgt).
2321
2322axiom split_elim':
2323  ∀A: Type[0].
2324  ∀B: Type[1].
2325  ∀l, m, v.
2326  ∀T: Vector A l → Vector A m → B.
2327  ∀P: B → Prop.
2328    (∀lft, rgt. v = lft @@ rgt → P (T lft rgt)) →
2329      P (let 〈lft, rgt〉 ≝ split A l m v in T lft rgt).
2330
2331axiom split_elim'':
2332  ∀A: Type[0].
2333  ∀B,B': Type[1].
2334  ∀l, m, v.
2335  ∀T: Vector A l → Vector A m → B.
2336  ∀T': Vector A l → Vector A m → B'.
2337  ∀P: B → B' → Prop.
2338    (∀lft, rgt. v = lft @@ rgt → P (T lft rgt) (T' lft rgt)) →
2339      P (let 〈lft, rgt〉 ≝ split A l m v in T lft rgt)
2340        (let 〈lft, rgt〉 ≝ split A l m v in T' lft rgt).
2341
2342axiom split_append:
2343  ∀A: Type[0].
2344  ∀m, n: nat.
2345  ∀v, v': Vector A m.
2346  ∀q, q': Vector A n.
2347    let 〈v', q'〉 ≝ split A m n (v@@q) in
2348      v = v' ∧ q = q'.
2349
2350axiom split_vector_singleton:
2351  ∀A: Type[0].
2352  ∀n: nat.
2353  ∀v: Vector A (S n).
2354  ∀rest: Vector A n.
2355  ∀s: Vector A 1.
2356  ∀prf.
2357    v = s @@ rest →
2358    ((get_index_v A ? v 0 prf) ::: rest) = v.
2359
2360axiom sub_minus_one_seven_eight:
2361  ∀v: BitVector 7.
2362  false ::: (\fst (sub_7_with_carry v (bitvector_of_nat ? 1) false)) =
2363  \fst (sub_8_with_carry (false ::: v) (bitvector_of_nat ? 1) false).
2364
2365lemma pair_destruct_1:
2366 ∀A,B.∀a:A.∀b:B.∀c. 〈a,b〉 = c → a = \fst c.
2367 #A #B #a #b *; /2/
2368qed.
2369
2370lemma pair_destruct_2:
2371 ∀A,B.∀a:A.∀b:B.∀c. 〈a,b〉 = c → b = \snd c.
2372 #A #B #a #b *; /2/
2373qed.
2374
2375(*
2376lemma blah:
2377  ∀m: internal_pseudo_address_map.
2378  ∀s: PseudoStatus.
2379  ∀arg: Byte.
2380  ∀b: bool.
2381    addressing_mode_ok m s (DIRECT arg) = true →
2382      get_arg_8 ? (set_low_internal_ram ? s (low_internal_ram_of_pseudo_low_internal_ram m (low_internal_ram ? s))) b (DIRECT arg) =
2383      get_arg_8 ? s b (DIRECT arg).
2384  [2, 3: normalize % ]
2385  #m #s #arg #b #hyp
2386  whd in ⊢ (??%%)
2387  @split_elim''
2388  #nu' #nl' #arg_nu_nl_eq
2389  normalize nodelta
2390  generalize in match (refl ? (get_index_v bool 4 nu' ? ?))
2391  cases (get_index_v bool 4 nu' ? ?) in ⊢ (??%? → %)
2392  #get_index_v_eq
2393  normalize nodelta
2394  [2:
2395    normalize nodelta
2396    @split_elim''
2397    #bit_one' #three_bits' #bit_one_three_bit_eq
2398    generalize in match (low_internal_ram_of_pseudo_internal_ram_miss m s (three_bits'@@nl'))
2399    normalize nodelta
2400    generalize in match (refl ? (sub_7_with_carry ? ? ?))
2401    cases (sub_7_with_carry ? ? ?) in ⊢ (??%? → %)
2402    #Saddr #carr' #Saddr_carr_eq
2403    normalize nodelta
2404    #carr_hyp'
2405    @carr_hyp'
2406    [1:
2407    |2: whd in hyp:(??%?); generalize in match hyp; -hyp;
2408        generalize in match (refl ? (¬(member (BitVector 8) ? arg m)))
2409        cases (¬(member (BitVector 8) ? arg m)) in ⊢ (??%? → %)
2410        #member_eq
2411        normalize nodelta
2412        [2: #destr destruct(destr)
2413        |1: -carr_hyp';
2414            >arg_nu_nl_eq
2415            <(split_vector_singleton ? ? nu' ? ? ? bit_one_three_bit_eq)
2416            [1: >get_index_v_eq in ⊢ (??%? → ?)
2417            |2: @le_S @le_S @le_S @le_n
2418            ]
2419            cases (member (BitVector 8) ? (\fst ?) ?)
2420            [1: #destr normalize in destr; destruct(destr)
2421            |2:
2422            ]
2423        ]
2424    |3: >get_index_v_eq in ⊢ (??%?)
2425        change in ⊢ (??(???%?)?) with ((? ::: three_bits') @@ nl')
2426        >(split_vector_singleton … bit_one_three_bit_eq)
2427        <arg_nu_nl_eq
2428        whd in hyp:(??%?)
2429        cases (member (BitVector 8) (eq_bv 8) arg m) in hyp
2430        normalize nodelta [*: #ignore @sym_eq ]
2431    ]
2432  |
2433  ].
2434*)
2435(*
2436map_address0 ... (DIRECT arg) = Some .. →
2437  get_arg_8 (map_address0 ... (internal_ram ...) (DIRECT arg) =
2438  get_arg_8 (internal_ram ...) (DIRECT arg)
2439
2440((if addressing_mode_ok M ps ACC_A∧addressing_mode_ok M ps (DIRECT ARG2) 
2441                     then Some internal_pseudo_address_map M 
2442                     else None internal_pseudo_address_map )
2443                    =Some internal_pseudo_address_map M')
2444*)
2445
2446lemma main_thm:
2447 ∀M,M',ps,s,s''.
2448  next_internal_pseudo_address_map M ps = Some … M' →
2449  status_of_pseudo_status M ps = Some … s →
2450  status_of_pseudo_status M' (execute_1_pseudo_instruction (ticks_of (code_memory … ps)) ps) = Some … s'' →
2451   ∃n. execute n s = s''.
2452 #M #M' #ps #s #s''
2453 generalize in match (fetch_assembly_pseudo2 (code_memory … ps))
2454 whd in ⊢ (? → ? → ??%? → ??%? → ?)
2455 >execute_1_pseudo_instruction_preserves_code_memory
2456 generalize in match (refl … (assembly (code_memory … ps)))
2457 generalize in match (assembly (code_memory … ps)) in ⊢ (??%? → %) #ASS whd in ⊢ (???% → ?)
2458 cases (build_maps (code_memory … ps))
2459  [ cases (code_memory … ps) #preamble #instr_list whd in ⊢ (???% → ?) #EQ >EQ #H #MAP
2460    #abs @⊥ normalize in abs; destruct (abs) ]
2461 * #labels #costs change in ⊢ (? → ? → ??%? → ?) with (next_internal_pseudo_address_map0 ? ? ? ?)
2462 generalize in match (refl … (code_memory … ps)) cases (code_memory … ps) in ⊢ (???% → %) #preamble #instr_list #EQ0 normalize nodelta;
2463 generalize in ⊢ (???(match % with [_ ⇒ ? | _ ⇒ ?]) → ?) *; normalize nodelta;
2464  [ #EQ >EQ #_ #_ #abs @⊥ normalize in abs; destruct (abs) ]
2465 * #final_ppc * #final_pc #assembled #EQ >EQ -EQ ASS; normalize nodelta;
2466 #H generalize in match (H ??? (refl …) (refl …)) -H; #H;
2467 #MAP
2468 #H1 generalize in match (option_destruct_Some ??? H1) -H1; #H1 <H1 -H1;
2469 #H2 generalize in match (option_destruct_Some ??? H2) -H2; #H2 <H2 -H2;
2470 change with
2471  (∃n.
2472    execute n
2473     (set_low_internal_ram ?
2474       (set_high_internal_ram ?
2475         (set_program_counter ?
2476           (set_code_memory ?? ps (load_code_memory assembled))
2477          (sigma 〈preamble,instr_list〉 (program_counter ? ps)))
2478        (high_internal_ram_of_pseudo_high_internal_ram M ?))
2479      (low_internal_ram_of_pseudo_low_internal_ram M ?))
2480   = set_low_internal_ram ?
2481      (set_high_internal_ram ?
2482        (set_program_counter ?
2483          (set_code_memory ?? (execute_1_pseudo_instruction ? ps) (load_code_memory assembled))
2484         (sigma ??))
2485       ?)
2486     ?)
2487 whd in match (\snd 〈preamble,instr_list〉) in H;
2488 whd in match (\fst 〈preamble,instr_list〉) in H;
2489 whd in match (\snd 〈final_pc,assembled〉) in H;
2490 whd in match (\snd 〈preamble,instr_list〉) in MAP;
2491 -s s'' labels costs final_ppc final_pc;
2492 letin ps' ≝ (execute_1_pseudo_instruction (ticks_of 〈preamble,instr_list〉) ps)
2493 (* NICE STATEMENT HERE *)
2494 generalize in match (refl … ps') generalize in ⊢ (??%? → ?) normalize nodelta; -ps'; #ps'
2495 #K <K generalize in match K; -K;
2496 (* STATEMENT WITH EQUALITY HERE *)
2497 whd in ⊢ (???(?%?) → ?)
2498 whd in ⊢ (???% → ?) generalize in match (H (program_counter … ps)) -H; >EQ0 normalize nodelta;
2499 cases (fetch_pseudo_instruction instr_list (program_counter … ps)) in MAP ⊢ %
2500 #pi #newppc normalize nodelta; #MAP * #instructions *;
2501 cases pi in MAP; normalize nodelta;
2502  [2,3: (* Comment, Cost *) #ARG #MAP #H1 #H2 #EQ %[1,3:@0]
2503    generalize in match (option_destruct_Some ??? MAP) -MAP; #MAP <MAP -MAP M';
2504    normalize in H1; generalize in match (option_destruct_Some ??? H1) #K1 >K1 in H2; whd in ⊢ (% → ?)
2505    #H2 >(eq_bv_to_eq … H2) >EQ %
2506(*  |6: (* Mov *) #arg1 #arg2
2507       #H1 #H2 #EQ %[@1]
2508       normalize in H1; generalize in match (option_destruct_Some ??? H1) #K1 >K1 in H2; whd in ⊢ (% → ?)
2509       change in ⊢ (? → ??%?) with (execute_1_0 ??)
2510       cases (fetch (load_code_memory assembled) (sigma 〈preamble,instr_list〉 (program_counter … ps))) * #instr #newppc' #ticks normalize nodelta;
2511       * * #H2a #H2b whd in ⊢ (% → ?) #H2c
2512       >H2b >(eq_instruction_to_eq … H2a)
2513       generalize in match EQ; -EQ; whd in ⊢ (???% → ??%?);
2514       @(list_addressing_mode_tags_elim_prop … arg1) whd try % -arg1; whd in ⊢ (???% → ??%?)
2515       @(list_addressing_mode_tags_elim_prop … arg2) whd try % -arg2; #ARG2
2516       normalize nodelta;
2517       [1,2,3,4,5,6,7,8: cases (add_8_with_carry ???) |*: cases (sub_8_with_carry ???)]
2518       #result #flags
2519       #EQ >EQ -EQ; normalize nodelta; >(eq_bv_to_eq … H2c) % *)
2520  |5: (* Call *) #label #MAP
2521      generalize in match (option_destruct_Some ??? MAP) -MAP; #MAP <MAP -MAP;
2522      whd in ⊢ (???% → ?) cases (jump_expansion ??) normalize nodelta;
2523       [ (* short *) #abs @⊥ destruct (abs)
2524       |3: (* long *) #H1 #H2 #EQ %[@1]
2525           (* normalize in H1; !!!*) generalize in match (option_destruct_Some ??? H1) #K1 >K1 in H2; whd in ⊢ (% → ?)
2526           change in ⊢ (? → ??%?) with (execute_1_0 ??)
2527           cases (fetch (load_code_memory assembled) (sigma 〈preamble,instr_list〉 (program_counter … ps))) * #instr #newppc' #ticks normalize nodelta;
2528           * * #H2a #H2b whd in ⊢ (% → ?) #H2c
2529           >H2b >(eq_instruction_to_eq … H2a)
2530           generalize in match EQ; -EQ;
2531           whd in ⊢ (???% → ??%?);
2532           generalize in match (refl … (half_add 8 (get_8051_sfr ? ps SFR_SP) (bitvector_of_nat ? 1))) cases (half_add ???) in ⊢ (??%? → %) #carry #new_sp #EQ1 normalize nodelta;
2533           >(eq_bv_to_eq … H2c)
2534           change with
2535            ((?=let 〈ppc_bu,ppc_bl〉 ≝ split bool 8 8 newppc in ?) →
2536                (let 〈pc_bu,pc_bl〉 ≝ split bool 8 8 (sigma 〈preamble,instr_list〉 newppc) in ?)=?)
2537           generalize in match (refl … (split … 8 8 newppc)) cases (split bool 8 8 newppc) in ⊢ (??%? → %) #ppc_bu #ppc_bl #EQppc
2538           generalize in match (refl … (split … 8 8 (sigma 〈preamble,instr_list〉 newppc))) cases (split bool 8 8 (sigma 〈preamble,instr_list〉 newppc)) in ⊢ (??%? → %) #pc_bu #pc_bl #EQpc normalize nodelta;
2539           >get_8051_sfr_write_at_stack_pointer >get_8051_sfr_write_at_stack_pointer
2540           >get_8051_sfr_set_8051_sfr >get_8051_sfr_set_8051_sfr
2541           generalize in match (refl … (half_add ? new_sp (bitvector_of_nat ? 1))) cases (half_add ???) in ⊢ (??%? → %) #carry' #new_sp' #EQ2 normalize nodelta;
2542           #EQ >EQ -EQ; normalize nodelta; >(eq_bv_to_eq … H2c)
2543           @split_eq_status;
2544            [ >code_memory_write_at_stack_pointer whd in ⊢ (??%?)
2545              >code_memory_write_at_stack_pointer %
2546            | >set_program_counter_set_low_internal_ram
2547              >set_clock_set_low_internal_ram
2548              @low_internal_ram_write_at_stack_pointer
2549               [ % | %
2550               | @(pair_destruct_2 … EQ1)
2551               | @(pair_destruct_2 … EQ2)
2552               | >(pair_destruct_1 ????? EQpc)
2553                 >(pair_destruct_2 ????? EQpc)
2554                 @split_elim #x #y #H <H -x y H;
2555                 >(pair_destruct_1 ????? EQppc)
2556                 >(pair_destruct_2 ????? EQppc)
2557                 @split_elim #x #y #H <H -x y H;
2558                 >EQ0 % ]
2559            | >set_low_internal_ram_set_high_internal_ram
2560              >set_program_counter_set_high_internal_ram
2561              >set_clock_set_high_internal_ram
2562              @high_internal_ram_write_at_stack_pointer
2563               [ % | %
2564               | @(pair_destruct_2 … EQ1)
2565               | @(pair_destruct_2 … EQ2)
2566               | >(pair_destruct_1 ????? EQpc)
2567                 >(pair_destruct_2 ????? EQpc)
2568                 @split_elim #x #y #H <H -x y H;
2569                 >(pair_destruct_1 ????? EQppc)
2570                 >(pair_destruct_2 ????? EQppc)
2571                 @split_elim #x #y #H <H -x y H;
2572                 >EQ0 % ]           
2573            | >external_ram_write_at_stack_pointer whd in ⊢ (??%?)
2574              >external_ram_write_at_stack_pointer whd in ⊢ (???%)
2575              >external_ram_write_at_stack_pointer whd in ⊢ (???%)
2576              >external_ram_write_at_stack_pointer %
2577            | change with (? = sigma ?(address_of_word_labels_code_mem (\snd (code_memory ? ps)) ?))
2578              >EQ0 %
2579            | >special_function_registers_8051_write_at_stack_pointer whd in ⊢ (??%?)
2580              >special_function_registers_8051_write_at_stack_pointer whd in ⊢ (???%)
2581              >special_function_registers_8051_write_at_stack_pointer whd in ⊢ (???%)
2582              >special_function_registers_8051_write_at_stack_pointer %
2583            | >special_function_registers_8052_write_at_stack_pointer whd in ⊢ (??%?)
2584              >special_function_registers_8052_write_at_stack_pointer whd in ⊢ (???%)
2585              >special_function_registers_8052_write_at_stack_pointer whd in ⊢ (???%)
2586              >special_function_registers_8052_write_at_stack_pointer %
2587            | >p1_latch_write_at_stack_pointer whd in ⊢ (??%?)
2588              >p1_latch_write_at_stack_pointer whd in ⊢ (???%)
2589              >p1_latch_write_at_stack_pointer whd in ⊢ (???%)
2590              >p1_latch_write_at_stack_pointer %
2591            | >p3_latch_write_at_stack_pointer whd in ⊢ (??%?)
2592              >p3_latch_write_at_stack_pointer whd in ⊢ (???%)
2593              >p3_latch_write_at_stack_pointer whd in ⊢ (???%)
2594              >p3_latch_write_at_stack_pointer %
2595            | >clock_write_at_stack_pointer whd in ⊢ (??%?)
2596              >clock_write_at_stack_pointer whd in ⊢ (???%)
2597              >clock_write_at_stack_pointer whd in ⊢ (???%)
2598              >clock_write_at_stack_pointer %]
2599       | (* medium *)  #H1 #H2 #EQ %[@1] generalize in match H1; -H1;
2600         @pair_elim' #fst_5_addr #rest_addr #EQ1
2601         @pair_elim' #fst_5_pc #rest_pc #EQ2
2602         generalize in match (refl … (eq_bv … fst_5_addr fst_5_pc))
2603         cases (eq_bv ???) in ⊢ (??%? → %) normalize nodelta; #EQ3 #TEQ [2: destruct (TEQ)]
2604         generalize in match (option_destruct_Some ??? TEQ) -TEQ; #K1 >K1 in H2; whd in ⊢ (% → ?)
2605         change in ⊢ (? →??%?) with (execute_1_0 ??)
2606         @pair_elim' * #instr #newppc' #ticks #EQn
2607          * * #H2a #H2b whd in ⊢ (% → ?) #H2c >H2b >(eq_instruction_to_eq … H2a) whd in ⊢ (??%?)
2608          generalize in match EQ; -EQ; normalize nodelta; >(eq_bv_to_eq … H2c)
2609          @pair_elim' #carry #new_sp change with (half_add ? (get_8051_sfr ? ps ?) ? = ? → ?) #EQ4
2610          @split_elim' #pc_bu #pc_bl >program_counter_set_8051_sfr XXX change with (newppc = ?) #EQ5
2611          @pair_elim' #carry' #new_sp' #EQ6 normalize nodelta; #EQx >EQx -EQx;
2612          change in ⊢ (??(match ????% with [_ ⇒ ?])?) with (sigma … newppc)
2613          @split_elim' #pc_bu' #pc_bl' #EQ7 change with (newppc' = ? → ?)
2614          >get_8051_sfr_set_8051_sfr
2615         
2616          whd in EQ:(???%) ⊢ ? >EQ -EQ; normalize nodelta; >(eq_bv_to_eq … H2c) whd in ⊢ (??%?)
2617           change with ((let 〈pc_bu,pc_bl〉 ≝ split bool 8 8 (sigma 〈preamble,instr_list〉 newppc) in ?)=?)
2618           generalize in match (refl … (split bool 8 8 (sigma 〈preamble,instr_list〉 newppc)))
2619           cases (split ????) in ⊢ (??%? → %) #pc_bu #pc_bl normalize nodelta; #EQ4
2620           generalize in match (refl … (split bool 4 4 pc_bu))
2621           cases (split ????) in ⊢ (??%? → %) #nu #nl normalize nodelta; #EQ5
2622           generalize in match (refl … (split bool 3 8 rest_addr))
2623           cases (split ????) in ⊢ (??%? → %) #relevant1 #relevant2 normalize nodelta; #EQ6
2624           change with ((let 〈carry,new_pc〉 ≝ half_add ? (sigma … newppc) ? in ?) = ?)
2625           generalize in match
2626            (refl …
2627             (half_add 16 (sigma 〈preamble,instr_list〉 newppc)
2628             ((nu@@get_index' bool 0 3 nl:::relevant1)@@relevant2)))
2629           cases (half_add ???) in ⊢ (??%? → %) #carry #new_pc normalize nodelta; #EQ7
2630           @split_eq_status try %
2631            [ change with (? = sigma ? (address_of_word_labels ps label))
2632              (* ARITHMETICS, BUT THE GOAL SEEMS FALSE *)
2633            | whd in ⊢ (??%%) whd in ⊢ (??(?%?)?) whd in ⊢ (??(?(match ?(?%)? with [_ ⇒ ?])?)?)
2634              @(bitvector_3_elim_prop … (\fst (split bool 3 8 rest_addr))) %]] *)
2635  |4: (* Jmp *) #label #MAP
2636      generalize in match (option_destruct_Some ??? MAP) -MAP; #MAP >MAP -MAP;
2637      whd in ⊢ (???% → ?) cases (jump_expansion ??) normalize nodelta;
2638       [3: (* long *) #H1 #H2 #EQ %[@1]
2639           (* normalize in H1; !!!*) generalize in match (option_destruct_Some ??? H1) #K1 >K1 in H2; whd in ⊢ (% → ?)
2640           change in ⊢ (? → ??%?) with (execute_1_0 ??)
2641           cases (fetch (load_code_memory assembled) (sigma 〈preamble,instr_list〉 (program_counter … ps))) * #instr #newppc' #ticks normalize nodelta;
2642           * * #H2a #H2b whd in ⊢ (% → ?) #H2c
2643           >H2b >(eq_instruction_to_eq … H2a)
2644           generalize in match EQ; -EQ;
2645           #EQ >EQ -EQ; normalize nodelta; >(eq_bv_to_eq … H2c)
2646           cases ps in EQ0 ⊢ %; #A1 #A2 #A3 #A4 #A5 #A6 #A7 #A8 #A9 #A10 #XXXX >XXXX %
2647       |1: (* short *) #H1 #H2 #EQ %[@1] generalize in match H1; -H1;
2648           generalize in match
2649            (refl ?
2650             (sub_16_with_carry
2651              (sigma 〈preamble,instr_list〉 (program_counter … ps))
2652              (sigma 〈preamble,instr_list〉 (address_of_word_labels_code_mem instr_list label))
2653              false))
2654           cases (sub_16_with_carry ???) in ⊢ (??%? → %); #results #flags normalize nodelta;
2655           generalize in match (refl … (split … 8 8 results)) cases (split ????) in ⊢ (??%? → %) #upper #lower normalize nodelta;
2656           generalize in match (refl … (eq_bv … upper (zero 8))) cases (eq_bv ???) in ⊢ (??%? → %) normalize nodelta;
2657           #EQ1 #EQ2 #EQ3 #H1 [2: @⊥ destruct (H1)]
2658           generalize in match (option_destruct_Some ??? H1) #K1 >K1 in H2; whd in ⊢ (% → ?)
2659           change in ⊢ (? → ??%?) with (execute_1_0 ??)
2660           cases (fetch (load_code_memory assembled) (sigma 〈preamble,instr_list〉 (program_counter … ps))) * #instr #newppc' #ticks normalize nodelta;
2661           * * #H2a #H2b whd in ⊢ (% → ?) #H2c
2662           >H2b >(eq_instruction_to_eq … H2a)
2663           generalize in match EQ; -EQ;
2664           whd in ⊢ (???% → ?);
2665           #EQ >EQ -EQ; normalize nodelta; >(eq_bv_to_eq … H2c)
2666           change with ((let 〈carry,new_pc〉 ≝ half_add ? (sigma ??) ? in ?) = ?)
2667           generalize in match (refl … (half_add 16 (sigma 〈preamble,instr_list〉 newppc) (sign_extension lower)))
2668           cases (half_add ???) in ⊢ (??%? → %) #carry #newpc normalize nodelta #EQ4
2669           @split_eq_status try % change with (newpc = sigma ? (address_of_word_labels ps label))
2670           (* ARITHMETICS, BUT THE GOAL SEEMS FALSE *)
2671       | (* medium *)  #H1 #H2 #EQ %[@1] generalize in match H1; -H1;
2672         generalize in match
2673          (refl …
2674            (split … 5 11 (sigma 〈preamble,instr_list〉 (address_of_word_labels_code_mem instr_list label))))
2675         cases (split ????) in ⊢ (??%? → %) #fst_5_addr #rest_addr normalize nodelta; #EQ1
2676         generalize in match
2677          (refl …
2678            (split … 5 11 (sigma 〈preamble,instr_list〉 (program_counter … ps))))
2679         cases (split ????) in ⊢ (??%? → %) #fst_5_pc #rest_pc normalize nodelta; #EQ2
2680         generalize in match (refl … (eq_bv … fst_5_addr fst_5_pc))
2681         cases (eq_bv ???) in ⊢ (??%? → %) normalize nodelta; #EQ3 #TEQ [2: destruct (TEQ)]
2682         generalize in match (option_destruct_Some ??? TEQ) -TEQ; #K1 >K1 in H2; whd in ⊢ (% → ?)
2683         change in ⊢ (? →??%?) with (execute_1_0 ??)
2684           cases (fetch (load_code_memory assembled) (sigma 〈preamble,instr_list〉 (program_counter … ps))) * #instr #newppc' #ticks normalize nodelta;
2685           * * #H2a #H2b whd in ⊢ (% → ?) #H2c
2686           >H2b >(eq_instruction_to_eq … H2a)
2687           generalize in match EQ; -EQ;
2688           whd in ⊢ (???% → ?);
2689           #EQ >EQ -EQ; normalize nodelta; >(eq_bv_to_eq … H2c) whd in ⊢ (??%?)
2690           change with ((let 〈pc_bu,pc_bl〉 ≝ split bool 8 8 (sigma 〈preamble,instr_list〉 newppc) in ?)=?)
2691           generalize in match (refl … (split bool 8 8 (sigma 〈preamble,instr_list〉 newppc)))
2692           cases (split ????) in ⊢ (??%? → %) #pc_bu #pc_bl normalize nodelta; #EQ4
2693           generalize in match (refl … (split bool 4 4 pc_bu))
2694           cases (split ????) in ⊢ (??%? → %) #nu #nl normalize nodelta; #EQ5
2695           generalize in match (refl … (split bool 3 8 rest_addr))
2696           cases (split ????) in ⊢ (??%? → %) #relevant1 #relevant2 normalize nodelta; #EQ6
2697           change with ((let 〈carry,new_pc〉 ≝ half_add ? (sigma … newppc) ? in ?) = ?)
2698           generalize in match
2699            (refl …
2700             (half_add 16 (sigma 〈preamble,instr_list〉 newppc)
2701             ((nu@@get_index' bool 0 3 nl:::relevant1)@@relevant2)))
2702           cases (half_add ???) in ⊢ (??%? → %) #carry #new_pc normalize nodelta; #EQ7   
2703           @split_eq_status try %
2704            [ change with (? = sigma ? (address_of_word_labels ps label))
2705              (* ARITHMETICS, BUT THE GOAL SEEMS FALSE *)
2706            | whd in ⊢ (??%%) whd in ⊢ (??(?%?)?) whd in ⊢ (??(?(match ?(?%)? with [_ ⇒ ?])?)?)
2707              @(bitvector_3_elim_prop … (\fst (split bool 3 8 rest_addr))) %]]
2708  | (* Instruction *) -pi;  whd in ⊢ (? → ??%? → ?) *; normalize nodelta;
2709    [1,2,3: (* ADD, ADDC, SUBB *) #arg1 #arg2 #MAP #H1 #H2 #EQ %[1,3,5:@1]
2710       normalize in H1; generalize in match (option_destruct_Some ??? H1) #K1 >K1 in H2; whd in ⊢ (% → ?)
2711       change in ⊢ (? → ??%?) with (execute_1_0 ??)
2712       cases (fetch (load_code_memory assembled) (sigma 〈preamble,instr_list〉 (program_counter … ps))) * #instr #newppc' #ticks normalize nodelta;
2713       * * #H2a #H2b whd in ⊢ (% → ?) #H2c
2714       >H2b >(eq_instruction_to_eq … H2a)
2715       generalize in match EQ; -EQ; whd in ⊢ (???% → ??%?); generalize in match MAP; -MAP;
2716       @(list_addressing_mode_tags_elim_prop … arg1) whd try % -arg1;
2717       @(list_addressing_mode_tags_elim_prop … arg2) whd try % -arg2; #ARG2
2718       normalize nodelta; #MAP;
2719       [1: change in ⊢ (? → %) with
2720        ((let 〈result,flags〉 ≝
2721          add_8_with_carry
2722           (get_arg_8 ? ps false ACC_A)
2723           (get_arg_8 ?
2724             (set_low_internal_ram ? ps (low_internal_ram_of_pseudo_low_internal_ram M (low_internal_ram … ps)))
2725             false (DIRECT ARG2))
2726           ? in ?) = ?)
2727       [1,2: cut (addressing_mode_ok M ps (DIRECT ARG2) = true) [2:
2728        [1,2:whd in MAP:(??(match % with [ _ ⇒ ? | _ ⇒ ?])?)]
2729       [1,2,3,4,5,6,7,8: cases (add_8_with_carry ???) |*: cases (sub_8_with_carry ???)]
2730       #result #flags
2731       #EQ >EQ -EQ; normalize nodelta; >(eq_bv_to_eq … H2c) %
2732    | (* INC *) #arg1 #H1 #H2 #EQ %[@1]
2733       normalize in H1; generalize in match (option_destruct_Some ??? H1) #K1 >K1 in H2; whd in ⊢ (% → ?)
2734       change in ⊢ (? → ??%?) with (execute_1_0 ??)
2735       cases (fetch (load_code_memory assembled) (sigma 〈preamble,instr_list〉 (program_counter … ps))) * #instr #newppc' #ticks normalize nodelta;
2736       * * #H2a #H2b whd in ⊢ (% → ?) #H2c
2737       >H2b >(eq_instruction_to_eq … H2a)
2738       generalize in match EQ; -EQ; whd in ⊢ (???% → ??%?);
2739       @(list_addressing_mode_tags_elim_prop … arg1) whd try % -arg1; normalize nodelta; [1,2,3: #ARG]
2740       [1,2,3,4: cases (half_add ???) #carry #result
2741       | cases (half_add ???) #carry #bl normalize nodelta;
2742         cases (full_add ????) #carry' #bu normalize nodelta ]
2743        #EQ >EQ -EQ; normalize nodelta; >(eq_bv_to_eq … H2c) -newppc';
2744        [5: %
2745        |1: <(set_arg_8_set_code_memory 0 [[direct]] ? ? ? (set_clock pseudo_assembly_program
2746      (set_program_counter pseudo_assembly_program ps newppc)
2747      (\fst  (ticks_of0 〈preamble,instr_list〉
2748                   (program_counter pseudo_assembly_program ps)
2749                   (Instruction (INC Identifier (DIRECT ARG))))
2750       +clock pseudo_assembly_program
2751        (set_program_counter pseudo_assembly_program ps newppc))) (load_code_memory assembled) result (DIRECT ARG))
2752        [2,3: // ]
2753            <(set_arg_8_set_program_counter 0 [[direct]] ? ? ? ? ?) [2://]
2754            whd in ⊢ (??%%)
2755            cases (split bool 4 4 ARG)
2756            #nu' #nl'
2757            normalize nodelta
2758            cases (split bool 1 3 nu')
2759            #bit_1' #ignore'
2760            normalize nodelta
2761            cases (get_index_v bool 4 nu' ? ?)
2762            [ normalize nodelta (* HERE *) whd in ⊢ (??%%) %
2763            |
2764            ]
Note: See TracBrowser for help on using the repository browser.