author | hoelzl |
Thu, 12 Nov 2009 17:21:48 +0100 | |
changeset 33639 | 603320b93668 |
parent 32960 | 69916a850301 |
child 33954 | 1bc3b688548c |
permissions | -rw-r--r-- |
12516 | 1 |
(* Title: HOL/MicroJava/BV/JVM.thy |
2 |
Author: Tobias Nipkow, Gerwin Klein |
|
10592 | 3 |
Copyright 2000 TUM |
4 |
*) |
|
5 |
||
12911 | 6 |
header {* \isaheader{Kildall for the JVM}\label{sec:JVM} *} |
10592 | 7 |
|
16417 | 8 |
theory JVM imports Kildall Typing_Framework_JVM begin |
13066 | 9 |
|
10592 | 10 |
|
11 |
constdefs |
|
13006 | 12 |
kiljvm :: "jvm_prog \<Rightarrow> nat \<Rightarrow> nat \<Rightarrow> ty \<Rightarrow> exception_table \<Rightarrow> |
26450 | 13 |
instr list \<Rightarrow> JVMType.state list \<Rightarrow> JVMType.state list" |
12516 | 14 |
"kiljvm G maxs maxr rT et bs == |
15 |
kildall (JVMType.le G maxs maxr) (JVMType.sup G maxs maxr) (exec G maxs rT et bs)" |
|
10592 | 16 |
|
12516 | 17 |
wt_kil :: "jvm_prog \<Rightarrow> cname \<Rightarrow> ty list \<Rightarrow> ty \<Rightarrow> nat \<Rightarrow> nat \<Rightarrow> |
18 |
exception_table \<Rightarrow> instr list \<Rightarrow> bool" |
|
19 |
"wt_kil G C pTs rT mxs mxl et ins == |
|
13066 | 20 |
check_bounded ins et \<and> 0 < size ins \<and> |
10637 | 21 |
(let first = Some ([],(OK (Class C))#((map OK pTs))@(replicate mxl Err)); |
11701
3d51fbf81c17
sane numerals (stage 1): added generic 1, removed 1' and 2 on nat,
wenzelm
parents:
11299
diff
changeset
|
22 |
start = OK first#(replicate (size ins - 1) (OK None)); |
12516 | 23 |
result = kiljvm G mxs (1+size pTs+mxl) rT et ins start |
10637 | 24 |
in \<forall>n < size ins. result!n \<noteq> Err)" |
25 |
||
13006 | 26 |
wt_jvm_prog_kildall :: "jvm_prog \<Rightarrow> bool" |
10637 | 27 |
"wt_jvm_prog_kildall G == |
12516 | 28 |
wf_prog (\<lambda>G C (sig,rT,(maxs,maxl,b,et)). wt_kil G C (snd sig) rT maxs maxl et b) G" |
10592 | 29 |
|
30 |
||
31 |
theorem is_bcv_kiljvm: |
|
13066 | 32 |
"\<lbrakk> wf_prog wf_mb G; bounded (exec G maxs rT et bs) (size bs) \<rbrakk> \<Longrightarrow> |
12516 | 33 |
is_bcv (JVMType.le G maxs maxr) Err (exec G maxs rT et bs) |
34 |
(size bs) (states G maxs maxr) (kiljvm G maxs maxr rT et bs)" |
|
10592 | 35 |
apply (unfold kiljvm_def sl_triple_conv) |
36 |
apply (rule is_bcv_kildall) |
|
37 |
apply (simp (no_asm) add: sl_triple_conv [symmetric]) |
|
14045 | 38 |
apply (force intro!: semilat_JVM_slI dest: wf_acyclic |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
26450
diff
changeset
|
39 |
simp add: symmetric sl_triple_conv) |
10592 | 40 |
apply (simp (no_asm) add: JVM_le_unfold) |
41 |
apply (blast intro!: order_widen wf_converse_subcls1_impl_acc_subtype |
|
22271 | 42 |
dest: wf_subcls1 wfP_acyclicP wf_prog_ws_prog) |
10592 | 43 |
apply (simp add: JVM_le_unfold) |
44 |
apply (erule exec_pres_type) |
|
13066 | 45 |
apply assumption |
14045 | 46 |
apply (drule wf_prog_ws_prog, erule exec_mono, assumption) |
10592 | 47 |
done |
48 |
||
13224 | 49 |
lemma subset_replicate: "set (replicate n x) \<subseteq> {x}" |
50 |
by (induct n) auto |
|
51 |
||
52 |
lemma in_set_replicate: |
|
53 |
"x \<in> set (replicate n y) \<Longrightarrow> x = y" |
|
54 |
proof - |
|
55 |
assume "x \<in> set (replicate n y)" |
|
56 |
also have "set (replicate n y) \<subseteq> {y}" by (rule subset_replicate) |
|
57 |
finally have "x \<in> {y}" . |
|
58 |
thus ?thesis by simp |
|
59 |
qed |
|
10637 | 60 |
|
61 |
theorem wt_kil_correct: |
|
13224 | 62 |
assumes wf: "wf_prog wf_mb G" |
63 |
assumes C: "is_class G C" |
|
64 |
assumes pTs: "set pTs \<subseteq> types G" |
|
65 |
||
66 |
assumes wtk: "wt_kil G C pTs rT maxs mxl et bs" |
|
67 |
||
68 |
shows "\<exists>phi. wt_method G C pTs rT maxs mxl bs et phi" |
|
10592 | 69 |
proof - |
70 |
let ?start = "OK (Some ([],(OK (Class C))#((map OK pTs))@(replicate mxl Err))) |
|
11701
3d51fbf81c17
sane numerals (stage 1): added generic 1, removed 1' and 2 on nat,
wenzelm
parents:
11299
diff
changeset
|
71 |
#(replicate (size bs - 1) (OK None))" |
10592 | 72 |
|
13224 | 73 |
from wtk obtain maxr r where |
13066 | 74 |
bounded: "check_bounded bs et" and |
12516 | 75 |
result: "r = kiljvm G maxs maxr rT et bs ?start" and |
10637 | 76 |
success: "\<forall>n < size bs. r!n \<noteq> Err" and |
77 |
instrs: "0 < size bs" and |
|
78 |
maxr: "maxr = Suc (length pTs + mxl)" |
|
79 |
by (unfold wt_kil_def) simp |
|
10592 | 80 |
|
13066 | 81 |
from bounded have "bounded (exec G maxs rT et bs) (size bs)" |
82 |
by (unfold exec_def) (intro bounded_lift check_bounded_is_bounded) |
|
83 |
with wf have bcv: |
|
12516 | 84 |
"is_bcv (JVMType.le G maxs maxr) Err (exec G maxs rT et bs) |
13066 | 85 |
(size bs) (states G maxs maxr) (kiljvm G maxs maxr rT et bs)" |
10592 | 86 |
by (rule is_bcv_kiljvm) |
13066 | 87 |
|
13224 | 88 |
from C pTs instrs maxr |
10592 | 89 |
have "?start \<in> list (length bs) (states G maxs maxr)" |
13224 | 90 |
apply (unfold JVM_states_unfold) |
91 |
apply (rule listI) |
|
92 |
apply (auto intro: list_appendI dest!: in_set_replicate) |
|
93 |
apply force |
|
94 |
done |
|
95 |
||
12516 | 96 |
with bcv success result have |
10592 | 97 |
"\<exists>ts\<in>list (length bs) (states G maxs maxr). |
10812
ead84e90bfeb
merged semilattice orders with <=' from Convert.thy (now defined in JVMType.thy)
kleing
parents:
10657
diff
changeset
|
98 |
?start <=[JVMType.le G maxs maxr] ts \<and> |
12516 | 99 |
wt_step (JVMType.le G maxs maxr) Err (exec G maxs rT et bs) ts" |
10592 | 100 |
by (unfold is_bcv_def) auto |
101 |
then obtain phi' where |
|
13214
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
102 |
phi': "phi' \<in> list (length bs) (states G maxs maxr)" and |
10812
ead84e90bfeb
merged semilattice orders with <=' from Convert.thy (now defined in JVMType.thy)
kleing
parents:
10657
diff
changeset
|
103 |
s: "?start <=[JVMType.le G maxs maxr] phi'" and |
12516 | 104 |
w: "wt_step (JVMType.le G maxs maxr) Err (exec G maxs rT et bs) phi'" |
10592 | 105 |
by blast |
13066 | 106 |
hence wt_err_step: |
107 |
"wt_err_step (sup_state_opt G) (exec G maxs rT et bs) phi'" |
|
108 |
by (simp add: wt_err_step_def exec_def JVM_le_Err_conv) |
|
10592 | 109 |
|
12516 | 110 |
from s have le: "JVMType.le G maxs maxr (?start ! 0) (phi'!0)" |
10592 | 111 |
by (drule_tac p=0 in le_listD) (simp add: lesub_def)+ |
112 |
||
13214
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
113 |
from phi' have l: "size phi' = size bs" by simp |
12516 | 114 |
with instrs w have "phi' ! 0 \<noteq> Err" by (unfold wt_step_def) simp |
115 |
with instrs l have phi0: "OK (map ok_val phi' ! 0) = phi' ! 0" |
|
13214
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
116 |
by (clarsimp simp add: not_Err_eq) |
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
117 |
|
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
118 |
from phi' have "check_types G maxs maxr phi'" by(simp add: check_types_def) |
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
119 |
also from w have "phi' = map OK (map ok_val phi')" |
33639
603320b93668
New list theorems; added map_map to simpset, this is the prefered direction; allow sorting by a key
hoelzl
parents:
32960
diff
changeset
|
120 |
by (auto simp add: wt_step_def not_Err_eq intro!: nth_equalityI) |
13214
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
121 |
finally |
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
122 |
have check_types: |
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
123 |
"check_types G maxs maxr (map OK (map ok_val phi'))" . |
10592 | 124 |
|
12516 | 125 |
from l bounded |
13067 | 126 |
have "bounded (\<lambda>pc. eff (bs!pc) G pc et) (length phi')" |
13066 | 127 |
by (simp add: exec_def check_bounded_is_bounded) |
13067 | 128 |
hence bounded': "bounded (exec G maxs rT et bs) (length bs)" |
129 |
by (auto intro: bounded_lift simp add: exec_def l) |
|
13066 | 130 |
with wt_err_step |
131 |
have "wt_app_eff (sup_state_opt G) (\<lambda>pc. app (bs!pc) G maxs rT pc et) |
|
132 |
(\<lambda>pc. eff (bs!pc) G pc et) (map ok_val phi')" |
|
13067 | 133 |
by (auto intro: wt_err_imp_wt_app_eff simp add: l exec_def) |
13214
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
134 |
with instrs l le bounded bounded' check_types maxr |
12516 | 135 |
have "wt_method G C pTs rT maxs mxl bs et (map ok_val phi')" |
13066 | 136 |
apply (unfold wt_method_def wt_app_eff_def) |
10592 | 137 |
apply simp |
138 |
apply (rule conjI) |
|
139 |
apply (unfold wt_start_def) |
|
140 |
apply (rule JVM_le_convert [THEN iffD1]) |
|
141 |
apply (simp (no_asm) add: phi0) |
|
142 |
apply clarify |
|
143 |
apply (erule allE, erule impE, assumption) |
|
144 |
apply (elim conjE) |
|
145 |
apply (clarsimp simp add: lesub_def wt_instr_def) |
|
13067 | 146 |
apply (simp add: exec_def) |
147 |
apply (drule bounded_err_stepD, assumption+) |
|
148 |
apply blast |
|
10592 | 149 |
done |
150 |
||
151 |
thus ?thesis by blast |
|
152 |
qed |
|
153 |
||
10651 | 154 |
|
155 |
theorem wt_kil_complete: |
|
13224 | 156 |
assumes wf: "wf_prog wf_mb G" |
157 |
assumes C: "is_class G C" |
|
158 |
assumes pTs: "set pTs \<subseteq> types G" |
|
159 |
||
160 |
assumes wtm: "wt_method G C pTs rT maxs mxl bs et phi" |
|
161 |
||
162 |
shows "wt_kil G C pTs rT maxs mxl et bs" |
|
10651 | 163 |
proof - |
13214
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
164 |
let ?mxr = "1+size pTs+mxl" |
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
165 |
|
13224 | 166 |
from wtm obtain |
10651 | 167 |
instrs: "0 < length bs" and |
13214
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
168 |
len: "length phi = length bs" and |
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
169 |
bounded: "check_bounded bs et" and |
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
170 |
ck_types: "check_types G maxs ?mxr (map OK phi)" and |
10651 | 171 |
wt_start: "wt_start G C pTs mxl phi" and |
172 |
wt_ins: "\<forall>pc. pc < length bs \<longrightarrow> |
|
12516 | 173 |
wt_instr (bs ! pc) G rT phi maxs (length bs) et pc" |
10651 | 174 |
by (unfold wt_method_def) simp |
175 |
||
13214
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
176 |
from ck_types len |
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
177 |
have istype_phi: |
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
178 |
"map OK phi \<in> list (length bs) (states G maxs (1+size pTs+mxl))" |
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
179 |
by (auto simp add: check_types_def intro!: listI) |
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
180 |
|
12516 | 181 |
let ?eff = "\<lambda>pc. eff (bs!pc) G pc et" |
182 |
let ?app = "\<lambda>pc. app (bs!pc) G maxs rT pc et" |
|
10651 | 183 |
|
13066 | 184 |
from bounded |
185 |
have bounded_exec: "bounded (exec G maxs rT et bs) (size bs)" |
|
186 |
by (unfold exec_def) (intro bounded_lift check_bounded_is_bounded) |
|
12516 | 187 |
|
10651 | 188 |
from wt_ins |
13066 | 189 |
have "wt_app_eff (sup_state_opt G) ?app ?eff phi" |
190 |
apply (unfold wt_app_eff_def wt_instr_def lesub_def) |
|
13214
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
191 |
apply (simp (no_asm) only: len) |
10651 | 192 |
apply blast |
193 |
done |
|
13066 | 194 |
with bounded_exec |
195 |
have "wt_err_step (sup_state_opt G) (err_step (size phi) ?app ?eff) (map OK phi)" |
|
13214
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
196 |
by - (erule wt_app_eff_imp_wt_err,simp add: exec_def len) |
13066 | 197 |
hence wt_err: |
198 |
"wt_err_step (sup_state_opt G) (exec G maxs rT et bs) (map OK phi)" |
|
13214
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
199 |
by (unfold exec_def) (simp add: len) |
10651 | 200 |
|
12516 | 201 |
from wf bounded_exec |
10651 | 202 |
have is_bcv: |
13224 | 203 |
"is_bcv (JVMType.le G maxs ?mxr) Err (exec G maxs rT et bs) |
204 |
(size bs) (states G maxs ?mxr) (kiljvm G maxs ?mxr rT et bs)" |
|
10651 | 205 |
by (rule is_bcv_kiljvm) |
206 |
||
207 |
let ?start = "OK (Some ([],(OK (Class C))#((map OK pTs))@(replicate mxl Err))) |
|
11701
3d51fbf81c17
sane numerals (stage 1): added generic 1, removed 1' and 2 on nat,
wenzelm
parents:
11299
diff
changeset
|
208 |
#(replicate (size bs - 1) (OK None))" |
10651 | 209 |
|
13224 | 210 |
from C pTs instrs |
211 |
have start: "?start \<in> list (length bs) (states G maxs ?mxr)" |
|
212 |
apply (unfold JVM_states_unfold) |
|
213 |
apply (rule listI) |
|
214 |
apply (auto intro!: list_appendI dest!: in_set_replicate) |
|
215 |
apply force |
|
216 |
done |
|
10651 | 217 |
|
12516 | 218 |
let ?phi = "map OK phi" |
13224 | 219 |
have less_phi: "?start <=[JVMType.le G maxs ?mxr] ?phi" |
10657 | 220 |
proof - |
13214
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
221 |
from len instrs |
12516 | 222 |
have "length ?start = length (map OK phi)" by simp |
223 |
moreover |
|
10657 | 224 |
{ fix n |
225 |
from wt_start |
|
226 |
have "G \<turnstile> ok_val (?start!0) <=' phi!0" |
|
227 |
by (simp add: wt_start_def) |
|
228 |
moreover |
|
13214
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
229 |
from instrs len |
10657 | 230 |
have "0 < length phi" by simp |
231 |
ultimately |
|
13224 | 232 |
have "JVMType.le G maxs ?mxr (?start!0) (?phi!0)" |
10657 | 233 |
by (simp add: JVM_le_Err_conv Err.le_def lesub_def) |
234 |
moreover |
|
235 |
{ fix n' |
|
13224 | 236 |
have "JVMType.le G maxs ?mxr (OK None) (?phi!n)" |
10657 | 237 |
by (auto simp add: JVM_le_Err_conv Err.le_def lesub_def |
238 |
split: err.splits) |
|
13006 | 239 |
hence "\<lbrakk> n = Suc n'; n < length ?start \<rbrakk> |
13224 | 240 |
\<Longrightarrow> JVMType.le G maxs ?mxr (?start!n) (?phi!n)" |
10657 | 241 |
by simp |
242 |
} |
|
243 |
ultimately |
|
13224 | 244 |
have "n < length ?start \<Longrightarrow> (?start!n) <=_(JVMType.le G maxs ?mxr) (?phi!n)" |
12516 | 245 |
by (unfold lesub_def) (cases n, blast+) |
246 |
} |
|
247 |
ultimately show ?thesis by (rule le_listI) |
|
10657 | 248 |
qed |
10651 | 249 |
|
13066 | 250 |
from wt_err |
13224 | 251 |
have "wt_step (JVMType.le G maxs ?mxr) Err (exec G maxs rT et bs) ?phi" |
13066 | 252 |
by (simp add: wt_err_step_def JVM_le_Err_conv) |
12516 | 253 |
with start istype_phi less_phi is_bcv |
13224 | 254 |
have "\<forall>p. p < length bs \<longrightarrow> kiljvm G maxs ?mxr rT et bs ?start ! p \<noteq> Err" |
12516 | 255 |
by (unfold is_bcv_def) auto |
13066 | 256 |
with bounded instrs |
12516 | 257 |
show "wt_kil G C pTs rT maxs mxl et bs" by (unfold wt_kil_def) simp |
258 |
qed |
|
10651 | 259 |
|
10637 | 260 |
|
13214
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
261 |
theorem jvm_kildall_sound_complete: |
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
262 |
"wt_jvm_prog_kildall G = (\<exists>Phi. wt_jvm_prog G Phi)" |
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
263 |
proof |
12516 | 264 |
let ?Phi = "\<lambda>C sig. let (C,rT,(maxs,maxl,ins,et)) = the (method (G,C) sig) in |
265 |
SOME phi. wt_method G C (snd sig) rT maxs maxl ins et phi" |
|
13224 | 266 |
|
267 |
assume "wt_jvm_prog_kildall G" |
|
268 |
hence "wt_jvm_prog G ?Phi" |
|
269 |
apply (unfold wt_jvm_prog_def wt_jvm_prog_kildall_def) |
|
270 |
apply (erule jvm_prog_lift) |
|
271 |
apply (auto dest!: wt_kil_correct intro: someI) |
|
10637 | 272 |
done |
13224 | 273 |
thus "\<exists>Phi. wt_jvm_prog G Phi" by fast |
13214
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
274 |
next |
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
275 |
assume "\<exists>Phi. wt_jvm_prog G Phi" |
13224 | 276 |
thus "wt_jvm_prog_kildall G" |
277 |
apply (clarify) |
|
278 |
apply (unfold wt_jvm_prog_def wt_jvm_prog_kildall_def) |
|
279 |
apply (erule jvm_prog_lift) |
|
280 |
apply (auto intro: wt_kil_complete) |
|
13214
2aa33ed5f526
wt_method now checks bounded+types ==> wt_kildall <=> wt_method
kleing
parents:
13074
diff
changeset
|
281 |
done |
10637 | 282 |
qed |
283 |
||
10592 | 284 |
end |