src/ZF/UNITY/ClientImpl.thy
author wenzelm
Sun Jul 29 14:30:07 2007 +0200 (2007-07-29)
changeset 24051 896fb015079c
parent 16417 9bc16273c2d4
child 24892 c663e675e177
permissions -rw-r--r--
replaced program_defs_ref by proper context data (via attribute "program");
paulson@14053
     1
(*  Title:      ZF/UNITY/ClientImpl.thy
paulson@14053
     2
    ID:         $Id$
paulson@14053
     3
    Author:     Sidi O Ehmety, Cambridge University Computer Laboratory
paulson@14053
     4
    Copyright   2002  University of Cambridge
paulson@14053
     5
paulson@14053
     6
Distributed Resource Management System:  Client Implementation
paulson@14053
     7
*)
paulson@14053
     8
paulson@14053
     9
haftmann@16417
    10
theory ClientImpl imports AllocBase Guar begin
paulson@14072
    11
paulson@14053
    12
consts
paulson@14053
    13
  ask :: i (* input history:  tokens requested *)
paulson@14053
    14
  giv :: i (* output history: tokens granted *)
paulson@14053
    15
  rel :: i (* input history: tokens released *)
paulson@14053
    16
  tok :: i (* the number of available tokens *)
paulson@14053
    17
paulson@14053
    18
translations
paulson@14053
    19
  "ask" == "Var(Nil)"
paulson@14053
    20
  "giv" == "Var([0])"
paulson@14053
    21
  "rel" == "Var([1])"
paulson@14053
    22
  "tok" == "Var([2])"
paulson@14053
    23
paulson@14061
    24
axioms
paulson@14061
    25
  type_assumes:
paulson@14053
    26
  "type_of(ask) = list(tokbag) & type_of(giv) = list(tokbag) & 
paulson@14053
    27
   type_of(rel) = list(tokbag) & type_of(tok) = nat"
paulson@14061
    28
  default_val_assumes:
paulson@14053
    29
  "default_val(ask) = Nil & default_val(giv)  = Nil & 
paulson@14053
    30
   default_val(rel)  = Nil & default_val(tok)  = 0"
paulson@14053
    31
paulson@14053
    32
paulson@14053
    33
(*Array indexing is translated to list indexing as A[n] == nth(n-1,A). *)
paulson@14053
    34
paulson@14053
    35
constdefs
paulson@14053
    36
 (** Release some client_tokens **)
paulson@14053
    37
  
paulson@14053
    38
  client_rel_act ::i
paulson@14053
    39
    "client_rel_act ==
paulson@14061
    40
     {<s,t> \<in> state*state.
paulson@14061
    41
      \<exists>nrel \<in> nat. nrel = length(s`rel) &
paulson@14057
    42
                   t = s(rel:=(s`rel)@[nth(nrel, s`giv)]) &
paulson@14057
    43
                   nrel < length(s`giv) &
paulson@14061
    44
                   nth(nrel, s`ask) \<le> nth(nrel, s`giv)}"
paulson@14053
    45
  
paulson@14053
    46
  (** Choose a new token requirement **)
paulson@14057
    47
  (** Including t=s suppresses fairness, allowing the non-trivial part
paulson@14053
    48
      of the action to be ignored **)
paulson@14053
    49
paulson@14053
    50
  client_tok_act :: i
paulson@14061
    51
 "client_tok_act == {<s,t> \<in> state*state. t=s |
paulson@14057
    52
		     t = s(tok:=succ(s`tok mod NbT))}"
paulson@14053
    53
paulson@14053
    54
  client_ask_act :: i
paulson@14061
    55
  "client_ask_act == {<s,t> \<in> state*state. t=s | (t=s(ask:=s`ask@[s`tok]))}"
paulson@14053
    56
  
paulson@14053
    57
  client_prog :: i
paulson@14053
    58
  "client_prog ==
paulson@14061
    59
   mk_program({s \<in> state. s`tok \<le> NbT & s`giv = Nil &
paulson@14053
    60
	               s`ask = Nil & s`rel = Nil},
paulson@14053
    61
                    {client_rel_act, client_tok_act, client_ask_act},
paulson@14061
    62
                   \<Union>G \<in> preserves(lift(rel)) Int
paulson@14053
    63
			 preserves(lift(ask)) Int
paulson@14053
    64
	                 preserves(lift(tok)).  Acts(G))"
paulson@14061
    65
paulson@14061
    66
paulson@14061
    67
declare type_assumes [simp] default_val_assumes [simp]
paulson@14061
    68
(* This part should be automated *)
paulson@14061
    69
paulson@14061
    70
lemma ask_value_type [simp,TC]: "s \<in> state ==> s`ask \<in> list(nat)"
paulson@14061
    71
apply (unfold state_def)
paulson@14061
    72
apply (drule_tac a = ask in apply_type, auto)
paulson@14061
    73
done
paulson@14061
    74
paulson@14061
    75
lemma giv_value_type [simp,TC]: "s \<in> state ==> s`giv \<in> list(nat)"
paulson@14061
    76
apply (unfold state_def)
paulson@14061
    77
apply (drule_tac a = giv in apply_type, auto)
paulson@14061
    78
done
paulson@14061
    79
paulson@14061
    80
lemma rel_value_type [simp,TC]: "s \<in> state ==> s`rel \<in> list(nat)"
paulson@14061
    81
apply (unfold state_def)
paulson@14061
    82
apply (drule_tac a = rel in apply_type, auto)
paulson@14061
    83
done
paulson@14061
    84
paulson@14061
    85
lemma tok_value_type [simp,TC]: "s \<in> state ==> s`tok \<in> nat"
paulson@14061
    86
apply (unfold state_def)
paulson@14061
    87
apply (drule_tac a = tok in apply_type, auto)
paulson@14061
    88
done
paulson@14061
    89
paulson@14061
    90
(** The Client Program **)
paulson@14061
    91
paulson@14061
    92
lemma client_type [simp,TC]: "client_prog \<in> program"
paulson@14061
    93
apply (unfold client_prog_def)
paulson@14061
    94
apply (simp (no_asm))
paulson@14061
    95
done
paulson@14061
    96
paulson@14061
    97
declare client_prog_def [THEN def_prg_Init, simp]
paulson@14061
    98
declare client_prog_def [THEN def_prg_AllowedActs, simp]
wenzelm@24051
    99
declare client_prog_def [program]
paulson@14061
   100
paulson@14061
   101
declare  client_rel_act_def [THEN def_act_simp, simp]
paulson@14061
   102
declare  client_tok_act_def [THEN def_act_simp, simp]
paulson@14061
   103
declare  client_ask_act_def [THEN def_act_simp, simp]
paulson@14061
   104
paulson@14061
   105
lemma client_prog_ok_iff:
paulson@14061
   106
  "\<forall>G \<in> program. (client_prog ok G) <->  
paulson@14061
   107
   (G \<in> preserves(lift(rel)) & G \<in> preserves(lift(ask)) &  
paulson@14061
   108
    G \<in> preserves(lift(tok)) &  client_prog \<in> Allowed(G))"
paulson@14061
   109
by (auto simp add: ok_iff_Allowed client_prog_def [THEN def_prg_Allowed])
paulson@14061
   110
paulson@14061
   111
lemma client_prog_preserves:
paulson@14061
   112
    "client_prog:(\<Inter>x \<in> var-{ask, rel, tok}. preserves(lift(x)))"
paulson@14061
   113
apply (rule Inter_var_DiffI, force)
paulson@14061
   114
apply (rule ballI)
paulson@16183
   115
apply (rule preservesI, safety, auto)
paulson@14061
   116
done
paulson@14061
   117
paulson@14061
   118
paulson@14061
   119
lemma preserves_lift_imp_stable:
paulson@14061
   120
     "G \<in> preserves(lift(ff)) ==> G \<in> stable({s \<in> state. P(s`ff)})";
paulson@14061
   121
apply (drule preserves_imp_stable)
paulson@14061
   122
apply (simp add: lift_def) 
paulson@14061
   123
done
paulson@14061
   124
paulson@14061
   125
lemma preserves_imp_prefix:
paulson@14061
   126
     "G \<in> preserves(lift(ff)) 
paulson@14061
   127
      ==> G \<in> stable({s \<in> state. \<langle>k, s`ff\<rangle> \<in> prefix(nat)})";
paulson@14061
   128
by (erule preserves_lift_imp_stable) 
paulson@14061
   129
paulson@14061
   130
(*Safety property 1: ask, rel are increasing: (24) *)
paulson@14061
   131
lemma client_prog_Increasing_ask_rel: 
paulson@14061
   132
"client_prog: program guarantees Incr(lift(ask)) Int Incr(lift(rel))"
paulson@14061
   133
apply (unfold guar_def)
paulson@14061
   134
apply (auto intro!: increasing_imp_Increasing 
paulson@14061
   135
            simp add: client_prog_ok_iff increasing_def preserves_imp_prefix)
paulson@16183
   136
apply (safety, force, force)+
paulson@14061
   137
done
paulson@14061
   138
paulson@14061
   139
declare nth_append [simp] append_one_prefix [simp]
paulson@14061
   140
paulson@14061
   141
lemma NbT_pos2: "0<NbT"
paulson@14061
   142
apply (cut_tac NbT_pos)
paulson@14061
   143
apply (rule Ord_0_lt, auto)
paulson@14061
   144
done
paulson@14061
   145
paulson@14061
   146
(*Safety property 2: the client never requests too many tokens.
paulson@14061
   147
With no Substitution Axiom, we must prove the two invariants simultaneously. *)
paulson@14061
   148
paulson@14061
   149
lemma ask_Bounded_lemma: 
paulson@14061
   150
"[| client_prog ok G; G \<in> program |] 
paulson@14072
   151
      ==> client_prog \<squnion> G \<in>    
paulson@14061
   152
              Always({s \<in> state. s`tok \<le> NbT}  Int   
paulson@14061
   153
                      {s \<in> state. \<forall>elt \<in> set_of_list(s`ask). elt \<le> NbT})"
paulson@14061
   154
apply (rotate_tac -1)
paulson@14061
   155
apply (auto simp add: client_prog_ok_iff)
paulson@14061
   156
apply (rule invariantI [THEN stable_Join_Always2], force) 
paulson@14061
   157
 prefer 2
paulson@16183
   158
 apply (fast intro: stable_Int preserves_lift_imp_stable, safety)
paulson@14061
   159
apply (auto dest: ActsD)
paulson@14061
   160
apply (cut_tac NbT_pos)
paulson@14061
   161
apply (rule NbT_pos2 [THEN mod_less_divisor])
paulson@14061
   162
apply (auto dest: ActsD preserves_imp_eq simp add: set_of_list_append)
paulson@14061
   163
done
paulson@14061
   164
paulson@14061
   165
(* Export version, with no mention of tok in the postcondition, but
paulson@14061
   166
  unfortunately tok must be declared local.*)
paulson@14061
   167
lemma client_prog_ask_Bounded: 
paulson@14061
   168
    "client_prog \<in> program guarantees  
paulson@14061
   169
                   Always({s \<in> state. \<forall>elt \<in> set_of_list(s`ask). elt \<le> NbT})"
paulson@14061
   170
apply (rule guaranteesI)
paulson@14061
   171
apply (erule ask_Bounded_lemma [THEN Always_weaken], auto)
paulson@14061
   172
done
paulson@14061
   173
paulson@14061
   174
(*** Towards proving the liveness property ***)
paulson@14061
   175
paulson@14061
   176
lemma client_prog_stable_rel_le_giv: 
paulson@14061
   177
    "client_prog \<in> stable({s \<in> state. <s`rel, s`giv> \<in> prefix(nat)})"
paulson@16183
   178
by (safety, auto)
paulson@14061
   179
paulson@14061
   180
lemma client_prog_Join_Stable_rel_le_giv: 
paulson@14072
   181
"[| client_prog \<squnion> G \<in> Incr(lift(giv)); G \<in> preserves(lift(rel)) |]  
paulson@14072
   182
    ==> client_prog \<squnion> G \<in> Stable({s \<in> state. <s`rel, s`giv> \<in> prefix(nat)})"
paulson@14061
   183
apply (rule client_prog_stable_rel_le_giv [THEN Increasing_preserves_Stable])
paulson@14061
   184
apply (auto simp add: lift_def)
paulson@14061
   185
done
paulson@14061
   186
paulson@14061
   187
lemma client_prog_Join_Always_rel_le_giv:
paulson@14072
   188
     "[| client_prog \<squnion> G \<in> Incr(lift(giv)); G \<in> preserves(lift(rel)) |]  
paulson@14072
   189
    ==> client_prog \<squnion> G  \<in> Always({s \<in> state. <s`rel, s`giv> \<in> prefix(nat)})"
paulson@14061
   190
by (force intro!: AlwaysI client_prog_Join_Stable_rel_le_giv)
paulson@14061
   191
paulson@14061
   192
lemma def_act_eq:
paulson@14061
   193
     "A == {<s, t> \<in> state*state. P(s, t)} ==> A={<s, t> \<in> state*state. P(s, t)}"
paulson@14061
   194
by auto
paulson@14061
   195
paulson@14061
   196
lemma act_subset: "A={<s,t> \<in> state*state. P(s, t)} ==> A<=state*state"
paulson@14061
   197
by auto
paulson@14061
   198
paulson@14061
   199
lemma transient_lemma: 
paulson@14061
   200
"client_prog \<in>  
paulson@14061
   201
  transient({s \<in> state. s`rel = k & <k, h> \<in> strict_prefix(nat)  
paulson@14061
   202
   & <h, s`giv> \<in> prefix(nat) & h pfixGe s`ask})"
paulson@14061
   203
apply (rule_tac act = client_rel_act in transientI)
paulson@14061
   204
apply (simp (no_asm) add: client_prog_def [THEN def_prg_Acts])
paulson@14061
   205
apply (simp (no_asm) add: client_rel_act_def [THEN def_act_eq, THEN act_subset])
paulson@14061
   206
apply (auto simp add: client_prog_def [THEN def_prg_Acts] domain_def)
paulson@14061
   207
apply (rule ReplaceI)
paulson@14061
   208
apply (rule_tac x = "x (rel:= x`rel @ [nth (length (x`rel), x`giv) ]) " in exI)
paulson@14061
   209
apply (auto intro!: state_update_type app_type length_type nth_type, auto)
paulson@14061
   210
apply (blast intro: lt_trans2 prefix_length_le strict_prefix_length_lt)
paulson@14061
   211
apply (blast intro: lt_trans2 prefix_length_le strict_prefix_length_lt)
paulson@14061
   212
apply (simp (no_asm_use) add: gen_prefix_iff_nth)
paulson@14061
   213
apply (subgoal_tac "h \<in> list(nat)")
paulson@14061
   214
 apply (simp_all (no_asm_simp) add: prefix_type [THEN subsetD, THEN SigmaD1])
paulson@14061
   215
apply (auto simp add: prefix_def Ge_def)
paulson@14061
   216
apply (drule strict_prefix_length_lt)
paulson@14061
   217
apply (drule_tac x = "length (x`rel) " in spec)
paulson@14061
   218
apply auto
paulson@14061
   219
apply (simp (no_asm_use) add: gen_prefix_iff_nth)
paulson@14061
   220
apply (auto simp add: id_def lam_def)
paulson@14061
   221
done
paulson@14061
   222
paulson@14061
   223
lemma strict_prefix_is_prefix: 
paulson@14061
   224
    "<xs, ys> \<in> strict_prefix(A) <->  <xs, ys> \<in> prefix(A) & xs\<noteq>ys"
paulson@14061
   225
apply (unfold strict_prefix_def id_def lam_def)
paulson@14061
   226
apply (auto dest: prefix_type [THEN subsetD])
paulson@14061
   227
done
paulson@14061
   228
paulson@14061
   229
lemma induct_lemma: 
paulson@14072
   230
"[| client_prog \<squnion> G \<in> Incr(lift(giv)); client_prog ok G; G \<in> program |]  
paulson@14072
   231
  ==> client_prog \<squnion> G \<in>  
paulson@14061
   232
  {s \<in> state. s`rel = k & <k,h> \<in> strict_prefix(nat)  
paulson@14061
   233
   & <h, s`giv> \<in> prefix(nat) & h pfixGe s`ask}   
paulson@14061
   234
        LeadsTo {s \<in> state. <k, s`rel> \<in> strict_prefix(nat)  
paulson@14061
   235
                          & <s`rel, s`giv> \<in> prefix(nat) &  
paulson@14061
   236
                                  <h, s`giv> \<in> prefix(nat) &  
paulson@14061
   237
                h pfixGe s`ask}"
paulson@14061
   238
apply (rule single_LeadsTo_I)
paulson@14061
   239
 prefer 2 apply simp
paulson@14061
   240
apply (frule client_prog_Increasing_ask_rel [THEN guaranteesD])
paulson@14061
   241
apply (rotate_tac [3] 2)
paulson@14061
   242
apply (auto simp add: client_prog_ok_iff)
paulson@14061
   243
apply (rule transient_lemma [THEN Join_transient_I1, THEN transient_imp_leadsTo, THEN leadsTo_imp_LeadsTo, THEN PSP_Stable, THEN LeadsTo_weaken])
paulson@14061
   244
apply (rule Stable_Int [THEN Stable_Int, THEN Stable_Int])
paulson@14061
   245
apply (erule_tac f = "lift (giv) " and a = "s`giv" in Increasing_imp_Stable)
paulson@14061
   246
apply (simp (no_asm_simp))
paulson@14061
   247
apply (erule_tac f = "lift (ask) " and a = "s`ask" in Increasing_imp_Stable)
paulson@14061
   248
apply (simp (no_asm_simp))
paulson@14061
   249
apply (erule_tac f = "lift (rel) " and a = "s`rel" in Increasing_imp_Stable)
paulson@14061
   250
apply (simp (no_asm_simp))
paulson@14061
   251
apply (erule client_prog_Join_Stable_rel_le_giv, blast, simp_all)
paulson@14061
   252
 prefer 2
paulson@14061
   253
 apply (blast intro: sym strict_prefix_is_prefix [THEN iffD2] prefix_trans prefix_imp_pfixGe pfixGe_trans)
paulson@14061
   254
apply (auto intro: strict_prefix_is_prefix [THEN iffD1, THEN conjunct1] 
paulson@14061
   255
                   prefix_trans)
paulson@14061
   256
done
paulson@14061
   257
paulson@14061
   258
lemma rel_progress_lemma: 
paulson@14072
   259
"[| client_prog \<squnion> G  \<in> Incr(lift(giv)); client_prog ok G; G \<in> program |]  
paulson@14072
   260
  ==> client_prog \<squnion> G  \<in>  
paulson@14061
   261
     {s \<in> state. <s`rel, h> \<in> strict_prefix(nat)  
paulson@14061
   262
           & <h, s`giv> \<in> prefix(nat) & h pfixGe s`ask}   
paulson@14061
   263
                      LeadsTo {s \<in> state. <h, s`rel> \<in> prefix(nat)}"
paulson@14061
   264
apply (rule_tac f = "\<lambda>x \<in> state. length(h) #- length(x`rel)" 
paulson@14061
   265
       in LessThan_induct)
paulson@14061
   266
apply (auto simp add: vimage_def)
paulson@14061
   267
 prefer 2 apply (force simp add: lam_def) 
paulson@14061
   268
apply (rule single_LeadsTo_I)
paulson@14061
   269
 prefer 2 apply simp 
paulson@14061
   270
apply (subgoal_tac "h \<in> list(nat)")
paulson@14061
   271
 prefer 2 apply (blast dest: prefix_type [THEN subsetD]) 
paulson@14061
   272
apply (rule induct_lemma [THEN LeadsTo_weaken])
paulson@14061
   273
    apply (simp add: length_type lam_def)
paulson@14061
   274
apply (auto intro: strict_prefix_is_prefix [THEN iffD2]
paulson@14061
   275
            dest: common_prefix_linear  prefix_type [THEN subsetD])
paulson@14061
   276
apply (erule swap)
paulson@14061
   277
apply (rule imageI)
paulson@14061
   278
 apply (force dest!: simp add: lam_def) 
paulson@14061
   279
apply (simp add: length_type lam_def, clarify) 
paulson@14061
   280
apply (drule strict_prefix_length_lt)+
paulson@14061
   281
apply (drule less_imp_succ_add, simp)+
paulson@14061
   282
apply clarify 
paulson@14061
   283
apply simp 
paulson@14061
   284
apply (erule diff_le_self [THEN ltD])
paulson@14061
   285
done
paulson@14061
   286
paulson@14061
   287
lemma progress_lemma: 
paulson@14072
   288
"[| client_prog \<squnion> G \<in> Incr(lift(giv)); client_prog ok G; G \<in> program |] 
paulson@14072
   289
 ==> client_prog \<squnion> G
paulson@14072
   290
       \<in> {s \<in> state. <h, s`giv> \<in> prefix(nat) & h pfixGe s`ask}   
paulson@14072
   291
         LeadsTo  {s \<in> state. <h, s`rel> \<in> prefix(nat)}"
paulson@14072
   292
apply (rule client_prog_Join_Always_rel_le_giv [THEN Always_LeadsToI], 
paulson@14072
   293
       assumption)
paulson@14061
   294
apply (force simp add: client_prog_ok_iff)
paulson@14061
   295
apply (rule LeadsTo_weaken_L) 
paulson@14061
   296
apply (rule LeadsTo_Un [OF rel_progress_lemma 
paulson@14061
   297
                           subset_refl [THEN subset_imp_LeadsTo]])
paulson@14061
   298
apply (auto intro: strict_prefix_is_prefix [THEN iffD2]
paulson@14061
   299
            dest: common_prefix_linear prefix_type [THEN subsetD])
paulson@14061
   300
done
paulson@14061
   301
paulson@14061
   302
(*Progress property: all tokens that are given will be released*)
paulson@14061
   303
lemma client_prog_progress: 
paulson@14061
   304
"client_prog \<in> Incr(lift(giv))  guarantees   
paulson@14061
   305
      (\<Inter>h \<in> list(nat). {s \<in> state. <h, s`giv> \<in> prefix(nat) & 
paulson@14061
   306
              h pfixGe s`ask} LeadsTo {s \<in> state. <h, s`rel> \<in> prefix(nat)})"
paulson@14061
   307
apply (rule guaranteesI)
paulson@14061
   308
apply (blast intro: progress_lemma, auto)
paulson@14061
   309
done
paulson@14061
   310
paulson@14061
   311
lemma client_prog_Allowed:
paulson@14061
   312
     "Allowed(client_prog) =  
paulson@14061
   313
      preserves(lift(rel)) Int preserves(lift(ask)) Int preserves(lift(tok))"
paulson@14061
   314
apply (cut_tac v = "lift (ask)" in preserves_type)
paulson@14061
   315
apply (auto simp add: Allowed_def client_prog_def [THEN def_prg_Allowed] 
paulson@14061
   316
                      cons_Int_distrib safety_prop_Acts_iff)
paulson@14061
   317
done
paulson@14061
   318
paulson@14072
   319
end