src/HOL/Hoare/Hoare.thy
author wenzelm
Mon Mar 16 18:24:30 2009 +0100 (2009-03-16)
changeset 30549 d2d7874648bd
parent 30510 4120fc59dd85
child 32134 ee143615019c
permissions -rw-r--r--
simplified method setup;
clasohm@1476
     1
(*  Title:      HOL/Hoare/Hoare.thy
nipkow@1335
     2
    ID:         $Id$
nipkow@5646
     3
    Author:     Leonor Prensa Nieto & Tobias Nipkow
nipkow@5646
     4
    Copyright   1998 TUM
nipkow@1335
     5
nipkow@1335
     6
Sugared semantic embedding of Hoare logic.
nipkow@5646
     7
Strictly speaking a shallow embedding (as implemented by Norbert Galm
nipkow@5646
     8
following Mike Gordon) would suffice. Maybe the datatype com comes in useful
nipkow@5646
     9
later.
nipkow@1335
    10
*)
nipkow@1335
    11
wenzelm@28457
    12
theory Hoare
wenzelm@28457
    13
imports Main
wenzelm@24472
    14
uses ("hoare_tac.ML")
wenzelm@24470
    15
begin
nipkow@1335
    16
nipkow@1335
    17
types
nipkow@13682
    18
    'a bexp = "'a set"
nipkow@13682
    19
    'a assn = "'a set"
nipkow@5646
    20
nipkow@5646
    21
datatype
nipkow@13682
    22
 'a com = Basic "'a \<Rightarrow> 'a"         
nipkow@13682
    23
   | Seq "'a com" "'a com"               ("(_;/ _)"      [61,60] 60)
nipkow@13682
    24
   | Cond "'a bexp" "'a com" "'a com"    ("(1IF _/ THEN _ / ELSE _/ FI)"  [0,0,0] 61)
nipkow@13682
    25
   | While "'a bexp" "'a assn" "'a com"  ("(1WHILE _/ INV {_} //DO _ /OD)"  [0,0,0] 61)
nipkow@5646
    26
  
nipkow@5646
    27
syntax
nipkow@13682
    28
  "@assign"  :: "id => 'b => 'a com"        ("(2_ :=/ _)" [70,65] 61)
nipkow@13682
    29
  "@annskip" :: "'a com"                    ("SKIP")
nipkow@5646
    30
nipkow@5646
    31
translations
nipkow@5646
    32
            "SKIP" == "Basic id"
nipkow@5646
    33
nipkow@13682
    34
types 'a sem = "'a => 'a => bool"
nipkow@5646
    35
nipkow@13682
    36
consts iter :: "nat => 'a bexp => 'a sem => 'a sem"
nipkow@5646
    37
primrec
nipkow@5646
    38
"iter 0 b S = (%s s'. s ~: b & (s=s'))"
nipkow@5646
    39
"iter (Suc n) b S = (%s s'. s : b & (? s''. S s s'' & iter n b S s'' s'))"
nipkow@5646
    40
nipkow@13682
    41
consts Sem :: "'a com => 'a sem"
nipkow@5646
    42
primrec
nipkow@5646
    43
"Sem(Basic f) s s' = (s' = f s)"
nipkow@5646
    44
"Sem(c1;c2) s s' = (? s''. Sem c1 s s'' & Sem c2 s'' s')"
nipkow@5646
    45
"Sem(IF b THEN c1 ELSE c2 FI) s s' = ((s  : b --> Sem c1 s s') &
nipkow@5646
    46
                                      (s ~: b --> Sem c2 s s'))"
nipkow@5646
    47
"Sem(While b x c) s s' = (? n. iter n b (Sem c) s s')"
nipkow@5646
    48
nipkow@13682
    49
constdefs Valid :: "'a bexp \<Rightarrow> 'a com \<Rightarrow> 'a bexp \<Rightarrow> bool"
nipkow@5646
    50
  "Valid p c q == !s s'. Sem c s s' --> s : p --> s' : q"
wenzelm@5007
    51
wenzelm@5007
    52
nipkow@1335
    53
syntax
nipkow@13764
    54
 "@hoare_vars" :: "[idts, 'a assn,'a com,'a assn] => bool"
nipkow@13737
    55
                 ("VARS _// {_} // _ // {_}" [0,0,55,0] 50)
nipkow@5646
    56
syntax ("" output)
nipkow@13682
    57
 "@hoare"      :: "['a assn,'a com,'a assn] => bool"
nipkow@13737
    58
                 ("{_} // _ // {_}" [0,55,0] 50)
nipkow@1335
    59
nipkow@5646
    60
(** parse translations **)
nipkow@1335
    61
nipkow@13682
    62
ML{*
nipkow@13764
    63
nipkow@13764
    64
local
nipkow@13857
    65
nipkow@13764
    66
fun abs((a,T),body) =
nipkow@13764
    67
  let val a = absfree(a, dummyT, body)
nipkow@13764
    68
  in if T = Bound 0 then a else Const(Syntax.constrainAbsC,dummyT) $ a $ T end
nipkow@13764
    69
in
nipkow@1335
    70
nipkow@13764
    71
fun mk_abstuple [x] body = abs (x, body)
nipkow@13764
    72
  | mk_abstuple (x::xs) body =
nipkow@13764
    73
      Syntax.const "split" $ abs (x, mk_abstuple xs body);
nipkow@1335
    74
nipkow@13857
    75
fun mk_fbody a e [x as (b,_)] = if a=b then e else Syntax.free b
nipkow@13764
    76
  | mk_fbody a e ((b,_)::xs) =
nipkow@13857
    77
      Syntax.const "Pair" $ (if a=b then e else Syntax.free b) $ mk_fbody a e xs;
nipkow@13764
    78
nipkow@13764
    79
fun mk_fexp a e xs = mk_abstuple xs (mk_fbody a e xs)
nipkow@13764
    80
end
nipkow@13682
    81
*}
nipkow@1335
    82
nipkow@5646
    83
(* bexp_tr & assn_tr *)
prensani@9397
    84
(*all meta-variables for bexp except for TRUE are translated as if they
nipkow@5646
    85
  were boolean expressions*)
nipkow@13682
    86
ML{*
nipkow@5646
    87
fun bexp_tr (Const ("TRUE", _)) xs = Syntax.const "TRUE"
nipkow@5646
    88
  | bexp_tr b xs = Syntax.const "Collect" $ mk_abstuple xs b;
nipkow@5646
    89
  
nipkow@5646
    90
fun assn_tr r xs = Syntax.const "Collect" $ mk_abstuple xs r;
nipkow@13682
    91
*}
nipkow@5646
    92
(* com_tr *)
nipkow@13682
    93
ML{*
nipkow@13764
    94
fun com_tr (Const("@assign",_) $ Free (a,_) $ e) xs =
nipkow@13764
    95
      Syntax.const "Basic" $ mk_fexp a e xs
nipkow@5646
    96
  | com_tr (Const ("Basic",_) $ f) xs = Syntax.const "Basic" $ f
nipkow@13764
    97
  | com_tr (Const ("Seq",_) $ c1 $ c2) xs =
nipkow@13764
    98
      Syntax.const "Seq" $ com_tr c1 xs $ com_tr c2 xs
nipkow@13764
    99
  | com_tr (Const ("Cond",_) $ b $ c1 $ c2) xs =
nipkow@13764
   100
      Syntax.const "Cond" $ bexp_tr b xs $ com_tr c1 xs $ com_tr c2 xs
nipkow@13764
   101
  | com_tr (Const ("While",_) $ b $ I $ c) xs =
nipkow@13764
   102
      Syntax.const "While" $ bexp_tr b xs $ assn_tr I xs $ com_tr c xs
nipkow@13764
   103
  | com_tr t _ = t (* if t is just a Free/Var *)
nipkow@13682
   104
*}
nipkow@5646
   105
wenzelm@17781
   106
(* triple_tr *)    (* FIXME does not handle "_idtdummy" *)
nipkow@13682
   107
ML{*
nipkow@13764
   108
local
nipkow@13764
   109
nipkow@13764
   110
fun var_tr(Free(a,_)) = (a,Bound 0) (* Bound 0 = dummy term *)
nipkow@13764
   111
  | var_tr(Const ("_constrain", _) $ (Free (a,_)) $ T) = (a,T);
nipkow@5646
   112
nipkow@13764
   113
fun vars_tr (Const ("_idts", _) $ idt $ vars) = var_tr idt :: vars_tr vars
nipkow@13764
   114
  | vars_tr t = [var_tr t]
nipkow@13764
   115
nipkow@13764
   116
in
nipkow@5646
   117
fun hoare_vars_tr [vars, pre, prg, post] =
nipkow@5646
   118
      let val xs = vars_tr vars
nipkow@5646
   119
      in Syntax.const "Valid" $
nipkow@13764
   120
         assn_tr pre xs $ com_tr prg xs $ assn_tr post xs
nipkow@5646
   121
      end
nipkow@5646
   122
  | hoare_vars_tr ts = raise TERM ("hoare_vars_tr", ts);
nipkow@13764
   123
end
nipkow@13682
   124
*}
nipkow@5646
   125
nipkow@13682
   126
parse_translation {* [("@hoare_vars", hoare_vars_tr)] *}
nipkow@1335
   127
nipkow@1335
   128
nipkow@5646
   129
(*****************************************************************************)
nipkow@5646
   130
nipkow@5646
   131
(*** print translations ***)
nipkow@13682
   132
ML{*
nipkow@5646
   133
fun dest_abstuple (Const ("split",_) $ (Abs(v,_, body))) =
nipkow@5646
   134
                            subst_bound (Syntax.free v, dest_abstuple body)
nipkow@5646
   135
  | dest_abstuple (Abs(v,_, body)) = subst_bound (Syntax.free v, body)
nipkow@5646
   136
  | dest_abstuple trm = trm;
nipkow@1335
   137
nipkow@5646
   138
fun abs2list (Const ("split",_) $ (Abs(x,T,t))) = Free (x, T)::abs2list t
nipkow@5646
   139
  | abs2list (Abs(x,T,t)) = [Free (x, T)]
nipkow@5646
   140
  | abs2list _ = [];
nipkow@1335
   141
nipkow@5646
   142
fun mk_ts (Const ("split",_) $ (Abs(x,_,t))) = mk_ts t
nipkow@5646
   143
  | mk_ts (Abs(x,_,t)) = mk_ts t
nipkow@5646
   144
  | mk_ts (Const ("Pair",_) $ a $ b) = a::(mk_ts b)
nipkow@5646
   145
  | mk_ts t = [t];
nipkow@1335
   146
nipkow@5646
   147
fun mk_vts (Const ("split",_) $ (Abs(x,_,t))) = 
nipkow@5646
   148
           ((Syntax.free x)::(abs2list t), mk_ts t)
nipkow@5646
   149
  | mk_vts (Abs(x,_,t)) = ([Syntax.free x], [t])
nipkow@5646
   150
  | mk_vts t = raise Match;
nipkow@5646
   151
  
nipkow@5646
   152
fun find_ch [] i xs = (false, (Syntax.free "not_ch",Syntax.free "not_ch" ))
nipkow@5646
   153
  | find_ch ((v,t)::vts) i xs = if t=(Bound i) then find_ch vts (i-1) xs
nipkow@5646
   154
              else (true, (v, subst_bounds (xs,t)));
nipkow@5646
   155
  
nipkow@5646
   156
fun is_f (Const ("split",_) $ (Abs(x,_,t))) = true
nipkow@5646
   157
  | is_f (Abs(x,_,t)) = true
nipkow@5646
   158
  | is_f t = false;
nipkow@13682
   159
*}
nipkow@13682
   160
nipkow@5646
   161
(* assn_tr' & bexp_tr'*)
nipkow@13682
   162
ML{*  
nipkow@5646
   163
fun assn_tr' (Const ("Collect",_) $ T) = dest_abstuple T
haftmann@30304
   164
  | assn_tr' (Const (@{const_name Set.Int}, _) $ (Const ("Collect",_) $ T1) $ 
nipkow@5646
   165
                                   (Const ("Collect",_) $ T2)) =  
haftmann@30304
   166
            Syntax.const "Set.Int" $ dest_abstuple T1 $ dest_abstuple T2
nipkow@5646
   167
  | assn_tr' t = t;
nipkow@1335
   168
nipkow@5646
   169
fun bexp_tr' (Const ("Collect",_) $ T) = dest_abstuple T 
nipkow@5646
   170
  | bexp_tr' t = t;
nipkow@13682
   171
*}
nipkow@5646
   172
nipkow@5646
   173
(*com_tr' *)
nipkow@13682
   174
ML{*
nipkow@5646
   175
fun mk_assign f =
nipkow@5646
   176
  let val (vs, ts) = mk_vts f;
nipkow@5646
   177
      val (ch, which) = find_ch (vs~~ts) ((length vs)-1) (rev vs)
nipkow@5646
   178
  in if ch then Syntax.const "@assign" $ fst(which) $ snd(which)
nipkow@5646
   179
     else Syntax.const "@skip" end;
nipkow@1335
   180
nipkow@5646
   181
fun com_tr' (Const ("Basic",_) $ f) = if is_f f then mk_assign f
nipkow@5646
   182
                                           else Syntax.const "Basic" $ f
nipkow@5646
   183
  | com_tr' (Const ("Seq",_) $ c1 $ c2) = Syntax.const "Seq" $
nipkow@5646
   184
                                                 com_tr' c1 $ com_tr' c2
nipkow@5646
   185
  | com_tr' (Const ("Cond",_) $ b $ c1 $ c2) = Syntax.const "Cond" $
nipkow@5646
   186
                                           bexp_tr' b $ com_tr' c1 $ com_tr' c2
nipkow@5646
   187
  | com_tr' (Const ("While",_) $ b $ I $ c) = Syntax.const "While" $
nipkow@5646
   188
                                               bexp_tr' b $ assn_tr' I $ com_tr' c
nipkow@5646
   189
  | com_tr' t = t;
nipkow@1335
   190
nipkow@1335
   191
nipkow@5646
   192
fun spec_tr' [p, c, q] =
nipkow@5646
   193
  Syntax.const "@hoare" $ assn_tr' p $ com_tr' c $ assn_tr' q
nipkow@13682
   194
*}
nipkow@13682
   195
nipkow@13682
   196
print_translation {* [("Valid", spec_tr')] *}
nipkow@13682
   197
nipkow@13857
   198
lemma SkipRule: "p \<subseteq> q \<Longrightarrow> Valid p (Basic id) q"
nipkow@13857
   199
by (auto simp:Valid_def)
nipkow@13857
   200
nipkow@13857
   201
lemma BasicRule: "p \<subseteq> {s. f s \<in> q} \<Longrightarrow> Valid p (Basic f) q"
nipkow@13857
   202
by (auto simp:Valid_def)
nipkow@13857
   203
nipkow@13857
   204
lemma SeqRule: "Valid P c1 Q \<Longrightarrow> Valid Q c2 R \<Longrightarrow> Valid P (c1;c2) R"
nipkow@13857
   205
by (auto simp:Valid_def)
nipkow@13857
   206
nipkow@13857
   207
lemma CondRule:
nipkow@13857
   208
 "p \<subseteq> {s. (s \<in> b \<longrightarrow> s \<in> w) \<and> (s \<notin> b \<longrightarrow> s \<in> w')}
nipkow@13857
   209
  \<Longrightarrow> Valid w c1 q \<Longrightarrow> Valid w' c2 q \<Longrightarrow> Valid p (Cond b c1 c2) q"
nipkow@13857
   210
by (auto simp:Valid_def)
nipkow@13857
   211
nipkow@13857
   212
lemma iter_aux: "! s s'. Sem c s s' --> s : I & s : b --> s' : I ==>
nipkow@13857
   213
       (\<And>s s'. s : I \<Longrightarrow> iter n b (Sem c) s s' \<Longrightarrow> s' : I & s' ~: b)";
nipkow@13857
   214
apply(induct n)
nipkow@13857
   215
 apply clarsimp
nipkow@13857
   216
apply(simp (no_asm_use))
nipkow@13857
   217
apply blast
nipkow@13857
   218
done
nipkow@13857
   219
nipkow@13857
   220
lemma WhileRule:
nipkow@13857
   221
 "p \<subseteq> i \<Longrightarrow> Valid (i \<inter> b) c i \<Longrightarrow> i \<inter> (-b) \<subseteq> q \<Longrightarrow> Valid p (While b i c) q"
nipkow@13857
   222
apply (clarsimp simp:Valid_def)
nipkow@13857
   223
apply(drule iter_aux)
nipkow@13857
   224
  prefer 2 apply assumption
nipkow@13857
   225
 apply blast
nipkow@13857
   226
apply blast
nipkow@13857
   227
done
nipkow@13857
   228
nipkow@13857
   229
wenzelm@24470
   230
lemma Compl_Collect: "-(Collect b) = {x. ~(b x)}"
wenzelm@24470
   231
  by blast
wenzelm@24470
   232
wenzelm@28457
   233
lemmas AbortRule = SkipRule  -- "dummy version"
wenzelm@24472
   234
use "hoare_tac.ML"
nipkow@13682
   235
nipkow@13682
   236
method_setup vcg = {*
wenzelm@30549
   237
  Scan.succeed (fn ctxt => SIMPLE_METHOD' (hoare_tac ctxt (K all_tac))) *}
nipkow@13682
   238
  "verification condition generator"
nipkow@13682
   239
nipkow@13682
   240
method_setup vcg_simp = {*
wenzelm@30549
   241
  Scan.succeed (fn ctxt =>
wenzelm@30510
   242
    SIMPLE_METHOD' (hoare_tac ctxt (asm_full_simp_tac (local_simpset_of ctxt)))) *}
nipkow@13682
   243
  "verification condition generator plus simplification"
nipkow@13682
   244
nipkow@13682
   245
end