1476
|
1 |
(* Title: HOL/Hoare/Hoare.thy
|
1335
|
2 |
ID: $Id$
|
5646
|
3 |
Author: Leonor Prensa Nieto & Tobias Nipkow
|
|
4 |
Copyright 1998 TUM
|
1335
|
5 |
|
|
6 |
Sugared semantic embedding of Hoare logic.
|
5646
|
7 |
Strictly speaking a shallow embedding (as implemented by Norbert Galm
|
|
8 |
following Mike Gordon) would suffice. Maybe the datatype com comes in useful
|
|
9 |
later.
|
1335
|
10 |
*)
|
|
11 |
|
13682
|
12 |
theory Hoare = Main
|
13696
|
13 |
files ("hoare.ML"):
|
1335
|
14 |
|
|
15 |
types
|
13682
|
16 |
'a bexp = "'a set"
|
|
17 |
'a assn = "'a set"
|
5646
|
18 |
|
|
19 |
datatype
|
13682
|
20 |
'a com = Basic "'a \<Rightarrow> 'a"
|
|
21 |
| Seq "'a com" "'a com" ("(_;/ _)" [61,60] 60)
|
|
22 |
| Cond "'a bexp" "'a com" "'a com" ("(1IF _/ THEN _ / ELSE _/ FI)" [0,0,0] 61)
|
|
23 |
| While "'a bexp" "'a assn" "'a com" ("(1WHILE _/ INV {_} //DO _ /OD)" [0,0,0] 61)
|
5646
|
24 |
|
|
25 |
syntax
|
13682
|
26 |
"@assign" :: "id => 'b => 'a com" ("(2_ :=/ _)" [70,65] 61)
|
|
27 |
"@annskip" :: "'a com" ("SKIP")
|
5646
|
28 |
|
|
29 |
translations
|
|
30 |
"SKIP" == "Basic id"
|
|
31 |
|
13682
|
32 |
types 'a sem = "'a => 'a => bool"
|
5646
|
33 |
|
13682
|
34 |
consts iter :: "nat => 'a bexp => 'a sem => 'a sem"
|
5646
|
35 |
primrec
|
|
36 |
"iter 0 b S = (%s s'. s ~: b & (s=s'))"
|
|
37 |
"iter (Suc n) b S = (%s s'. s : b & (? s''. S s s'' & iter n b S s'' s'))"
|
|
38 |
|
13682
|
39 |
consts Sem :: "'a com => 'a sem"
|
5646
|
40 |
primrec
|
|
41 |
"Sem(Basic f) s s' = (s' = f s)"
|
|
42 |
"Sem(c1;c2) s s' = (? s''. Sem c1 s s'' & Sem c2 s'' s')"
|
|
43 |
"Sem(IF b THEN c1 ELSE c2 FI) s s' = ((s : b --> Sem c1 s s') &
|
|
44 |
(s ~: b --> Sem c2 s s'))"
|
|
45 |
"Sem(While b x c) s s' = (? n. iter n b (Sem c) s s')"
|
|
46 |
|
13682
|
47 |
constdefs Valid :: "'a bexp \<Rightarrow> 'a com \<Rightarrow> 'a bexp \<Rightarrow> bool"
|
5646
|
48 |
"Valid p c q == !s s'. Sem c s s' --> s : p --> s' : q"
|
5007
|
49 |
|
|
50 |
|
|
51 |
nonterminals
|
5646
|
52 |
vars
|
1335
|
53 |
|
|
54 |
syntax
|
5646
|
55 |
"" :: "id => vars" ("_")
|
|
56 |
"_vars" :: "[id, vars] => vars" ("_ _")
|
1558
|
57 |
|
5646
|
58 |
syntax
|
13682
|
59 |
"@hoare_vars" :: "[vars, 'a assn,'a com,'a assn] => bool"
|
5646
|
60 |
("|- VARS _.// {_} // _ // {_}" [0,0,55,0] 50)
|
|
61 |
syntax ("" output)
|
13682
|
62 |
"@hoare" :: "['a assn,'a com,'a assn] => bool"
|
5646
|
63 |
("|- {_} // _ // {_}" [0,55,0] 50)
|
1335
|
64 |
|
5646
|
65 |
(** parse translations **)
|
1335
|
66 |
|
13682
|
67 |
ML{*
|
5646
|
68 |
fun mk_abstuple [] body = absfree ("x", dummyT, body)
|
|
69 |
| mk_abstuple [v] body = absfree ((fst o dest_Free) v, dummyT, body)
|
|
70 |
| mk_abstuple (v::w) body = Syntax.const "split" $
|
|
71 |
absfree ((fst o dest_Free) v, dummyT, mk_abstuple w body);
|
1335
|
72 |
|
5646
|
73 |
|
11606
|
74 |
fun mk_fbody v e [] = Syntax.const "Unity"
|
5646
|
75 |
| mk_fbody v e [x] = if v=x then e else x
|
|
76 |
| mk_fbody v e (x::xs) = Syntax.const "Pair" $ (if v=x then e else x) $
|
|
77 |
mk_fbody v e xs;
|
1335
|
78 |
|
5646
|
79 |
fun mk_fexp v e xs = mk_abstuple xs (mk_fbody v e xs);
|
13682
|
80 |
*}
|
1335
|
81 |
|
5646
|
82 |
(* bexp_tr & assn_tr *)
|
9397
|
83 |
(*all meta-variables for bexp except for TRUE are translated as if they
|
5646
|
84 |
were boolean expressions*)
|
13682
|
85 |
ML{*
|
5646
|
86 |
fun bexp_tr (Const ("TRUE", _)) xs = Syntax.const "TRUE"
|
|
87 |
| bexp_tr b xs = Syntax.const "Collect" $ mk_abstuple xs b;
|
|
88 |
|
|
89 |
fun assn_tr r xs = Syntax.const "Collect" $ mk_abstuple xs r;
|
13682
|
90 |
*}
|
1335
|
91 |
|
5646
|
92 |
(* com_tr *)
|
13682
|
93 |
ML{*
|
5646
|
94 |
fun assign_tr [Free (V,_),E] xs = Syntax.const "Basic" $
|
|
95 |
mk_fexp (Free(V,dummyT)) E xs
|
|
96 |
| assign_tr ts _ = raise TERM ("assign_tr", ts);
|
1335
|
97 |
|
5646
|
98 |
fun com_tr (Const("@assign",_) $ Free (V,_) $ E) xs =
|
|
99 |
assign_tr [Free (V,dummyT),E] xs
|
|
100 |
| com_tr (Const ("Basic",_) $ f) xs = Syntax.const "Basic" $ f
|
|
101 |
| com_tr (Const ("Seq",_) $ c1 $ c2) xs = Syntax.const "Seq" $
|
|
102 |
com_tr c1 xs $ com_tr c2 xs
|
|
103 |
| com_tr (Const ("Cond",_) $ b $ c1 $ c2) xs = Syntax.const "Cond" $
|
|
104 |
bexp_tr b xs $ com_tr c1 xs $ com_tr c2 xs
|
|
105 |
| com_tr (Const ("While",_) $ b $ I $ c) xs = Syntax.const "While" $
|
|
106 |
bexp_tr b xs $ assn_tr I xs $ com_tr c xs
|
|
107 |
| com_tr trm _ = trm;
|
13682
|
108 |
*}
|
5646
|
109 |
|
|
110 |
(* triple_tr *)
|
13682
|
111 |
ML{*
|
5646
|
112 |
fun vars_tr (x as Free _) = [x]
|
|
113 |
| vars_tr (Const ("_vars", _) $ (x as Free _) $ vars) = x :: vars_tr vars
|
|
114 |
| vars_tr t = raise TERM ("vars_tr", [t]);
|
|
115 |
|
|
116 |
fun hoare_vars_tr [vars, pre, prg, post] =
|
|
117 |
let val xs = vars_tr vars
|
|
118 |
in Syntax.const "Valid" $
|
|
119 |
assn_tr pre xs $ com_tr prg xs $ assn_tr post xs
|
|
120 |
end
|
|
121 |
| hoare_vars_tr ts = raise TERM ("hoare_vars_tr", ts);
|
13682
|
122 |
*}
|
5646
|
123 |
|
13682
|
124 |
parse_translation {* [("@hoare_vars", hoare_vars_tr)] *}
|
1335
|
125 |
|
|
126 |
|
5646
|
127 |
(*****************************************************************************)
|
|
128 |
|
|
129 |
(*** print translations ***)
|
13682
|
130 |
ML{*
|
5646
|
131 |
fun dest_abstuple (Const ("split",_) $ (Abs(v,_, body))) =
|
|
132 |
subst_bound (Syntax.free v, dest_abstuple body)
|
|
133 |
| dest_abstuple (Abs(v,_, body)) = subst_bound (Syntax.free v, body)
|
|
134 |
| dest_abstuple trm = trm;
|
1335
|
135 |
|
5646
|
136 |
fun abs2list (Const ("split",_) $ (Abs(x,T,t))) = Free (x, T)::abs2list t
|
|
137 |
| abs2list (Abs(x,T,t)) = [Free (x, T)]
|
|
138 |
| abs2list _ = [];
|
1335
|
139 |
|
5646
|
140 |
fun mk_ts (Const ("split",_) $ (Abs(x,_,t))) = mk_ts t
|
|
141 |
| mk_ts (Abs(x,_,t)) = mk_ts t
|
|
142 |
| mk_ts (Const ("Pair",_) $ a $ b) = a::(mk_ts b)
|
|
143 |
| mk_ts t = [t];
|
1335
|
144 |
|
5646
|
145 |
fun mk_vts (Const ("split",_) $ (Abs(x,_,t))) =
|
|
146 |
((Syntax.free x)::(abs2list t), mk_ts t)
|
|
147 |
| mk_vts (Abs(x,_,t)) = ([Syntax.free x], [t])
|
|
148 |
| mk_vts t = raise Match;
|
|
149 |
|
|
150 |
fun find_ch [] i xs = (false, (Syntax.free "not_ch",Syntax.free "not_ch" ))
|
|
151 |
| find_ch ((v,t)::vts) i xs = if t=(Bound i) then find_ch vts (i-1) xs
|
|
152 |
else (true, (v, subst_bounds (xs,t)));
|
|
153 |
|
|
154 |
fun is_f (Const ("split",_) $ (Abs(x,_,t))) = true
|
|
155 |
| is_f (Abs(x,_,t)) = true
|
|
156 |
| is_f t = false;
|
13682
|
157 |
*}
|
|
158 |
|
5646
|
159 |
(* assn_tr' & bexp_tr'*)
|
13682
|
160 |
ML{*
|
5646
|
161 |
fun assn_tr' (Const ("Collect",_) $ T) = dest_abstuple T
|
|
162 |
| assn_tr' (Const ("op Int",_) $ (Const ("Collect",_) $ T1) $
|
|
163 |
(Const ("Collect",_) $ T2)) =
|
|
164 |
Syntax.const "op Int" $ dest_abstuple T1 $ dest_abstuple T2
|
|
165 |
| assn_tr' t = t;
|
1335
|
166 |
|
5646
|
167 |
fun bexp_tr' (Const ("Collect",_) $ T) = dest_abstuple T
|
|
168 |
| bexp_tr' t = t;
|
13682
|
169 |
*}
|
5646
|
170 |
|
|
171 |
(*com_tr' *)
|
13682
|
172 |
ML{*
|
5646
|
173 |
fun mk_assign f =
|
|
174 |
let val (vs, ts) = mk_vts f;
|
|
175 |
val (ch, which) = find_ch (vs~~ts) ((length vs)-1) (rev vs)
|
|
176 |
in if ch then Syntax.const "@assign" $ fst(which) $ snd(which)
|
|
177 |
else Syntax.const "@skip" end;
|
1335
|
178 |
|
5646
|
179 |
fun com_tr' (Const ("Basic",_) $ f) = if is_f f then mk_assign f
|
|
180 |
else Syntax.const "Basic" $ f
|
|
181 |
| com_tr' (Const ("Seq",_) $ c1 $ c2) = Syntax.const "Seq" $
|
|
182 |
com_tr' c1 $ com_tr' c2
|
|
183 |
| com_tr' (Const ("Cond",_) $ b $ c1 $ c2) = Syntax.const "Cond" $
|
|
184 |
bexp_tr' b $ com_tr' c1 $ com_tr' c2
|
|
185 |
| com_tr' (Const ("While",_) $ b $ I $ c) = Syntax.const "While" $
|
|
186 |
bexp_tr' b $ assn_tr' I $ com_tr' c
|
|
187 |
| com_tr' t = t;
|
1335
|
188 |
|
|
189 |
|
5646
|
190 |
fun spec_tr' [p, c, q] =
|
|
191 |
Syntax.const "@hoare" $ assn_tr' p $ com_tr' c $ assn_tr' q
|
13682
|
192 |
*}
|
|
193 |
|
|
194 |
print_translation {* [("Valid", spec_tr')] *}
|
|
195 |
|
13696
|
196 |
use "hoare.ML"
|
13682
|
197 |
|
|
198 |
method_setup vcg = {*
|
|
199 |
Method.no_args
|
|
200 |
(Method.SIMPLE_METHOD' HEADGOAL (hoare_tac (K all_tac))) *}
|
|
201 |
"verification condition generator"
|
|
202 |
|
|
203 |
method_setup vcg_simp = {*
|
|
204 |
Method.ctxt_args (fn ctxt =>
|
|
205 |
Method.METHOD (fn facts =>
|
|
206 |
hoare_tac (asm_full_simp_tac (Simplifier.get_local_simpset ctxt))1)) *}
|
|
207 |
"verification condition generator plus simplification"
|
|
208 |
|
|
209 |
end
|