author | nipkow |
Thu, 29 Dec 2011 17:43:40 +0100 | |
changeset 46039 | 698de142f6f9 |
parent 46028 | 9f113cdf3d66 |
child 46063 | 81ebd0cdb300 |
permissions | -rw-r--r-- |
45111 | 1 |
(* Author: Tobias Nipkow *) |
2 |
||
3 |
theory Abs_Int1_ivl |
|
45990
b7b905b23b2a
incorporated More_Set and More_List into the Main body -- to be consolidated later
haftmann
parents:
45978
diff
changeset
|
4 |
imports Abs_Int1 Abs_Int_Tests |
45111 | 5 |
begin |
6 |
||
7 |
subsection "Interval Analysis" |
|
8 |
||
9 |
datatype ivl = I "int option" "int option" |
|
10 |
||
46039 | 11 |
definition "\<gamma>_ivl i = (case i of |
45111 | 12 |
I (Some l) (Some h) \<Rightarrow> {l..h} | |
13 |
I (Some l) None \<Rightarrow> {l..} | |
|
14 |
I None (Some h) \<Rightarrow> {..h} | |
|
15 |
I None None \<Rightarrow> UNIV)" |
|
16 |
||
45113 | 17 |
abbreviation I_Some_Some :: "int \<Rightarrow> int \<Rightarrow> ivl" ("{_\<dots>_}") where |
18 |
"{lo\<dots>hi} == I (Some lo) (Some hi)" |
|
19 |
abbreviation I_Some_None :: "int \<Rightarrow> ivl" ("{_\<dots>}") where |
|
20 |
"{lo\<dots>} == I (Some lo) None" |
|
21 |
abbreviation I_None_Some :: "int \<Rightarrow> ivl" ("{\<dots>_}") where |
|
22 |
"{\<dots>hi} == I None (Some hi)" |
|
23 |
abbreviation I_None_None :: "ivl" ("{\<dots>}") where |
|
24 |
"{\<dots>} == I None None" |
|
25 |
||
26 |
definition "num_ivl n = {n\<dots>n}" |
|
45111 | 27 |
|
45978 | 28 |
definition |
46039 | 29 |
[code_abbrev]: "contained_in i k \<longleftrightarrow> k \<in> \<gamma>_ivl i" |
45978 | 30 |
|
31 |
lemma contained_in_simps [code]: |
|
32 |
"contained_in (I (Some l) (Some h)) k \<longleftrightarrow> l \<le> k \<and> k \<le> h" |
|
33 |
"contained_in (I (Some l) None) k \<longleftrightarrow> l \<le> k" |
|
34 |
"contained_in (I None (Some h)) k \<longleftrightarrow> k \<le> h" |
|
35 |
"contained_in (I None None) k \<longleftrightarrow> True" |
|
46039 | 36 |
by (simp_all add: contained_in_def \<gamma>_ivl_def) |
45978 | 37 |
|
45111 | 38 |
instantiation option :: (plus)plus |
39 |
begin |
|
40 |
||
41 |
fun plus_option where |
|
42 |
"Some x + Some y = Some(x+y)" | |
|
43 |
"_ + _ = None" |
|
44 |
||
45 |
instance proof qed |
|
46 |
||
47 |
end |
|
48 |
||
45113 | 49 |
definition empty where "empty = {1\<dots>0}" |
45111 | 50 |
|
51 |
fun is_empty where |
|
45113 | 52 |
"is_empty {l\<dots>h} = (h<l)" | |
45111 | 53 |
"is_empty _ = False" |
54 |
||
55 |
lemma [simp]: "is_empty(I l h) = |
|
56 |
(case l of Some l \<Rightarrow> (case h of Some h \<Rightarrow> h<l | None \<Rightarrow> False) | None \<Rightarrow> False)" |
|
57 |
by(auto split:option.split) |
|
58 |
||
46039 | 59 |
lemma [simp]: "is_empty i \<Longrightarrow> \<gamma>_ivl i = {}" |
60 |
by(auto simp add: \<gamma>_ivl_def split: ivl.split option.split) |
|
45111 | 61 |
|
62 |
definition "plus_ivl i1 i2 = (if is_empty i1 | is_empty i2 then empty else |
|
63 |
case (i1,i2) of (I l1 h1, I l2 h2) \<Rightarrow> I (l1+l2) (h1+h2))" |
|
64 |
||
65 |
instantiation ivl :: SL_top |
|
66 |
begin |
|
67 |
||
68 |
definition le_option :: "bool \<Rightarrow> int option \<Rightarrow> int option \<Rightarrow> bool" where |
|
69 |
"le_option pos x y = |
|
70 |
(case x of (Some i) \<Rightarrow> (case y of Some j \<Rightarrow> i\<le>j | None \<Rightarrow> pos) |
|
71 |
| None \<Rightarrow> (case y of Some j \<Rightarrow> \<not>pos | None \<Rightarrow> True))" |
|
72 |
||
73 |
fun le_aux where |
|
74 |
"le_aux (I l1 h1) (I l2 h2) = (le_option False l2 l1 & le_option True h1 h2)" |
|
75 |
||
76 |
definition le_ivl where |
|
77 |
"i1 \<sqsubseteq> i2 = |
|
78 |
(if is_empty i1 then True else |
|
79 |
if is_empty i2 then False else le_aux i1 i2)" |
|
80 |
||
81 |
definition min_option :: "bool \<Rightarrow> int option \<Rightarrow> int option \<Rightarrow> int option" where |
|
82 |
"min_option pos o1 o2 = (if le_option pos o1 o2 then o1 else o2)" |
|
83 |
||
84 |
definition max_option :: "bool \<Rightarrow> int option \<Rightarrow> int option \<Rightarrow> int option" where |
|
85 |
"max_option pos o1 o2 = (if le_option pos o1 o2 then o2 else o1)" |
|
86 |
||
87 |
definition "i1 \<squnion> i2 = |
|
88 |
(if is_empty i1 then i2 else if is_empty i2 then i1 |
|
89 |
else case (i1,i2) of (I l1 h1, I l2 h2) \<Rightarrow> |
|
90 |
I (min_option False l1 l2) (max_option True h1 h2))" |
|
91 |
||
45113 | 92 |
definition "\<top> = {\<dots>}" |
45111 | 93 |
|
94 |
instance |
|
95 |
proof |
|
96 |
case goal1 thus ?case |
|
97 |
by(cases x, simp add: le_ivl_def le_option_def split: option.split) |
|
98 |
next |
|
99 |
case goal2 thus ?case |
|
100 |
by(cases x, cases y, cases z, auto simp: le_ivl_def le_option_def split: option.splits if_splits) |
|
101 |
next |
|
102 |
case goal3 thus ?case |
|
103 |
by(cases x, cases y, simp add: le_ivl_def join_ivl_def le_option_def min_option_def max_option_def split: option.splits) |
|
104 |
next |
|
105 |
case goal4 thus ?case |
|
106 |
by(cases x, cases y, simp add: le_ivl_def join_ivl_def le_option_def min_option_def max_option_def split: option.splits) |
|
107 |
next |
|
108 |
case goal5 thus ?case |
|
109 |
by(cases x, cases y, cases z, auto simp add: le_ivl_def join_ivl_def le_option_def min_option_def max_option_def split: option.splits if_splits) |
|
110 |
next |
|
111 |
case goal6 thus ?case |
|
112 |
by(cases x, simp add: Top_ivl_def le_ivl_def le_option_def split: option.split) |
|
113 |
qed |
|
114 |
||
115 |
end |
|
116 |
||
117 |
||
118 |
instantiation ivl :: L_top_bot |
|
119 |
begin |
|
120 |
||
121 |
definition "i1 \<sqinter> i2 = (if is_empty i1 \<or> is_empty i2 then empty else |
|
122 |
case (i1,i2) of (I l1 h1, I l2 h2) \<Rightarrow> |
|
123 |
I (max_option False l1 l2) (min_option True h1 h2))" |
|
124 |
||
125 |
definition "\<bottom> = empty" |
|
126 |
||
127 |
instance |
|
128 |
proof |
|
129 |
case goal1 thus ?case |
|
45623
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
130 |
by (simp add:meet_ivl_def empty_def le_ivl_def le_option_def max_option_def min_option_def split: ivl.splits option.splits) |
45111 | 131 |
next |
132 |
case goal2 thus ?case |
|
45623
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
133 |
by (simp add: empty_def meet_ivl_def le_ivl_def le_option_def max_option_def min_option_def split: ivl.splits option.splits) |
45111 | 134 |
next |
135 |
case goal3 thus ?case |
|
136 |
by (cases x, cases y, cases z, auto simp add: le_ivl_def meet_ivl_def empty_def le_option_def max_option_def min_option_def split: option.splits if_splits) |
|
137 |
next |
|
138 |
case goal4 show ?case by(cases x, simp add: bot_ivl_def empty_def le_ivl_def) |
|
139 |
qed |
|
140 |
||
141 |
end |
|
142 |
||
143 |
instantiation option :: (minus)minus |
|
144 |
begin |
|
145 |
||
146 |
fun minus_option where |
|
147 |
"Some x - Some y = Some(x-y)" | |
|
148 |
"_ - _ = None" |
|
149 |
||
150 |
instance proof qed |
|
151 |
||
152 |
end |
|
153 |
||
154 |
definition "minus_ivl i1 i2 = (if is_empty i1 | is_empty i2 then empty else |
|
155 |
case (i1,i2) of (I l1 h1, I l2 h2) \<Rightarrow> I (l1-h2) (h1-l2))" |
|
156 |
||
46039 | 157 |
lemma gamma_minus_ivl: |
158 |
"n1 : \<gamma>_ivl i1 \<Longrightarrow> n2 : \<gamma>_ivl i2 \<Longrightarrow> n1-n2 : \<gamma>_ivl(minus_ivl i1 i2)" |
|
159 |
by(auto simp add: minus_ivl_def \<gamma>_ivl_def split: ivl.splits option.splits) |
|
45111 | 160 |
|
161 |
||
162 |
definition "filter_plus_ivl i i1 i2 = ((*if is_empty i then empty else*) |
|
163 |
i1 \<sqinter> minus_ivl i i2, i2 \<sqinter> minus_ivl i i1)" |
|
164 |
||
165 |
fun filter_less_ivl :: "bool \<Rightarrow> ivl \<Rightarrow> ivl \<Rightarrow> ivl * ivl" where |
|
166 |
"filter_less_ivl res (I l1 h1) (I l2 h2) = |
|
167 |
(if is_empty(I l1 h1) \<or> is_empty(I l2 h2) then (empty, empty) else |
|
168 |
if res |
|
169 |
then (I l1 (min_option True h1 (h2 - Some 1)), |
|
170 |
I (max_option False (l1 + Some 1) l2) h2) |
|
171 |
else (I (max_option False l1 l2) h1, I l2 (min_option True h1 h2)))" |
|
172 |
||
46039 | 173 |
interpretation Val_abs \<gamma>_ivl num_ivl plus_ivl |
45623
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
174 |
defines aval_ivl is aval' |
45111 | 175 |
proof |
176 |
case goal1 thus ?case |
|
46039 | 177 |
by(auto simp: \<gamma>_ivl_def le_ivl_def le_option_def split: ivl.split option.split if_splits) |
45111 | 178 |
next |
46039 | 179 |
case goal2 show ?case by(simp add: \<gamma>_ivl_def Top_ivl_def) |
45127
d2eb07a1e01b
separated monotonicity reasoning and defined narrowing with while_option
nipkow
parents:
45113
diff
changeset
|
180 |
next |
46039 | 181 |
case goal3 thus ?case by(simp add: \<gamma>_ivl_def num_ivl_def) |
45127
d2eb07a1e01b
separated monotonicity reasoning and defined narrowing with while_option
nipkow
parents:
45113
diff
changeset
|
182 |
next |
d2eb07a1e01b
separated monotonicity reasoning and defined narrowing with while_option
nipkow
parents:
45113
diff
changeset
|
183 |
case goal4 thus ?case |
46039 | 184 |
by(auto simp add: \<gamma>_ivl_def plus_ivl_def split: ivl.split option.splits) |
45111 | 185 |
qed |
186 |
||
46039 | 187 |
interpretation Val_abs1_gamma \<gamma>_ivl num_ivl plus_ivl |
45111 | 188 |
proof |
189 |
case goal1 thus ?case |
|
46039 | 190 |
by(auto simp add: \<gamma>_ivl_def meet_ivl_def empty_def min_option_def max_option_def split: ivl.split option.split) |
45111 | 191 |
next |
46039 | 192 |
case goal2 show ?case by(auto simp add: bot_ivl_def \<gamma>_ivl_def empty_def) |
45111 | 193 |
qed |
194 |
||
195 |
lemma mono_minus_ivl: |
|
196 |
"i1 \<sqsubseteq> i1' \<Longrightarrow> i2 \<sqsubseteq> i2' \<Longrightarrow> minus_ivl i1 i2 \<sqsubseteq> minus_ivl i1' i2'" |
|
197 |
apply(auto simp add: minus_ivl_def empty_def le_ivl_def le_option_def split: ivl.splits) |
|
198 |
apply(simp split: option.splits) |
|
199 |
apply(simp split: option.splits) |
|
200 |
apply(simp split: option.splits) |
|
201 |
done |
|
202 |
||
203 |
||
204 |
interpretation |
|
46039 | 205 |
Val_abs1 \<gamma>_ivl num_ivl plus_ivl filter_plus_ivl filter_less_ivl |
45111 | 206 |
proof |
207 |
case goal1 thus ?case |
|
208 |
by(auto simp add: filter_plus_ivl_def) |
|
46039 | 209 |
(metis gamma_minus_ivl add_diff_cancel add_commute)+ |
45111 | 210 |
next |
211 |
case goal2 thus ?case |
|
212 |
by(cases a1, cases a2, |
|
46039 | 213 |
auto simp: \<gamma>_ivl_def min_option_def max_option_def le_option_def split: if_splits option.splits) |
45111 | 214 |
qed |
215 |
||
216 |
interpretation |
|
46039 | 217 |
Abs_Int1 \<gamma>_ivl num_ivl plus_ivl filter_plus_ivl filter_less_ivl |
45111 | 218 |
defines afilter_ivl is afilter |
219 |
and bfilter_ivl is bfilter |
|
45655
a49f9428aba4
simplified Collecting1 and renamed: step -> step', step_cs -> step
nipkow
parents:
45623
diff
changeset
|
220 |
and step_ivl is step' |
45111 | 221 |
and AI_ivl is AI |
45623
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
222 |
and aval_ivl' is aval'' |
45127
d2eb07a1e01b
separated monotonicity reasoning and defined narrowing with while_option
nipkow
parents:
45113
diff
changeset
|
223 |
proof qed |
45111 | 224 |
|
45127
d2eb07a1e01b
separated monotonicity reasoning and defined narrowing with while_option
nipkow
parents:
45113
diff
changeset
|
225 |
|
d2eb07a1e01b
separated monotonicity reasoning and defined narrowing with while_option
nipkow
parents:
45113
diff
changeset
|
226 |
text{* Monotonicity: *} |
d2eb07a1e01b
separated monotonicity reasoning and defined narrowing with while_option
nipkow
parents:
45113
diff
changeset
|
227 |
|
d2eb07a1e01b
separated monotonicity reasoning and defined narrowing with while_option
nipkow
parents:
45113
diff
changeset
|
228 |
interpretation |
46039 | 229 |
Abs_Int1_mono \<gamma>_ivl num_ivl plus_ivl filter_plus_ivl filter_less_ivl |
45127
d2eb07a1e01b
separated monotonicity reasoning and defined narrowing with while_option
nipkow
parents:
45113
diff
changeset
|
230 |
proof |
d2eb07a1e01b
separated monotonicity reasoning and defined narrowing with while_option
nipkow
parents:
45113
diff
changeset
|
231 |
case goal1 thus ?case |
d2eb07a1e01b
separated monotonicity reasoning and defined narrowing with while_option
nipkow
parents:
45113
diff
changeset
|
232 |
by(auto simp: plus_ivl_def le_ivl_def le_option_def empty_def split: if_splits ivl.splits option.splits) |
d2eb07a1e01b
separated monotonicity reasoning and defined narrowing with while_option
nipkow
parents:
45113
diff
changeset
|
233 |
next |
d2eb07a1e01b
separated monotonicity reasoning and defined narrowing with while_option
nipkow
parents:
45113
diff
changeset
|
234 |
case goal2 thus ?case |
d2eb07a1e01b
separated monotonicity reasoning and defined narrowing with while_option
nipkow
parents:
45113
diff
changeset
|
235 |
by(auto simp: filter_plus_ivl_def le_prod_def mono_meet mono_minus_ivl) |
d2eb07a1e01b
separated monotonicity reasoning and defined narrowing with while_option
nipkow
parents:
45113
diff
changeset
|
236 |
next |
d2eb07a1e01b
separated monotonicity reasoning and defined narrowing with while_option
nipkow
parents:
45113
diff
changeset
|
237 |
case goal3 thus ?case |
d2eb07a1e01b
separated monotonicity reasoning and defined narrowing with while_option
nipkow
parents:
45113
diff
changeset
|
238 |
apply(cases a1, cases b1, cases a2, cases b2, auto simp: le_prod_def) |
d2eb07a1e01b
separated monotonicity reasoning and defined narrowing with while_option
nipkow
parents:
45113
diff
changeset
|
239 |
by(auto simp add: empty_def le_ivl_def le_option_def min_option_def max_option_def split: option.splits) |
d2eb07a1e01b
separated monotonicity reasoning and defined narrowing with while_option
nipkow
parents:
45113
diff
changeset
|
240 |
qed |
45111 | 241 |
|
45623
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
242 |
|
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
243 |
subsubsection "Tests" |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
244 |
|
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
245 |
value [code] "show_acom_opt (AI_ivl test1_ivl)" |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
246 |
|
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
247 |
text{* Better than @{text AI_const}: *} |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
248 |
value [code] "show_acom_opt (AI_ivl test3_const)" |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
249 |
value [code] "show_acom_opt (AI_ivl test4_const)" |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
250 |
value [code] "show_acom_opt (AI_ivl test6_const)" |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
251 |
|
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
252 |
value [code] "show_acom_opt (AI_ivl test2_ivl)" |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
253 |
value [code] "show_acom (((step_ivl \<top>)^^0) (\<bottom>\<^sub>c test2_ivl))" |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
254 |
value [code] "show_acom (((step_ivl \<top>)^^1) (\<bottom>\<^sub>c test2_ivl))" |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
255 |
value [code] "show_acom (((step_ivl \<top>)^^2) (\<bottom>\<^sub>c test2_ivl))" |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
256 |
|
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
257 |
text{* Fixed point reached in 2 steps. Not so if the start value of x is known: *} |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
258 |
|
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
259 |
value [code] "show_acom_opt (AI_ivl test3_ivl)" |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
260 |
value [code] "show_acom (((step_ivl \<top>)^^0) (\<bottom>\<^sub>c test3_ivl))" |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
261 |
value [code] "show_acom (((step_ivl \<top>)^^1) (\<bottom>\<^sub>c test3_ivl))" |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
262 |
value [code] "show_acom (((step_ivl \<top>)^^2) (\<bottom>\<^sub>c test3_ivl))" |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
263 |
value [code] "show_acom (((step_ivl \<top>)^^3) (\<bottom>\<^sub>c test3_ivl))" |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
264 |
value [code] "show_acom (((step_ivl \<top>)^^4) (\<bottom>\<^sub>c test3_ivl))" |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
265 |
|
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
266 |
text{* Takes as many iterations as the actual execution. Would diverge if |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
267 |
loop did not terminate. Worse still, as the following example shows: even if |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
268 |
the actual execution terminates, the analysis may not. The value of y keeps |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
269 |
decreasing as the analysis is iterated, no matter how long: *} |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
270 |
|
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
271 |
value [code] "show_acom (((step_ivl \<top>)^^50) (\<bottom>\<^sub>c test4_ivl))" |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
272 |
|
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
273 |
text{* Relationships between variables are NOT captured: *} |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
274 |
value [code] "show_acom_opt (AI_ivl test5_ivl)" |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
275 |
|
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
276 |
text{* Again, the analysis would not terminate: *} |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
277 |
value [code] "show_acom (((step_ivl \<top>)^^50) (\<bottom>\<^sub>c test6_ivl))" |
f682f3f7b726
Abstract interpretation is now based uniformly on annotated programs,
nipkow
parents:
45127
diff
changeset
|
278 |
|
45111 | 279 |
end |