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