author | haftmann |
Sat, 16 Jan 2010 17:15:27 +0100 | |
changeset 34940 | 3e80eab831a1 |
parent 32149 | ef59550a55d3 |
child 35054 | a5db9779b026 |
permissions | -rw-r--r-- |
13857 | 1 |
(* Title: HOL/Hoare/HoareAbort.thy |
2 |
Author: Leonor Prensa Nieto & Tobias Nipkow |
|
3 |
Copyright 2003 TUM |
|
4 |
||
5 |
Like Hoare.thy, but with an Abort statement for modelling run time errors. |
|
6 |
*) |
|
7 |
||
28457
25669513fd4c
major cleanup of hoare_tac.ML: just one copy for Hoare.thy and HoareAbort.thy (only 1 line different), refrain from inspecting the main goal, proper context;
wenzelm
parents:
27330
diff
changeset
|
8 |
theory HoareAbort |
25669513fd4c
major cleanup of hoare_tac.ML: just one copy for Hoare.thy and HoareAbort.thy (only 1 line different), refrain from inspecting the main goal, proper context;
wenzelm
parents:
27330
diff
changeset
|
9 |
imports Main |
25669513fd4c
major cleanup of hoare_tac.ML: just one copy for Hoare.thy and HoareAbort.thy (only 1 line different), refrain from inspecting the main goal, proper context;
wenzelm
parents:
27330
diff
changeset
|
10 |
uses ("hoare_tac.ML") |
24470
41c81e23c08d
removed Hoare/hoare.ML, Hoare/hoareAbort.ML, ex/svc_oracle.ML (which can be mistaken as attached ML script on case-insensitive file-system);
wenzelm
parents:
21588
diff
changeset
|
11 |
begin |
13857 | 12 |
|
13 |
types |
|
14 |
'a bexp = "'a set" |
|
15 |
'a assn = "'a set" |
|
16 |
||
17 |
datatype |
|
18 |
'a com = Basic "'a \<Rightarrow> 'a" |
|
19 |
| Abort |
|
20 |
| Seq "'a com" "'a com" ("(_;/ _)" [61,60] 60) |
|
21 |
| Cond "'a bexp" "'a com" "'a com" ("(1IF _/ THEN _ / ELSE _/ FI)" [0,0,0] 61) |
|
22 |
| While "'a bexp" "'a assn" "'a com" ("(1WHILE _/ INV {_} //DO _ /OD)" [0,0,0] 61) |
|
23 |
||
24 |
syntax |
|
25 |
"@assign" :: "id => 'b => 'a com" ("(2_ :=/ _)" [70,65] 61) |
|
26 |
"@annskip" :: "'a com" ("SKIP") |
|
27 |
||
28 |
translations |
|
29 |
"SKIP" == "Basic id" |
|
30 |
||
31 |
types 'a sem = "'a option => 'a option => bool" |
|
32 |
||
33 |
consts iter :: "nat => 'a bexp => 'a sem => 'a sem" |
|
34 |
primrec |
|
13875 | 35 |
"iter 0 b S = (\<lambda>s s'. s \<notin> Some ` b \<and> s=s')" |
36 |
"iter (Suc n) b S = |
|
37 |
(\<lambda>s s'. s \<in> Some ` b \<and> (\<exists>s''. S s s'' \<and> iter n b S s'' s'))" |
|
13857 | 38 |
|
39 |
consts Sem :: "'a com => 'a sem" |
|
40 |
primrec |
|
41 |
"Sem(Basic f) s s' = (case s of None \<Rightarrow> s' = None | Some t \<Rightarrow> s' = Some(f t))" |
|
42 |
"Sem Abort s s' = (s' = None)" |
|
13875 | 43 |
"Sem(c1;c2) s s' = (\<exists>s''. Sem c1 s s'' \<and> Sem c2 s'' s')" |
13857 | 44 |
"Sem(IF b THEN c1 ELSE c2 FI) s s' = |
45 |
(case s of None \<Rightarrow> s' = None |
|
13875 | 46 |
| Some t \<Rightarrow> ((t \<in> b \<longrightarrow> Sem c1 s s') \<and> (t \<notin> b \<longrightarrow> Sem c2 s s')))" |
13857 | 47 |
"Sem(While b x c) s s' = |
13875 | 48 |
(if s = None then s' = None else \<exists>n. iter n b (Sem c) s s')" |
13857 | 49 |
|
50 |
constdefs Valid :: "'a bexp \<Rightarrow> 'a com \<Rightarrow> 'a bexp \<Rightarrow> bool" |
|
51 |
"Valid p c q == \<forall>s s'. Sem c s s' \<longrightarrow> s : Some ` p \<longrightarrow> s' : Some ` q" |
|
52 |
||
53 |
||
54 |
syntax |
|
55 |
"@hoare_vars" :: "[idts, 'a assn,'a com,'a assn] => bool" |
|
56 |
("VARS _// {_} // _ // {_}" [0,0,55,0] 50) |
|
57 |
syntax ("" output) |
|
58 |
"@hoare" :: "['a assn,'a com,'a assn] => bool" |
|
59 |
("{_} // _ // {_}" [0,55,0] 50) |
|
60 |
||
61 |
(** parse translations **) |
|
62 |
||
63 |
ML{* |
|
64 |
||
65 |
local |
|
66 |
fun free a = Free(a,dummyT) |
|
67 |
fun abs((a,T),body) = |
|
68 |
let val a = absfree(a, dummyT, body) |
|
69 |
in if T = Bound 0 then a else Const(Syntax.constrainAbsC,dummyT) $ a $ T end |
|
70 |
in |
|
71 |
||
72 |
fun mk_abstuple [x] body = abs (x, body) |
|
73 |
| mk_abstuple (x::xs) body = |
|
74 |
Syntax.const "split" $ abs (x, mk_abstuple xs body); |
|
75 |
||
76 |
fun mk_fbody a e [x as (b,_)] = if a=b then e else free b |
|
77 |
| mk_fbody a e ((b,_)::xs) = |
|
78 |
Syntax.const "Pair" $ (if a=b then e else free b) $ mk_fbody a e xs; |
|
79 |
||
80 |
fun mk_fexp a e xs = mk_abstuple xs (mk_fbody a e xs) |
|
81 |
end |
|
82 |
*} |
|
83 |
||
84 |
(* bexp_tr & assn_tr *) |
|
85 |
(*all meta-variables for bexp except for TRUE are translated as if they |
|
86 |
were boolean expressions*) |
|
87 |
ML{* |
|
88 |
fun bexp_tr (Const ("TRUE", _)) xs = Syntax.const "TRUE" |
|
89 |
| bexp_tr b xs = Syntax.const "Collect" $ mk_abstuple xs b; |
|
90 |
||
91 |
fun assn_tr r xs = Syntax.const "Collect" $ mk_abstuple xs r; |
|
92 |
*} |
|
93 |
(* com_tr *) |
|
94 |
ML{* |
|
95 |
fun com_tr (Const("@assign",_) $ Free (a,_) $ e) xs = |
|
96 |
Syntax.const "Basic" $ mk_fexp a e xs |
|
97 |
| com_tr (Const ("Basic",_) $ f) xs = Syntax.const "Basic" $ f |
|
98 |
| com_tr (Const ("Seq",_) $ c1 $ c2) xs = |
|
99 |
Syntax.const "Seq" $ com_tr c1 xs $ com_tr c2 xs |
|
100 |
| com_tr (Const ("Cond",_) $ b $ c1 $ c2) xs = |
|
101 |
Syntax.const "Cond" $ bexp_tr b xs $ com_tr c1 xs $ com_tr c2 xs |
|
102 |
| com_tr (Const ("While",_) $ b $ I $ c) xs = |
|
103 |
Syntax.const "While" $ bexp_tr b xs $ assn_tr I xs $ com_tr c xs |
|
104 |
| com_tr t _ = t (* if t is just a Free/Var *) |
|
105 |
*} |
|
106 |
||
17781 | 107 |
(* triple_tr *) (* FIXME does not handle "_idtdummy" *) |
13857 | 108 |
ML{* |
109 |
local |
|
110 |
||
111 |
fun var_tr(Free(a,_)) = (a,Bound 0) (* Bound 0 = dummy term *) |
|
112 |
| var_tr(Const ("_constrain", _) $ (Free (a,_)) $ T) = (a,T); |
|
113 |
||
114 |
fun vars_tr (Const ("_idts", _) $ idt $ vars) = var_tr idt :: vars_tr vars |
|
115 |
| vars_tr t = [var_tr t] |
|
116 |
||
117 |
in |
|
118 |
fun hoare_vars_tr [vars, pre, prg, post] = |
|
119 |
let val xs = vars_tr vars |
|
120 |
in Syntax.const "Valid" $ |
|
121 |
assn_tr pre xs $ com_tr prg xs $ assn_tr post xs |
|
122 |
end |
|
123 |
| hoare_vars_tr ts = raise TERM ("hoare_vars_tr", ts); |
|
124 |
end |
|
125 |
*} |
|
126 |
||
127 |
parse_translation {* [("@hoare_vars", hoare_vars_tr)] *} |
|
128 |
||
129 |
||
130 |
(*****************************************************************************) |
|
131 |
||
132 |
(*** print translations ***) |
|
133 |
ML{* |
|
134 |
fun dest_abstuple (Const ("split",_) $ (Abs(v,_, body))) = |
|
135 |
subst_bound (Syntax.free v, dest_abstuple body) |
|
136 |
| dest_abstuple (Abs(v,_, body)) = subst_bound (Syntax.free v, body) |
|
137 |
| dest_abstuple trm = trm; |
|
138 |
||
139 |
fun abs2list (Const ("split",_) $ (Abs(x,T,t))) = Free (x, T)::abs2list t |
|
140 |
| abs2list (Abs(x,T,t)) = [Free (x, T)] |
|
141 |
| abs2list _ = []; |
|
142 |
||
143 |
fun mk_ts (Const ("split",_) $ (Abs(x,_,t))) = mk_ts t |
|
144 |
| mk_ts (Abs(x,_,t)) = mk_ts t |
|
145 |
| mk_ts (Const ("Pair",_) $ a $ b) = a::(mk_ts b) |
|
146 |
| mk_ts t = [t]; |
|
147 |
||
148 |
fun mk_vts (Const ("split",_) $ (Abs(x,_,t))) = |
|
149 |
((Syntax.free x)::(abs2list t), mk_ts t) |
|
150 |
| mk_vts (Abs(x,_,t)) = ([Syntax.free x], [t]) |
|
151 |
| mk_vts t = raise Match; |
|
152 |
||
153 |
fun find_ch [] i xs = (false, (Syntax.free "not_ch",Syntax.free "not_ch" )) |
|
154 |
| find_ch ((v,t)::vts) i xs = if t=(Bound i) then find_ch vts (i-1) xs |
|
155 |
else (true, (v, subst_bounds (xs,t))); |
|
156 |
||
157 |
fun is_f (Const ("split",_) $ (Abs(x,_,t))) = true |
|
158 |
| is_f (Abs(x,_,t)) = true |
|
159 |
| is_f t = false; |
|
160 |
*} |
|
161 |
||
162 |
(* assn_tr' & bexp_tr'*) |
|
163 |
ML{* |
|
164 |
fun assn_tr' (Const ("Collect",_) $ T) = dest_abstuple T |
|
32134
ee143615019c
set intersection and union now named inter and union
haftmann
parents:
30549
diff
changeset
|
165 |
| assn_tr' (Const (@{const_name inter},_) $ (Const ("Collect",_) $ T1) $ |
13857 | 166 |
(Const ("Collect",_) $ T2)) = |
30304
d8e4cd2ac2a1
set operations Int, Un, INTER, UNION, Inter, Union, empty, UNIV are now proper qualified constants with authentic syntax
haftmann
parents:
28457
diff
changeset
|
167 |
Syntax.const "Set.Int" $ dest_abstuple T1 $ dest_abstuple T2 |
13857 | 168 |
| assn_tr' t = t; |
169 |
||
170 |
fun bexp_tr' (Const ("Collect",_) $ T) = dest_abstuple T |
|
171 |
| bexp_tr' t = t; |
|
172 |
*} |
|
173 |
||
174 |
(*com_tr' *) |
|
175 |
ML{* |
|
176 |
fun mk_assign f = |
|
177 |
let val (vs, ts) = mk_vts f; |
|
178 |
val (ch, which) = find_ch (vs~~ts) ((length vs)-1) (rev vs) |
|
179 |
in if ch then Syntax.const "@assign" $ fst(which) $ snd(which) |
|
180 |
else Syntax.const "@skip" end; |
|
181 |
||
182 |
fun com_tr' (Const ("Basic",_) $ f) = if is_f f then mk_assign f |
|
183 |
else Syntax.const "Basic" $ f |
|
184 |
| com_tr' (Const ("Seq",_) $ c1 $ c2) = Syntax.const "Seq" $ |
|
185 |
com_tr' c1 $ com_tr' c2 |
|
186 |
| com_tr' (Const ("Cond",_) $ b $ c1 $ c2) = Syntax.const "Cond" $ |
|
187 |
bexp_tr' b $ com_tr' c1 $ com_tr' c2 |
|
188 |
| com_tr' (Const ("While",_) $ b $ I $ c) = Syntax.const "While" $ |
|
189 |
bexp_tr' b $ assn_tr' I $ com_tr' c |
|
190 |
| com_tr' t = t; |
|
191 |
||
192 |
||
193 |
fun spec_tr' [p, c, q] = |
|
194 |
Syntax.const "@hoare" $ assn_tr' p $ com_tr' c $ assn_tr' q |
|
195 |
*} |
|
196 |
||
197 |
print_translation {* [("Valid", spec_tr')] *} |
|
198 |
||
199 |
(*** The proof rules ***) |
|
200 |
||
201 |
lemma SkipRule: "p \<subseteq> q \<Longrightarrow> Valid p (Basic id) q" |
|
202 |
by (auto simp:Valid_def) |
|
203 |
||
204 |
lemma BasicRule: "p \<subseteq> {s. f s \<in> q} \<Longrightarrow> Valid p (Basic f) q" |
|
205 |
by (auto simp:Valid_def) |
|
206 |
||
207 |
lemma SeqRule: "Valid P c1 Q \<Longrightarrow> Valid Q c2 R \<Longrightarrow> Valid P (c1;c2) R" |
|
208 |
by (auto simp:Valid_def) |
|
209 |
||
210 |
lemma CondRule: |
|
211 |
"p \<subseteq> {s. (s \<in> b \<longrightarrow> s \<in> w) \<and> (s \<notin> b \<longrightarrow> s \<in> w')} |
|
212 |
\<Longrightarrow> Valid w c1 q \<Longrightarrow> Valid w' c2 q \<Longrightarrow> Valid p (Cond b c1 c2) q" |
|
213 |
by (fastsimp simp:Valid_def image_def) |
|
214 |
||
13875 | 215 |
lemma iter_aux: |
216 |
"! s s'. Sem c s s' \<longrightarrow> s \<in> Some ` (I \<inter> b) \<longrightarrow> s' \<in> Some ` I \<Longrightarrow> |
|
217 |
(\<And>s s'. s \<in> Some ` I \<Longrightarrow> iter n b (Sem c) s s' \<Longrightarrow> s' \<in> Some ` (I \<inter> -b))"; |
|
13857 | 218 |
apply(unfold image_def) |
219 |
apply(induct n) |
|
220 |
apply clarsimp |
|
221 |
apply(simp (no_asm_use)) |
|
222 |
apply blast |
|
223 |
done |
|
224 |
||
225 |
lemma WhileRule: |
|
226 |
"p \<subseteq> i \<Longrightarrow> Valid (i \<inter> b) c i \<Longrightarrow> i \<inter> (-b) \<subseteq> q \<Longrightarrow> Valid p (While b i c) q" |
|
227 |
apply(simp add:Valid_def) |
|
228 |
apply(simp (no_asm) add:image_def) |
|
229 |
apply clarify |
|
230 |
apply(drule iter_aux) |
|
231 |
prefer 2 apply assumption |
|
232 |
apply blast |
|
233 |
apply blast |
|
234 |
done |
|
235 |
||
236 |
lemma AbortRule: "p \<subseteq> {s. False} \<Longrightarrow> Valid p Abort q" |
|
237 |
by(auto simp:Valid_def) |
|
238 |
||
24470
41c81e23c08d
removed Hoare/hoare.ML, Hoare/hoareAbort.ML, ex/svc_oracle.ML (which can be mistaken as attached ML script on case-insensitive file-system);
wenzelm
parents:
21588
diff
changeset
|
239 |
|
41c81e23c08d
removed Hoare/hoare.ML, Hoare/hoareAbort.ML, ex/svc_oracle.ML (which can be mistaken as attached ML script on case-insensitive file-system);
wenzelm
parents:
21588
diff
changeset
|
240 |
subsection {* Derivation of the proof rules and, most importantly, the VCG tactic *} |
41c81e23c08d
removed Hoare/hoare.ML, Hoare/hoareAbort.ML, ex/svc_oracle.ML (which can be mistaken as attached ML script on case-insensitive file-system);
wenzelm
parents:
21588
diff
changeset
|
241 |
|
41c81e23c08d
removed Hoare/hoare.ML, Hoare/hoareAbort.ML, ex/svc_oracle.ML (which can be mistaken as attached ML script on case-insensitive file-system);
wenzelm
parents:
21588
diff
changeset
|
242 |
lemma Compl_Collect: "-(Collect b) = {x. ~(b x)}" |
41c81e23c08d
removed Hoare/hoare.ML, Hoare/hoareAbort.ML, ex/svc_oracle.ML (which can be mistaken as attached ML script on case-insensitive file-system);
wenzelm
parents:
21588
diff
changeset
|
243 |
by blast |
41c81e23c08d
removed Hoare/hoare.ML, Hoare/hoareAbort.ML, ex/svc_oracle.ML (which can be mistaken as attached ML script on case-insensitive file-system);
wenzelm
parents:
21588
diff
changeset
|
244 |
|
28457
25669513fd4c
major cleanup of hoare_tac.ML: just one copy for Hoare.thy and HoareAbort.thy (only 1 line different), refrain from inspecting the main goal, proper context;
wenzelm
parents:
27330
diff
changeset
|
245 |
use "hoare_tac.ML" |
13857 | 246 |
|
247 |
method_setup vcg = {* |
|
30549 | 248 |
Scan.succeed (fn ctxt => SIMPLE_METHOD' (hoare_tac ctxt (K all_tac))) *} |
13857 | 249 |
"verification condition generator" |
250 |
||
251 |
method_setup vcg_simp = {* |
|
30549 | 252 |
Scan.succeed (fn ctxt => |
32149
ef59550a55d3
renamed simpset_of to global_simpset_of, and local_simpset_of to simpset_of -- same for claset and clasimpset;
wenzelm
parents:
32134
diff
changeset
|
253 |
SIMPLE_METHOD' (hoare_tac ctxt (asm_full_simp_tac (simpset_of ctxt)))) *} |
13857 | 254 |
"verification condition generator plus simplification" |
255 |
||
13875 | 256 |
(* Special syntax for guarded statements and guarded array updates: *) |
257 |
||
258 |
syntax |
|
259 |
guarded_com :: "bool \<Rightarrow> 'a com \<Rightarrow> 'a com" ("(2_ \<rightarrow>/ _)" 71) |
|
260 |
array_update :: "'a list \<Rightarrow> nat \<Rightarrow> 'a \<Rightarrow> 'a com" ("(2_[_] :=/ _)" [70,65] 61) |
|
261 |
translations |
|
262 |
"P \<rightarrow> c" == "IF P THEN c ELSE Abort FI" |
|
34940 | 263 |
"a[i] := v" => "(i < CONST length a) \<rightarrow> (a := CONST list_update a i v)" |
13875 | 264 |
(* reverse translation not possible because of duplicate "a" *) |
265 |
||
266 |
text{* Note: there is no special syntax for guarded array access. Thus |
|
267 |
you must write @{text"j < length a \<rightarrow> a[i] := a!j"}. *} |
|
268 |
||
13857 | 269 |
end |