src/HOL/UNITY/Comp/Alloc.thy
author wenzelm
Mon Sep 06 19:13:10 2010 +0200 (2010-09-06)
changeset 39159 0dec18004e75
parent 38012 3ca193a6ae5a
child 39198 f967a16dfcdd
permissions -rw-r--r--
more antiquotations;
wenzelm@37936
     1
(*  Title:      HOL/UNITY/Comp/Alloc.thy
paulson@11194
     2
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
paulson@11194
     3
    Copyright   1998  University of Cambridge
paulson@11194
     4
paulson@11194
     5
Specification of Chandy and Charpentier's Allocator
paulson@11194
     6
*)
paulson@11194
     7
wenzelm@17310
     8
theory Alloc
paulson@21710
     9
imports AllocBase "../PPROD"
wenzelm@17310
    10
begin
paulson@11194
    11
paulson@21710
    12
subsection{*State definitions.  OUTPUT variables are locals*}
paulson@11194
    13
paulson@11194
    14
record clientState =
paulson@21710
    15
  giv :: "nat list"   --{*client's INPUT history:  tokens GRANTED*}
paulson@21710
    16
  ask :: "nat list"   --{*client's OUTPUT history: tokens REQUESTED*}
paulson@21710
    17
  rel :: "nat list"   --{*client's OUTPUT history: tokens RELEASED*}
paulson@11194
    18
paulson@11194
    19
record 'a clientState_d =
paulson@11194
    20
  clientState +
paulson@21710
    21
  dummy :: 'a       --{*dummy field for new variables*}
paulson@11194
    22
wenzelm@36866
    23
definition
paulson@21710
    24
  --{*DUPLICATED FROM Client.thy, but with "tok" removed*}
paulson@21710
    25
  --{*Maybe want a special theory section to declare such maps*}
wenzelm@17310
    26
  non_dummy :: "'a clientState_d => clientState"
wenzelm@36866
    27
  where "non_dummy s = (|giv = giv s, ask = ask s, rel = rel s|)"
paulson@11194
    28
wenzelm@36866
    29
definition
paulson@21710
    30
  --{*Renaming map to put a Client into the standard form*}
paulson@11194
    31
  client_map :: "'a clientState_d => clientState*'a"
wenzelm@36866
    32
  where "client_map = funPair non_dummy dummy"
paulson@11194
    33
wenzelm@24147
    34
paulson@11194
    35
record allocState =
paulson@21710
    36
  allocGiv :: "nat => nat list"   --{*OUTPUT history: source of "giv" for i*}
paulson@21710
    37
  allocAsk :: "nat => nat list"   --{*INPUT: allocator's copy of "ask" for i*}
paulson@21710
    38
  allocRel :: "nat => nat list"   --{*INPUT: allocator's copy of "rel" for i*}
paulson@11194
    39
paulson@11194
    40
record 'a allocState_d =
paulson@11194
    41
  allocState +
paulson@21710
    42
  dummy    :: 'a                --{*dummy field for new variables*}
paulson@11194
    43
paulson@11194
    44
record 'a systemState =
paulson@11194
    45
  allocState +
paulson@21710
    46
  client :: "nat => clientState"  --{*states of all clients*}
paulson@21710
    47
  dummy  :: 'a                    --{*dummy field for new variables*}
paulson@11194
    48
paulson@11194
    49
paulson@21710
    50
--{** Resource allocation system specification **}
paulson@11194
    51
wenzelm@36866
    52
definition
paulson@21710
    53
  --{*spec (1)*}
wenzelm@17310
    54
  system_safety :: "'a systemState program set"
wenzelm@36866
    55
  where "system_safety =
nipkow@15074
    56
     Always {s. (SUM i: lessThan Nclients. (tokens o giv o sub i o client)s)
paulson@21710
    57
     \<le> NbT + (SUM i: lessThan Nclients. (tokens o rel o sub i o client)s)}"
paulson@11194
    58
wenzelm@36866
    59
definition
paulson@21710
    60
  --{*spec (2)*}
wenzelm@17310
    61
  system_progress :: "'a systemState program set"
wenzelm@36866
    62
  where "system_progress = (INT i : lessThan Nclients.
wenzelm@24147
    63
                        INT h.
wenzelm@24147
    64
                          {s. h \<le> (ask o sub i o client)s} LeadsTo
wenzelm@36866
    65
                          {s. h pfixLe (giv o sub i o client) s})"
paulson@11194
    66
wenzelm@36866
    67
definition
wenzelm@17310
    68
  system_spec :: "'a systemState program set"
wenzelm@36866
    69
  where "system_spec = system_safety Int system_progress"
paulson@11194
    70
paulson@21710
    71
--{** Client specification (required) ***}
paulson@11194
    72
wenzelm@36866
    73
definition
paulson@21710
    74
  --{*spec (3)*}
wenzelm@17310
    75
  client_increasing :: "'a clientState_d program set"
wenzelm@36866
    76
  where "client_increasing = UNIV guarantees  Increasing ask Int Increasing rel"
paulson@11194
    77
wenzelm@36866
    78
definition
paulson@21710
    79
  --{*spec (4)*}
wenzelm@17310
    80
  client_bounded :: "'a clientState_d program set"
wenzelm@36866
    81
  where "client_bounded = UNIV guarantees  Always {s. ALL elt : set (ask s). elt \<le> NbT}"
paulson@11194
    82
wenzelm@36866
    83
definition
paulson@21710
    84
  --{*spec (5)*}
wenzelm@17310
    85
  client_progress :: "'a clientState_d program set"
wenzelm@36866
    86
  where "client_progress =
wenzelm@24147
    87
         Increasing giv  guarantees
wenzelm@24147
    88
         (INT h. {s. h \<le> giv s & h pfixGe ask s}
wenzelm@24147
    89
                 LeadsTo {s. tokens h \<le> (tokens o rel) s})"
paulson@11194
    90
wenzelm@36866
    91
definition
paulson@21710
    92
  --{*spec: preserves part*}
wenzelm@17310
    93
  client_preserves :: "'a clientState_d program set"
wenzelm@36866
    94
  where "client_preserves = preserves giv Int preserves clientState_d.dummy"
paulson@11194
    95
wenzelm@36866
    96
definition
paulson@21710
    97
  --{*environmental constraints*}
wenzelm@17310
    98
  client_allowed_acts :: "'a clientState_d program set"
wenzelm@36866
    99
  where "client_allowed_acts =
paulson@11194
   100
       {F. AllowedActs F =
wenzelm@24147
   101
            insert Id (UNION (preserves (funPair rel ask)) Acts)}"
paulson@11194
   102
wenzelm@36866
   103
definition
wenzelm@17310
   104
  client_spec :: "'a clientState_d program set"
wenzelm@36866
   105
  where "client_spec = client_increasing Int client_bounded Int client_progress
paulson@11194
   106
                    Int client_allowed_acts Int client_preserves"
paulson@11194
   107
paulson@21710
   108
--{** Allocator specification (required) **}
paulson@11194
   109
wenzelm@36866
   110
definition
paulson@21710
   111
  --{*spec (6)*}
wenzelm@17310
   112
  alloc_increasing :: "'a allocState_d program set"
wenzelm@36866
   113
  where "alloc_increasing =
wenzelm@24147
   114
         UNIV  guarantees
wenzelm@24147
   115
         (INT i : lessThan Nclients. Increasing (sub i o allocGiv))"
paulson@11194
   116
wenzelm@36866
   117
definition
paulson@21710
   118
  --{*spec (7)*}
wenzelm@17310
   119
  alloc_safety :: "'a allocState_d program set"
wenzelm@36866
   120
  where "alloc_safety =
wenzelm@24147
   121
         (INT i : lessThan Nclients. Increasing (sub i o allocRel))
paulson@11194
   122
         guarantees
wenzelm@24147
   123
         Always {s. (SUM i: lessThan Nclients. (tokens o sub i o allocGiv)s)
paulson@21710
   124
         \<le> NbT + (SUM i: lessThan Nclients. (tokens o sub i o allocRel)s)}"
paulson@11194
   125
wenzelm@36866
   126
definition
paulson@21710
   127
  --{*spec (8)*}
wenzelm@17310
   128
  alloc_progress :: "'a allocState_d program set"
wenzelm@36866
   129
  where "alloc_progress =
wenzelm@24147
   130
         (INT i : lessThan Nclients. Increasing (sub i o allocAsk) Int
wenzelm@24147
   131
                                     Increasing (sub i o allocRel))
paulson@11194
   132
         Int
paulson@11194
   133
         Always {s. ALL i<Nclients.
wenzelm@24147
   134
                     ALL elt : set ((sub i o allocAsk) s). elt \<le> NbT}
paulson@11194
   135
         Int
wenzelm@24147
   136
         (INT i : lessThan Nclients.
wenzelm@24147
   137
          INT h. {s. h \<le> (sub i o allocGiv)s & h pfixGe (sub i o allocAsk)s}
wenzelm@24147
   138
                 LeadsTo
wenzelm@24147
   139
                 {s. tokens h \<le> (tokens o sub i o allocRel)s})
paulson@11194
   140
         guarantees
wenzelm@24147
   141
             (INT i : lessThan Nclients.
wenzelm@24147
   142
              INT h. {s. h \<le> (sub i o allocAsk) s}
wenzelm@24147
   143
                     LeadsTo
wenzelm@24147
   144
                     {s. h pfixLe (sub i o allocGiv) s})"
paulson@11194
   145
paulson@11194
   146
  (*NOTE: to follow the original paper, the formula above should have had
wenzelm@24147
   147
        INT h. {s. h i \<le> (sub i o allocGiv)s & h i pfixGe (sub i o allocAsk)s}
wenzelm@24147
   148
               LeadsTo
wenzelm@24147
   149
               {s. tokens h i \<le> (tokens o sub i o allocRel)s})
paulson@11194
   150
    thus h should have been a function variable.  However, only h i is ever
paulson@11194
   151
    looked at.*)
paulson@11194
   152
wenzelm@36866
   153
definition
paulson@21710
   154
  --{*spec: preserves part*}
wenzelm@17310
   155
  alloc_preserves :: "'a allocState_d program set"
wenzelm@36866
   156
  where "alloc_preserves = preserves allocRel Int preserves allocAsk Int
paulson@11194
   157
                        preserves allocState_d.dummy"
wenzelm@24147
   158
wenzelm@36866
   159
definition
paulson@21710
   160
  --{*environmental constraints*}
wenzelm@17310
   161
  alloc_allowed_acts :: "'a allocState_d program set"
wenzelm@36866
   162
  where "alloc_allowed_acts =
paulson@11194
   163
       {F. AllowedActs F =
wenzelm@24147
   164
            insert Id (UNION (preserves allocGiv) Acts)}"
paulson@11194
   165
wenzelm@36866
   166
definition
wenzelm@17310
   167
  alloc_spec :: "'a allocState_d program set"
wenzelm@36866
   168
  where "alloc_spec = alloc_increasing Int alloc_safety Int alloc_progress Int
paulson@11194
   169
                   alloc_allowed_acts Int alloc_preserves"
paulson@11194
   170
paulson@21710
   171
--{** Network specification **}
paulson@11194
   172
wenzelm@36866
   173
definition
paulson@21710
   174
  --{*spec (9.1)*}
wenzelm@17310
   175
  network_ask :: "'a systemState program set"
wenzelm@36866
   176
  where "network_ask = (INT i : lessThan Nclients.
wenzelm@24147
   177
                        Increasing (ask o sub i o client)  guarantees
wenzelm@36866
   178
                        ((sub i o allocAsk) Fols (ask o sub i o client)))"
paulson@11194
   179
wenzelm@36866
   180
definition
paulson@21710
   181
  --{*spec (9.2)*}
wenzelm@17310
   182
  network_giv :: "'a systemState program set"
wenzelm@36866
   183
  where "network_giv = (INT i : lessThan Nclients.
wenzelm@24147
   184
                        Increasing (sub i o allocGiv)
wenzelm@24147
   185
                        guarantees
wenzelm@36866
   186
                        ((giv o sub i o client) Fols (sub i o allocGiv)))"
paulson@11194
   187
wenzelm@36866
   188
definition
paulson@21710
   189
  --{*spec (9.3)*}
wenzelm@17310
   190
  network_rel :: "'a systemState program set"
wenzelm@36866
   191
  where "network_rel = (INT i : lessThan Nclients.
wenzelm@24147
   192
                        Increasing (rel o sub i o client)
wenzelm@24147
   193
                        guarantees
wenzelm@36866
   194
                        ((sub i o allocRel) Fols (rel o sub i o client)))"
paulson@11194
   195
wenzelm@36866
   196
definition
paulson@21710
   197
  --{*spec: preserves part*}
wenzelm@17310
   198
  network_preserves :: "'a systemState program set"
wenzelm@36866
   199
  where "network_preserves =
paulson@11194
   200
       preserves allocGiv  Int
paulson@11194
   201
       (INT i : lessThan Nclients. preserves (rel o sub i o client)  Int
paulson@11194
   202
                                   preserves (ask o sub i o client))"
wenzelm@24147
   203
wenzelm@36866
   204
definition
paulson@21710
   205
  --{*environmental constraints*}
wenzelm@17310
   206
  network_allowed_acts :: "'a systemState program set"
wenzelm@36866
   207
  where "network_allowed_acts =
paulson@11194
   208
       {F. AllowedActs F =
paulson@11194
   209
           insert Id
wenzelm@24147
   210
            (UNION (preserves allocRel Int
wenzelm@24147
   211
                    (INT i: lessThan Nclients. preserves(giv o sub i o client)))
wenzelm@24147
   212
                  Acts)}"
paulson@11194
   213
wenzelm@36866
   214
definition
wenzelm@17310
   215
  network_spec :: "'a systemState program set"
wenzelm@36866
   216
  where "network_spec = network_ask Int network_giv Int
paulson@11194
   217
                     network_rel Int network_allowed_acts Int
paulson@11194
   218
                     network_preserves"
paulson@11194
   219
paulson@11194
   220
paulson@21710
   221
--{** State mappings **}
wenzelm@36866
   222
definition
paulson@11194
   223
  sysOfAlloc :: "((nat => clientState) * 'a) allocState_d => 'a systemState"
wenzelm@36866
   224
  where "sysOfAlloc = (%s. let (cl,xtr) = allocState_d.dummy s
paulson@11194
   225
                       in (| allocGiv = allocGiv s,
wenzelm@24147
   226
                             allocAsk = allocAsk s,
wenzelm@24147
   227
                             allocRel = allocRel s,
wenzelm@24147
   228
                             client   = cl,
wenzelm@36866
   229
                             dummy    = xtr|))"
paulson@11194
   230
paulson@11194
   231
wenzelm@36866
   232
definition
paulson@11194
   233
  sysOfClient :: "(nat => clientState) * 'a allocState_d => 'a systemState"
wenzelm@36866
   234
  where "sysOfClient = (%(cl,al). (| allocGiv = allocGiv al,
wenzelm@24147
   235
                                 allocAsk = allocAsk al,
wenzelm@24147
   236
                                 allocRel = allocRel al,
wenzelm@24147
   237
                                 client   = cl,
wenzelm@36866
   238
                                 systemState.dummy = allocState_d.dummy al|))"
paulson@11194
   239
wenzelm@36866
   240
axiomatization Alloc :: "'a allocState_d program"
wenzelm@36866
   241
  where Alloc: "Alloc : alloc_spec"
wenzelm@24147
   242
wenzelm@36866
   243
axiomatization Client :: "'a clientState_d program"
wenzelm@36866
   244
  where Client: "Client : client_spec"
paulson@11194
   245
wenzelm@36866
   246
axiomatization Network :: "'a systemState program"
wenzelm@36866
   247
  where Network: "Network : network_spec"
wenzelm@36866
   248
wenzelm@36866
   249
definition System  :: "'a systemState program"
wenzelm@36866
   250
  where "System = rename sysOfAlloc Alloc Join Network Join
paulson@11194
   251
                 (rename sysOfClient
wenzelm@24147
   252
                  (plam x: lessThan Nclients. rename client_map Client))"
paulson@11194
   253
paulson@11194
   254
paulson@11194
   255
(**
paulson@11194
   256
locale System =
wenzelm@24147
   257
  fixes
paulson@11194
   258
    Alloc   :: 'a allocState_d program
paulson@11194
   259
    Client  :: 'a clientState_d program
paulson@11194
   260
    Network :: 'a systemState program
paulson@11194
   261
    System  :: 'a systemState program
paulson@11194
   262
paulson@11194
   263
  assumes
paulson@11194
   264
    Alloc   "Alloc   : alloc_spec"
paulson@11194
   265
    Client  "Client  : client_spec"
paulson@11194
   266
    Network "Network : network_spec"
paulson@11194
   267
paulson@11194
   268
  defines
paulson@11194
   269
    System_def
paulson@11194
   270
      "System == rename sysOfAlloc Alloc
paulson@11194
   271
                 Join
paulson@11194
   272
                 Network
paulson@11194
   273
                 Join
paulson@11194
   274
                 (rename sysOfClient
wenzelm@24147
   275
                  (plam x: lessThan Nclients. rename client_map Client))"
paulson@11194
   276
**)
paulson@11194
   277
wenzelm@21632
   278
(*Perhaps equalities.ML shouldn't add this in the first place!*)
wenzelm@21632
   279
declare image_Collect [simp del]
wenzelm@21632
   280
wenzelm@21632
   281
declare subset_preserves_o [THEN [2] rev_subsetD, intro]
wenzelm@21632
   282
declare subset_preserves_o [THEN [2] rev_subsetD, simp]
wenzelm@21632
   283
declare funPair_o_distrib [simp]
wenzelm@21632
   284
declare Always_INT_distrib [simp]
wenzelm@21632
   285
declare o_apply [simp del]
wenzelm@21632
   286
wenzelm@21632
   287
(*For rewriting of specifications related by "guarantees"*)
wenzelm@21632
   288
lemmas [simp] =
wenzelm@21632
   289
  rename_image_constrains
wenzelm@21632
   290
  rename_image_stable
wenzelm@21632
   291
  rename_image_increasing
wenzelm@21632
   292
  rename_image_invariant
wenzelm@21632
   293
  rename_image_Constrains
wenzelm@21632
   294
  rename_image_Stable
wenzelm@21632
   295
  rename_image_Increasing
wenzelm@21632
   296
  rename_image_Always
wenzelm@21632
   297
  rename_image_leadsTo
wenzelm@21632
   298
  rename_image_LeadsTo
wenzelm@21632
   299
  rename_preserves
wenzelm@21632
   300
  rename_image_preserves
wenzelm@21632
   301
  lift_image_preserves
wenzelm@21632
   302
  bij_image_INT
wenzelm@21632
   303
  bij_is_inj [THEN image_Int]
wenzelm@21632
   304
  bij_image_Collect_eq
wenzelm@21632
   305
wenzelm@21632
   306
ML {*
wenzelm@21632
   307
(*Splits up conjunctions & intersections: like CONJUNCTS in the HOL system*)
wenzelm@24147
   308
fun list_of_Int th =
wenzelm@21632
   309
    (list_of_Int (th RS conjunct1) @ list_of_Int (th RS conjunct2))
wenzelm@21632
   310
    handle THM _ => (list_of_Int (th RS IntD1) @ list_of_Int (th RS IntD2))
wenzelm@24147
   311
    handle THM _ => (list_of_Int (th RS @{thm INT_D}))
wenzelm@21632
   312
    handle THM _ => (list_of_Int (th RS bspec))
wenzelm@21632
   313
    handle THM _ => [th];
wenzelm@21632
   314
*}
wenzelm@21632
   315
wenzelm@21632
   316
lemmas lessThanBspec = lessThan_iff [THEN iffD2, THEN [2] bspec]
wenzelm@21632
   317
wenzelm@30528
   318
attribute_setup normalized = {*
wenzelm@24147
   319
let
wenzelm@24147
   320
  fun normalized th =
wenzelm@24147
   321
    normalized (th RS spec
wenzelm@24147
   322
      handle THM _ => th RS @{thm lessThanBspec}
wenzelm@24147
   323
      handle THM _ => th RS bspec
wenzelm@24147
   324
      handle THM _ => th RS (@{thm guarantees_INT_right_iff} RS iffD1))
wenzelm@24147
   325
    handle THM _ => th;
wenzelm@21632
   326
in
wenzelm@30528
   327
  Scan.succeed (Thm.rule_attribute (K normalized))
wenzelm@21632
   328
end
wenzelm@30528
   329
*} ""
wenzelm@21632
   330
wenzelm@21632
   331
(*** bijectivity of sysOfAlloc [MUST BE AUTOMATED] ***)
wenzelm@21632
   332
ML {*
wenzelm@24147
   333
fun record_auto_tac (cs, ss) =
haftmann@38012
   334
  auto_tac (cs addIs [ext] addSWrapper Record.split_wrapper,
wenzelm@24147
   335
    ss addsimps [@{thm sysOfAlloc_def}, @{thm sysOfClient_def},
wenzelm@24147
   336
      @{thm client_map_def}, @{thm non_dummy_def}, @{thm funPair_def},
wenzelm@24147
   337
      @{thm o_apply}, @{thm Let_def}])
wenzelm@21632
   338
*}
wenzelm@21632
   339
wenzelm@24147
   340
method_setup record_auto = {*
wenzelm@32149
   341
  Scan.succeed (fn ctxt => SIMPLE_METHOD (record_auto_tac (clasimpset_of ctxt)))
wenzelm@24147
   342
*} ""
wenzelm@21632
   343
wenzelm@21632
   344
lemma inj_sysOfAlloc [iff]: "inj sysOfAlloc"
wenzelm@21632
   345
  apply (unfold sysOfAlloc_def Let_def)
wenzelm@21632
   346
  apply (rule inj_onI)
wenzelm@24147
   347
  apply record_auto
wenzelm@21632
   348
  done
wenzelm@21632
   349
paulson@21710
   350
text{*We need the inverse; also having it simplifies the proof of surjectivity*}
wenzelm@24147
   351
lemma inv_sysOfAlloc_eq [simp]: "!!s. inv sysOfAlloc s =
wenzelm@24147
   352
             (| allocGiv = allocGiv s,
wenzelm@24147
   353
                allocAsk = allocAsk s,
wenzelm@24147
   354
                allocRel = allocRel s,
wenzelm@21632
   355
                allocState_d.dummy = (client s, dummy s) |)"
wenzelm@21632
   356
  apply (rule inj_sysOfAlloc [THEN inv_f_eq])
wenzelm@24147
   357
  apply record_auto
wenzelm@21632
   358
  done
wenzelm@21632
   359
wenzelm@21632
   360
lemma surj_sysOfAlloc [iff]: "surj sysOfAlloc"
wenzelm@21632
   361
  apply (simp add: surj_iff expand_fun_eq o_apply)
wenzelm@24147
   362
  apply record_auto
wenzelm@21632
   363
  done
wenzelm@21632
   364
wenzelm@21632
   365
lemma bij_sysOfAlloc [iff]: "bij sysOfAlloc"
wenzelm@21632
   366
  apply (blast intro: bijI)
wenzelm@21632
   367
  done
wenzelm@21632
   368
wenzelm@21632
   369
paulson@21710
   370
subsubsection{*bijectivity of @{term sysOfClient}*}
wenzelm@21632
   371
wenzelm@21632
   372
lemma inj_sysOfClient [iff]: "inj sysOfClient"
wenzelm@21632
   373
  apply (unfold sysOfClient_def)
wenzelm@21632
   374
  apply (rule inj_onI)
wenzelm@24147
   375
  apply record_auto
wenzelm@21632
   376
  done
wenzelm@21632
   377
wenzelm@24147
   378
lemma inv_sysOfClient_eq [simp]: "!!s. inv sysOfClient s =
wenzelm@24147
   379
             (client s,
wenzelm@24147
   380
              (| allocGiv = allocGiv s,
wenzelm@24147
   381
                 allocAsk = allocAsk s,
wenzelm@24147
   382
                 allocRel = allocRel s,
wenzelm@21632
   383
                 allocState_d.dummy = systemState.dummy s|) )"
wenzelm@21632
   384
  apply (rule inj_sysOfClient [THEN inv_f_eq])
wenzelm@24147
   385
  apply record_auto
wenzelm@21632
   386
  done
wenzelm@21632
   387
wenzelm@21632
   388
lemma surj_sysOfClient [iff]: "surj sysOfClient"
wenzelm@21632
   389
  apply (simp add: surj_iff expand_fun_eq o_apply)
wenzelm@24147
   390
  apply record_auto
wenzelm@21632
   391
  done
wenzelm@21632
   392
wenzelm@21632
   393
lemma bij_sysOfClient [iff]: "bij sysOfClient"
wenzelm@21632
   394
  apply (blast intro: bijI)
wenzelm@21632
   395
  done
wenzelm@21632
   396
wenzelm@21632
   397
paulson@21710
   398
subsubsection{*bijectivity of @{term client_map}*}
wenzelm@21632
   399
wenzelm@21632
   400
lemma inj_client_map [iff]: "inj client_map"
wenzelm@21632
   401
  apply (unfold inj_on_def)
wenzelm@24147
   402
  apply record_auto
wenzelm@21632
   403
  done
wenzelm@21632
   404
wenzelm@24147
   405
lemma inv_client_map_eq [simp]: "!!s. inv client_map s =
wenzelm@24147
   406
             (%(x,y).(|giv = giv x, ask = ask x, rel = rel x,
wenzelm@21632
   407
                       clientState_d.dummy = y|)) s"
wenzelm@21632
   408
  apply (rule inj_client_map [THEN inv_f_eq])
wenzelm@24147
   409
  apply record_auto
wenzelm@21632
   410
  done
wenzelm@21632
   411
wenzelm@21632
   412
lemma surj_client_map [iff]: "surj client_map"
wenzelm@21632
   413
  apply (simp add: surj_iff expand_fun_eq o_apply)
wenzelm@24147
   414
  apply record_auto
wenzelm@21632
   415
  done
wenzelm@21632
   416
wenzelm@21632
   417
lemma bij_client_map [iff]: "bij client_map"
wenzelm@21632
   418
  apply (blast intro: bijI)
wenzelm@21632
   419
  done
wenzelm@21632
   420
wenzelm@21632
   421
paulson@21710
   422
text{*o-simprules for @{term client_map}*}
wenzelm@21632
   423
wenzelm@21632
   424
lemma fst_o_client_map: "fst o client_map = non_dummy"
wenzelm@21632
   425
  apply (unfold client_map_def)
wenzelm@21632
   426
  apply (rule fst_o_funPair)
wenzelm@21632
   427
  done
wenzelm@21632
   428
wenzelm@39159
   429
ML {* bind_thms ("fst_o_client_map'", make_o_equivs @{thm fst_o_client_map}) *}
wenzelm@21632
   430
declare fst_o_client_map' [simp]
wenzelm@21632
   431
wenzelm@21632
   432
lemma snd_o_client_map: "snd o client_map = clientState_d.dummy"
wenzelm@21632
   433
  apply (unfold client_map_def)
wenzelm@21632
   434
  apply (rule snd_o_funPair)
wenzelm@21632
   435
  done
wenzelm@21632
   436
wenzelm@39159
   437
ML {* bind_thms ("snd_o_client_map'", make_o_equivs @{thm snd_o_client_map}) *}
wenzelm@21632
   438
declare snd_o_client_map' [simp]
wenzelm@21632
   439
paulson@21710
   440
paulson@21710
   441
subsection{*o-simprules for @{term sysOfAlloc} [MUST BE AUTOMATED]*}
wenzelm@21632
   442
wenzelm@21632
   443
lemma client_o_sysOfAlloc: "client o sysOfAlloc = fst o allocState_d.dummy "
wenzelm@24147
   444
  apply record_auto
wenzelm@21632
   445
  done
wenzelm@21632
   446
wenzelm@39159
   447
ML {* bind_thms ("client_o_sysOfAlloc'", make_o_equivs @{thm client_o_sysOfAlloc}) *}
wenzelm@21632
   448
declare client_o_sysOfAlloc' [simp]
wenzelm@21632
   449
wenzelm@21632
   450
lemma allocGiv_o_sysOfAlloc_eq: "allocGiv o sysOfAlloc = allocGiv"
wenzelm@24147
   451
  apply record_auto
wenzelm@21632
   452
  done
wenzelm@21632
   453
wenzelm@39159
   454
ML {* bind_thms ("allocGiv_o_sysOfAlloc_eq'", make_o_equivs @{thm allocGiv_o_sysOfAlloc_eq}) *}
wenzelm@21632
   455
declare allocGiv_o_sysOfAlloc_eq' [simp]
wenzelm@21632
   456
wenzelm@21632
   457
lemma allocAsk_o_sysOfAlloc_eq: "allocAsk o sysOfAlloc = allocAsk"
wenzelm@24147
   458
  apply record_auto
wenzelm@21632
   459
  done
wenzelm@21632
   460
wenzelm@39159
   461
ML {* bind_thms ("allocAsk_o_sysOfAlloc_eq'", make_o_equivs @{thm allocAsk_o_sysOfAlloc_eq}) *}
wenzelm@21632
   462
declare allocAsk_o_sysOfAlloc_eq' [simp]
wenzelm@21632
   463
wenzelm@21632
   464
lemma allocRel_o_sysOfAlloc_eq: "allocRel o sysOfAlloc = allocRel"
wenzelm@24147
   465
  apply record_auto
wenzelm@21632
   466
  done
wenzelm@21632
   467
wenzelm@39159
   468
ML {* bind_thms ("allocRel_o_sysOfAlloc_eq'", make_o_equivs @{thm allocRel_o_sysOfAlloc_eq}) *}
wenzelm@21632
   469
declare allocRel_o_sysOfAlloc_eq' [simp]
wenzelm@21632
   470
paulson@21710
   471
paulson@21710
   472
subsection{* o-simprules for @{term sysOfClient} [MUST BE AUTOMATED]*}
wenzelm@21632
   473
wenzelm@21632
   474
lemma client_o_sysOfClient: "client o sysOfClient = fst"
wenzelm@24147
   475
  apply record_auto
wenzelm@21632
   476
  done
wenzelm@21632
   477
wenzelm@39159
   478
ML {* bind_thms ("client_o_sysOfClient'", make_o_equivs @{thm client_o_sysOfClient}) *}
wenzelm@21632
   479
declare client_o_sysOfClient' [simp]
wenzelm@21632
   480
wenzelm@21632
   481
lemma allocGiv_o_sysOfClient_eq: "allocGiv o sysOfClient = allocGiv o snd "
wenzelm@24147
   482
  apply record_auto
wenzelm@21632
   483
  done
wenzelm@21632
   484
wenzelm@39159
   485
ML {* bind_thms ("allocGiv_o_sysOfClient_eq'", make_o_equivs @{thm allocGiv_o_sysOfClient_eq}) *}
wenzelm@21632
   486
declare allocGiv_o_sysOfClient_eq' [simp]
wenzelm@21632
   487
wenzelm@21632
   488
lemma allocAsk_o_sysOfClient_eq: "allocAsk o sysOfClient = allocAsk o snd "
wenzelm@24147
   489
  apply record_auto
wenzelm@21632
   490
  done
wenzelm@21632
   491
wenzelm@39159
   492
ML {* bind_thms ("allocAsk_o_sysOfClient_eq'", make_o_equivs @{thm allocAsk_o_sysOfClient_eq}) *}
wenzelm@21632
   493
declare allocAsk_o_sysOfClient_eq' [simp]
wenzelm@21632
   494
wenzelm@21632
   495
lemma allocRel_o_sysOfClient_eq: "allocRel o sysOfClient = allocRel o snd "
wenzelm@24147
   496
  apply record_auto
wenzelm@21632
   497
  done
wenzelm@21632
   498
wenzelm@39159
   499
ML {* bind_thms ("allocRel_o_sysOfClient_eq'", make_o_equivs @{thm allocRel_o_sysOfClient_eq}) *}
wenzelm@21632
   500
declare allocRel_o_sysOfClient_eq' [simp]
wenzelm@21632
   501
wenzelm@21632
   502
lemma allocGiv_o_inv_sysOfAlloc_eq: "allocGiv o inv sysOfAlloc = allocGiv"
wenzelm@21632
   503
  apply (simp add: o_def)
wenzelm@21632
   504
  done
wenzelm@21632
   505
wenzelm@39159
   506
ML {* bind_thms ("allocGiv_o_inv_sysOfAlloc_eq'", make_o_equivs @{thm allocGiv_o_inv_sysOfAlloc_eq}) *}
wenzelm@21632
   507
declare allocGiv_o_inv_sysOfAlloc_eq' [simp]
wenzelm@21632
   508
wenzelm@21632
   509
lemma allocAsk_o_inv_sysOfAlloc_eq: "allocAsk o inv sysOfAlloc = allocAsk"
wenzelm@21632
   510
  apply (simp add: o_def)
wenzelm@21632
   511
  done
wenzelm@21632
   512
wenzelm@39159
   513
ML {* bind_thms ("allocAsk_o_inv_sysOfAlloc_eq'", make_o_equivs @{thm allocAsk_o_inv_sysOfAlloc_eq}) *}
wenzelm@21632
   514
declare allocAsk_o_inv_sysOfAlloc_eq' [simp]
wenzelm@21632
   515
wenzelm@21632
   516
lemma allocRel_o_inv_sysOfAlloc_eq: "allocRel o inv sysOfAlloc = allocRel"
wenzelm@21632
   517
  apply (simp add: o_def)
wenzelm@21632
   518
  done
wenzelm@21632
   519
wenzelm@39159
   520
ML {* bind_thms ("allocRel_o_inv_sysOfAlloc_eq'", make_o_equivs @{thm allocRel_o_inv_sysOfAlloc_eq}) *}
wenzelm@21632
   521
declare allocRel_o_inv_sysOfAlloc_eq' [simp]
wenzelm@21632
   522
wenzelm@24147
   523
lemma rel_inv_client_map_drop_map: "(rel o inv client_map o drop_map i o inv sysOfClient) =
wenzelm@21632
   524
      rel o sub i o client"
wenzelm@21632
   525
  apply (simp add: o_def drop_map_def)
wenzelm@21632
   526
  done
wenzelm@21632
   527
wenzelm@39159
   528
ML {* bind_thms ("rel_inv_client_map_drop_map'", make_o_equivs @{thm rel_inv_client_map_drop_map}) *}
wenzelm@21632
   529
declare rel_inv_client_map_drop_map [simp]
wenzelm@21632
   530
wenzelm@24147
   531
lemma ask_inv_client_map_drop_map: "(ask o inv client_map o drop_map i o inv sysOfClient) =
wenzelm@21632
   532
      ask o sub i o client"
wenzelm@21632
   533
  apply (simp add: o_def drop_map_def)
wenzelm@21632
   534
  done
wenzelm@21632
   535
wenzelm@39159
   536
ML {* bind_thms ("ask_inv_client_map_drop_map'", make_o_equivs @{thm ask_inv_client_map_drop_map}) *}
wenzelm@21632
   537
declare ask_inv_client_map_drop_map [simp]
wenzelm@21632
   538
wenzelm@21632
   539
wenzelm@21632
   540
declare finite_lessThan [iff]
wenzelm@21632
   541
paulson@21710
   542
text{*Client : <unfolded specification> *}
wenzelm@21632
   543
lemmas client_spec_simps =
wenzelm@21632
   544
  client_spec_def client_increasing_def client_bounded_def
wenzelm@21632
   545
  client_progress_def client_allowed_acts_def client_preserves_def
wenzelm@21632
   546
  guarantees_Int_right
wenzelm@21632
   547
wenzelm@21632
   548
ML {*
wenzelm@21632
   549
val [Client_Increasing_ask, Client_Increasing_rel,
wenzelm@24147
   550
     Client_Bounded, Client_Progress, Client_AllowedActs,
wenzelm@21632
   551
     Client_preserves_giv, Client_preserves_dummy] =
wenzelm@24147
   552
        @{thm Client} |> simplify (@{simpset} addsimps @{thms client_spec_simps})
wenzelm@21632
   553
               |> list_of_Int;
wenzelm@21632
   554
wenzelm@21632
   555
bind_thm ("Client_Increasing_ask", Client_Increasing_ask);
wenzelm@21632
   556
bind_thm ("Client_Increasing_rel", Client_Increasing_rel);
wenzelm@21632
   557
bind_thm ("Client_Bounded", Client_Bounded);
wenzelm@21632
   558
bind_thm ("Client_Progress", Client_Progress);
wenzelm@21632
   559
bind_thm ("Client_AllowedActs", Client_AllowedActs);
wenzelm@21632
   560
bind_thm ("Client_preserves_giv", Client_preserves_giv);
wenzelm@21632
   561
bind_thm ("Client_preserves_dummy", Client_preserves_dummy);
wenzelm@21632
   562
*}
wenzelm@21632
   563
wenzelm@21632
   564
declare
wenzelm@21632
   565
  Client_Increasing_ask [iff]
wenzelm@21632
   566
  Client_Increasing_rel [iff]
wenzelm@21632
   567
  Client_Bounded [iff]
wenzelm@21632
   568
  Client_preserves_giv [iff]
wenzelm@21632
   569
  Client_preserves_dummy [iff]
wenzelm@21632
   570
wenzelm@21632
   571
paulson@21710
   572
text{*Network : <unfolded specification> *}
wenzelm@21632
   573
lemmas network_spec_simps =
wenzelm@21632
   574
  network_spec_def network_ask_def network_giv_def
wenzelm@21632
   575
  network_rel_def network_allowed_acts_def network_preserves_def
wenzelm@21632
   576
  ball_conj_distrib
wenzelm@21632
   577
wenzelm@21632
   578
ML {*
wenzelm@21632
   579
val [Network_Ask, Network_Giv, Network_Rel, Network_AllowedActs,
wenzelm@24147
   580
     Network_preserves_allocGiv, Network_preserves_rel,
wenzelm@24147
   581
     Network_preserves_ask]  =
wenzelm@24147
   582
        @{thm Network} |> simplify (@{simpset} addsimps @{thms network_spec_simps})
wenzelm@21632
   583
                |> list_of_Int;
wenzelm@21632
   584
wenzelm@21632
   585
bind_thm ("Network_Ask", Network_Ask);
wenzelm@21632
   586
bind_thm ("Network_Giv", Network_Giv);
wenzelm@21632
   587
bind_thm ("Network_Rel", Network_Rel);
wenzelm@21632
   588
bind_thm ("Network_AllowedActs", Network_AllowedActs);
wenzelm@21632
   589
bind_thm ("Network_preserves_allocGiv", Network_preserves_allocGiv);
wenzelm@21632
   590
bind_thm ("Network_preserves_rel", Network_preserves_rel);
wenzelm@21632
   591
bind_thm ("Network_preserves_ask", Network_preserves_ask);
wenzelm@21632
   592
*}
wenzelm@21632
   593
wenzelm@21632
   594
declare Network_preserves_allocGiv [iff]
wenzelm@21632
   595
wenzelm@21632
   596
declare
wenzelm@21632
   597
  Network_preserves_rel [simp]
wenzelm@21632
   598
  Network_preserves_ask [simp]
wenzelm@21632
   599
wenzelm@21632
   600
declare
wenzelm@21632
   601
  Network_preserves_rel [simplified o_def, simp]
wenzelm@21632
   602
  Network_preserves_ask [simplified o_def, simp]
wenzelm@21632
   603
paulson@21710
   604
text{*Alloc : <unfolded specification> *}
wenzelm@21632
   605
lemmas alloc_spec_simps =
wenzelm@21632
   606
  alloc_spec_def alloc_increasing_def alloc_safety_def
wenzelm@21632
   607
  alloc_progress_def alloc_allowed_acts_def alloc_preserves_def
wenzelm@21632
   608
wenzelm@21632
   609
ML {*
wenzelm@21632
   610
val [Alloc_Increasing_0, Alloc_Safety, Alloc_Progress, Alloc_AllowedActs,
wenzelm@24147
   611
     Alloc_preserves_allocRel, Alloc_preserves_allocAsk,
wenzelm@24147
   612
     Alloc_preserves_dummy] =
wenzelm@24147
   613
        @{thm Alloc} |> simplify (@{simpset} addsimps @{thms alloc_spec_simps})
wenzelm@21632
   614
              |> list_of_Int;
wenzelm@21632
   615
wenzelm@21632
   616
bind_thm ("Alloc_Increasing_0", Alloc_Increasing_0);
wenzelm@21632
   617
bind_thm ("Alloc_Safety", Alloc_Safety);
wenzelm@21632
   618
bind_thm ("Alloc_Progress", Alloc_Progress);
wenzelm@21632
   619
bind_thm ("Alloc_AllowedActs", Alloc_AllowedActs);
wenzelm@21632
   620
bind_thm ("Alloc_preserves_allocRel", Alloc_preserves_allocRel);
wenzelm@21632
   621
bind_thm ("Alloc_preserves_allocAsk", Alloc_preserves_allocAsk);
wenzelm@21632
   622
bind_thm ("Alloc_preserves_dummy", Alloc_preserves_dummy);
wenzelm@21632
   623
*}
wenzelm@21632
   624
paulson@21710
   625
text{*Strip off the INT in the guarantees postcondition*}
wenzelm@24147
   626
wenzelm@24147
   627
lemmas Alloc_Increasing = Alloc_Increasing_0 [normalized]
wenzelm@21632
   628
wenzelm@21632
   629
declare
wenzelm@21632
   630
  Alloc_preserves_allocRel [iff]
wenzelm@21632
   631
  Alloc_preserves_allocAsk [iff]
wenzelm@21632
   632
  Alloc_preserves_dummy [iff]
wenzelm@21632
   633
wenzelm@21632
   634
paulson@21710
   635
subsection{*Components Lemmas [MUST BE AUTOMATED]*}
wenzelm@21632
   636
wenzelm@24147
   637
lemma Network_component_System: "Network Join
wenzelm@24147
   638
      ((rename sysOfClient
wenzelm@24147
   639
        (plam x: (lessThan Nclients). rename client_map Client)) Join
wenzelm@24147
   640
       rename sysOfAlloc Alloc)
wenzelm@21632
   641
      = System"
paulson@21710
   642
  by (simp add: System_def Join_ac)
wenzelm@21632
   643
wenzelm@24147
   644
lemma Client_component_System: "(rename sysOfClient
wenzelm@24147
   645
       (plam x: (lessThan Nclients). rename client_map Client)) Join
wenzelm@21632
   646
      (Network Join rename sysOfAlloc Alloc)  =  System"
paulson@21710
   647
  by (simp add: System_def Join_ac)
wenzelm@21632
   648
wenzelm@24147
   649
lemma Alloc_component_System: "rename sysOfAlloc Alloc Join
wenzelm@24147
   650
       ((rename sysOfClient (plam x: (lessThan Nclients). rename client_map Client)) Join
wenzelm@21632
   651
        Network)  =  System"
paulson@21710
   652
  by (simp add: System_def Join_ac)
wenzelm@21632
   653
wenzelm@21632
   654
declare
wenzelm@21632
   655
  Client_component_System [iff]
wenzelm@21632
   656
  Network_component_System [iff]
wenzelm@21632
   657
  Alloc_component_System [iff]
wenzelm@21632
   658
paulson@21710
   659
paulson@21710
   660
text{** These preservation laws should be generated automatically **}
wenzelm@21632
   661
wenzelm@21632
   662
lemma Client_Allowed [simp]: "Allowed Client = preserves rel Int preserves ask"
paulson@21710
   663
  by (auto simp add: Allowed_def Client_AllowedActs safety_prop_Acts_iff)
wenzelm@21632
   664
wenzelm@24147
   665
lemma Network_Allowed [simp]: "Allowed Network =
wenzelm@24147
   666
        preserves allocRel Int
wenzelm@21632
   667
        (INT i: lessThan Nclients. preserves(giv o sub i o client))"
paulson@21710
   668
  by (auto simp add: Allowed_def Network_AllowedActs safety_prop_Acts_iff)
wenzelm@21632
   669
wenzelm@21632
   670
lemma Alloc_Allowed [simp]: "Allowed Alloc = preserves allocGiv"
paulson@21710
   671
  by (auto simp add: Allowed_def Alloc_AllowedActs safety_prop_Acts_iff)
wenzelm@21632
   672
paulson@21710
   673
text{*needed in @{text rename_client_map_tac}*}
wenzelm@21632
   674
lemma OK_lift_rename_Client [simp]: "OK I (%i. lift i (rename client_map Client))"
wenzelm@21632
   675
  apply (rule OK_lift_I)
wenzelm@21632
   676
  apply auto
wenzelm@21632
   677
  apply (drule_tac w1 = rel in subset_preserves_o [THEN [2] rev_subsetD])
wenzelm@21632
   678
  apply (drule_tac [2] w1 = ask in subset_preserves_o [THEN [2] rev_subsetD])
wenzelm@21632
   679
  apply (auto simp add: o_def split_def)
wenzelm@21632
   680
  done
wenzelm@21632
   681
paulson@21710
   682
lemma fst_lift_map_eq_fst [simp]: "fst (lift_map i x) i = fst x"
paulson@21710
   683
apply (insert fst_o_lift_map [of i])
wenzelm@24147
   684
apply (drule fun_cong [where x=x])
paulson@21710
   685
apply (simp add: o_def);
paulson@21710
   686
done
paulson@21710
   687
paulson@21710
   688
lemma fst_o_lift_map' [simp]:
paulson@21710
   689
     "(f \<circ> sub i \<circ> fst \<circ> lift_map i \<circ> g) = f o fst o g"
wenzelm@24147
   690
apply (subst fst_o_lift_map [symmetric])
wenzelm@24147
   691
apply (simp only: o_assoc)
paulson@21710
   692
done
paulson@21710
   693
wenzelm@21632
   694
wenzelm@21632
   695
(*The proofs of rename_Client_Increasing, rename_Client_Bounded and
wenzelm@21632
   696
  rename_Client_Progress are similar.  All require copying out the original
wenzelm@21632
   697
  Client property.  A forward proof can be constructed as follows:
wenzelm@21632
   698
wenzelm@21632
   699
  Client_Increasing_ask RS
wenzelm@21632
   700
      (bij_client_map RS rename_rename_guarantees_eq RS iffD2)
wenzelm@21632
   701
  RS (lift_lift_guarantees_eq RS iffD2)
wenzelm@21632
   702
  RS guarantees_PLam_I
wenzelm@21632
   703
  RS (bij_sysOfClient RS rename_rename_guarantees_eq RS iffD2)
wenzelm@24147
   704
  |> simplify (simpset() addsimps [lift_image_eq_rename, o_def, split_def,
wenzelm@24147
   705
                                   surj_rename RS surj_range])
wenzelm@21632
   706
wenzelm@21632
   707
However, the "preserves" property remains to be discharged, and the unfolding
wenzelm@21632
   708
of "o" and "sub" complicates subsequent reasoning.
wenzelm@21632
   709
wenzelm@21632
   710
The following tactic works for all three proofs, though it certainly looks
wenzelm@21632
   711
ad-hoc!
wenzelm@21632
   712
*)
wenzelm@21632
   713
ML
wenzelm@21632
   714
{*
wenzelm@24147
   715
fun rename_client_map_tac ss =
wenzelm@21632
   716
  EVERY [
wenzelm@25995
   717
    simp_tac (ss addsimps [@{thm rename_guarantees_eq_rename_inv}]) 1,
wenzelm@24147
   718
    rtac @{thm guarantees_PLam_I} 1,
wenzelm@21632
   719
    assume_tac 2,
wenzelm@24147
   720
         (*preserves: routine reasoning*)
wenzelm@24147
   721
    asm_simp_tac (ss addsimps [@{thm lift_preserves_sub}]) 2,
wenzelm@24147
   722
         (*the guarantee for  "lift i (rename client_map Client)" *)
wenzelm@21632
   723
    asm_simp_tac
wenzelm@24147
   724
        (ss addsimps [@{thm lift_guarantees_eq_lift_inv},
wenzelm@24147
   725
                      @{thm rename_guarantees_eq_rename_inv},
wenzelm@24147
   726
                      @{thm bij_imp_bij_inv}, @{thm surj_rename} RS @{thm surj_range},
wenzelm@24147
   727
                      @{thm inv_inv_eq}]) 1,
wenzelm@21632
   728
    asm_simp_tac
wenzelm@24147
   729
        (@{simpset} addsimps [@{thm o_def}, @{thm non_dummy_def}, @{thm guarantees_Int_right}]) 1]
wenzelm@21632
   730
*}
wenzelm@21632
   731
wenzelm@24147
   732
method_setup rename_client_map = {*
wenzelm@30549
   733
  Scan.succeed (fn ctxt =>
wenzelm@32149
   734
    SIMPLE_METHOD (rename_client_map_tac (simpset_of ctxt)))
wenzelm@24147
   735
*} ""
wenzelm@24147
   736
paulson@21710
   737
text{*Lifting @{text Client_Increasing} to @{term systemState}*}
wenzelm@24147
   738
lemma rename_Client_Increasing: "i : I
wenzelm@24147
   739
      ==> rename sysOfClient (plam x: I. rename client_map Client) :
wenzelm@24147
   740
            UNIV  guarantees
wenzelm@24147
   741
            Increasing (ask o sub i o client) Int
wenzelm@21632
   742
            Increasing (rel o sub i o client)"
wenzelm@24147
   743
  by rename_client_map
wenzelm@21632
   744
wenzelm@24147
   745
lemma preserves_sub_fst_lift_map: "[| F : preserves w; i ~= j |]
wenzelm@21632
   746
      ==> F : preserves (sub i o fst o lift_map j o funPair v w)"
wenzelm@21632
   747
  apply (auto simp add: lift_map_def split_def linorder_neq_iff o_def)
wenzelm@21632
   748
  apply (drule_tac [!] subset_preserves_o [THEN [2] rev_subsetD])
wenzelm@21632
   749
  apply (auto simp add: o_def)
wenzelm@21632
   750
  done
wenzelm@21632
   751
wenzelm@24147
   752
lemma client_preserves_giv_oo_client_map: "[| i < Nclients; j < Nclients |]
wenzelm@21632
   753
      ==> Client : preserves (giv o sub i o fst o lift_map j o client_map)"
wenzelm@24147
   754
  apply (case_tac "i=j")
paulson@21710
   755
  apply (simp, simp add: o_def non_dummy_def)
wenzelm@21632
   756
  apply (drule Client_preserves_dummy [THEN preserves_sub_fst_lift_map])
wenzelm@21632
   757
  apply (drule_tac [!] subset_preserves_o [THEN [2] rev_subsetD])
wenzelm@21632
   758
  apply (simp add: o_def client_map_def)
wenzelm@21632
   759
  done
wenzelm@21632
   760
wenzelm@21632
   761
lemma rename_sysOfClient_ok_Network:
wenzelm@24147
   762
  "rename sysOfClient (plam x: lessThan Nclients. rename client_map Client)
wenzelm@21632
   763
    ok Network"
paulson@21710
   764
  by (auto simp add: ok_iff_Allowed client_preserves_giv_oo_client_map)
wenzelm@21632
   765
wenzelm@21632
   766
lemma rename_sysOfClient_ok_Alloc:
wenzelm@24147
   767
  "rename sysOfClient (plam x: lessThan Nclients. rename client_map Client)
wenzelm@21632
   768
    ok rename sysOfAlloc Alloc"
paulson@21710
   769
  by (simp add: ok_iff_Allowed)
wenzelm@21632
   770
wenzelm@21632
   771
lemma rename_sysOfAlloc_ok_Network: "rename sysOfAlloc Alloc ok Network"
paulson@21710
   772
  by (simp add: ok_iff_Allowed)
wenzelm@21632
   773
wenzelm@21632
   774
declare
wenzelm@21632
   775
  rename_sysOfClient_ok_Network [iff]
wenzelm@21632
   776
  rename_sysOfClient_ok_Alloc [iff]
wenzelm@21632
   777
  rename_sysOfAlloc_ok_Network [iff]
wenzelm@21632
   778
wenzelm@24147
   779
text{*The "ok" laws, re-oriented.
paulson@21710
   780
  But not sure this works: theorem @{text ok_commute} is needed below*}
wenzelm@21632
   781
declare
wenzelm@21632
   782
  rename_sysOfClient_ok_Network [THEN ok_sym, iff]
wenzelm@21632
   783
  rename_sysOfClient_ok_Alloc [THEN ok_sym, iff]
wenzelm@21632
   784
  rename_sysOfAlloc_ok_Network [THEN ok_sym]
wenzelm@21632
   785
wenzelm@21632
   786
lemma System_Increasing: "i < Nclients
wenzelm@24147
   787
      ==> System : Increasing (ask o sub i o client) Int
wenzelm@21632
   788
                   Increasing (rel o sub i o client)"
wenzelm@21632
   789
  apply (rule component_guaranteesD [OF rename_Client_Increasing Client_component_System])
wenzelm@21632
   790
  apply auto
wenzelm@21632
   791
  done
wenzelm@21632
   792
wenzelm@21632
   793
lemmas rename_guarantees_sysOfAlloc_I =
wenzelm@21632
   794
  bij_sysOfAlloc [THEN rename_rename_guarantees_eq, THEN iffD2, standard]
wenzelm@21632
   795
wenzelm@21632
   796
wenzelm@21632
   797
(*Lifting Alloc_Increasing up to the level of systemState*)
paulson@21710
   798
lemmas rename_Alloc_Increasing =
paulson@21710
   799
  Alloc_Increasing
wenzelm@24147
   800
    [THEN rename_guarantees_sysOfAlloc_I,
wenzelm@24147
   801
     simplified surj_rename [THEN surj_range] o_def sub_apply
wenzelm@24147
   802
                rename_image_Increasing bij_sysOfAlloc
paulson@21710
   803
                allocGiv_o_inv_sysOfAlloc_eq'];
wenzelm@21632
   804
wenzelm@24147
   805
lemma System_Increasing_allocGiv:
wenzelm@21632
   806
     "i < Nclients ==> System : Increasing (sub i o allocGiv)"
wenzelm@21632
   807
  apply (unfold System_def)
wenzelm@21632
   808
  apply (simp add: o_def)
wenzelm@21632
   809
  apply (rule rename_Alloc_Increasing [THEN guarantees_Join_I1, THEN guaranteesD])
wenzelm@21632
   810
  apply auto
wenzelm@21632
   811
  done
paulson@21710
   812
wenzelm@21632
   813
wenzelm@21632
   814
ML {*
wenzelm@39159
   815
bind_thms ("System_Increasing'", list_of_Int @{thm System_Increasing})
wenzelm@21632
   816
*}
wenzelm@21632
   817
wenzelm@21632
   818
declare System_Increasing' [intro!]
wenzelm@21632
   819
paulson@21710
   820
text{* Follows consequences.
wenzelm@21632
   821
    The "Always (INT ...) formulation expresses the general safety property
paulson@21710
   822
    and allows it to be combined using @{text Always_Int_rule} below. *}
wenzelm@21632
   823
wenzelm@24147
   824
lemma System_Follows_rel:
wenzelm@21632
   825
  "i < Nclients ==> System : ((sub i o allocRel) Fols (rel o sub i o client))"
wenzelm@21632
   826
  apply (auto intro!: Network_Rel [THEN component_guaranteesD])
wenzelm@24147
   827
  apply (simp add: ok_commute [of Network])
paulson@21710
   828
  done
wenzelm@21632
   829
wenzelm@24147
   830
lemma System_Follows_ask:
wenzelm@21632
   831
  "i < Nclients ==> System : ((sub i o allocAsk) Fols (ask o sub i o client))"
paulson@21710
   832
  apply (auto intro!: Network_Ask [THEN component_guaranteesD])
wenzelm@24147
   833
  apply (simp add: ok_commute [of Network])
wenzelm@21632
   834
  done
wenzelm@21632
   835
wenzelm@24147
   836
lemma System_Follows_allocGiv:
wenzelm@21632
   837
  "i < Nclients ==> System : (giv o sub i o client) Fols (sub i o allocGiv)"
wenzelm@21632
   838
  apply (auto intro!: Network_Giv [THEN component_guaranteesD]
wenzelm@21632
   839
    rename_Alloc_Increasing [THEN component_guaranteesD])
paulson@21710
   840
  apply (simp_all add: o_def non_dummy_def ok_commute [of Network])
wenzelm@21632
   841
  apply (auto intro!: rename_Alloc_Increasing [THEN component_guaranteesD])
wenzelm@21632
   842
  done
paulson@21710
   843
wenzelm@21632
   844
wenzelm@24147
   845
lemma Always_giv_le_allocGiv: "System : Always (INT i: lessThan Nclients.
paulson@21710
   846
                       {s. (giv o sub i o client) s \<le> (sub i o allocGiv) s})"
wenzelm@21632
   847
  apply auto
wenzelm@21632
   848
  apply (erule System_Follows_allocGiv [THEN Follows_Bounded])
wenzelm@21632
   849
  done
paulson@21710
   850
wenzelm@21632
   851
wenzelm@24147
   852
lemma Always_allocAsk_le_ask: "System : Always (INT i: lessThan Nclients.
paulson@21710
   853
                       {s. (sub i o allocAsk) s \<le> (ask o sub i o client) s})"
wenzelm@21632
   854
  apply auto
wenzelm@21632
   855
  apply (erule System_Follows_ask [THEN Follows_Bounded])
wenzelm@21632
   856
  done
paulson@21710
   857
wenzelm@21632
   858
wenzelm@24147
   859
lemma Always_allocRel_le_rel: "System : Always (INT i: lessThan Nclients.
paulson@21710
   860
                       {s. (sub i o allocRel) s \<le> (rel o sub i o client) s})"
paulson@21710
   861
  by (auto intro!: Follows_Bounded System_Follows_rel)
paulson@21710
   862
wenzelm@21632
   863
paulson@21710
   864
subsection{*Proof of the safety property (1)*}
wenzelm@21632
   865
paulson@21710
   866
text{*safety (1), step 1 is @{text System_Follows_rel}*}
wenzelm@21632
   867
paulson@21710
   868
text{*safety (1), step 2*}
wenzelm@21632
   869
(* i < Nclients ==> System : Increasing (sub i o allocRel) *)
wenzelm@21632
   870
lemmas System_Increasing_allocRel = System_Follows_rel [THEN Follows_Increasing1, standard]
wenzelm@21632
   871
wenzelm@21632
   872
(*Lifting Alloc_safety up to the level of systemState.
paulson@21710
   873
  Simplifying with o_def gets rid of the translations but it unfortunately
wenzelm@21632
   874
  gets rid of the other "o"s too.*)
wenzelm@21632
   875
paulson@21710
   876
text{*safety (1), step 3*}
wenzelm@24147
   877
lemma System_sum_bounded:
paulson@21710
   878
    "System : Always {s. (\<Sum>i \<in> lessThan Nclients. (tokens o sub i o allocGiv) s)
paulson@21710
   879
            \<le> NbT + (\<Sum>i \<in> lessThan Nclients. (tokens o sub i o allocRel) s)}"
wenzelm@21632
   880
  apply (simp add: o_apply)
wenzelm@24147
   881
  apply (insert Alloc_Safety [THEN rename_guarantees_sysOfAlloc_I])
wenzelm@24147
   882
  apply (simp add: o_def);
wenzelm@24147
   883
  apply (erule component_guaranteesD)
paulson@21710
   884
  apply (auto simp add: System_Increasing_allocRel [simplified sub_apply o_def])
wenzelm@21632
   885
  done
wenzelm@21632
   886
paulson@21710
   887
text{* Follows reasoning*}
wenzelm@21632
   888
wenzelm@24147
   889
lemma Always_tokens_giv_le_allocGiv: "System : Always (INT i: lessThan Nclients.
wenzelm@24147
   890
                          {s. (tokens o giv o sub i o client) s
paulson@21710
   891
                           \<le> (tokens o sub i o allocGiv) s})"
wenzelm@21632
   892
  apply (rule Always_giv_le_allocGiv [THEN Always_weaken])
wenzelm@21632
   893
  apply (auto intro: tokens_mono_prefix simp add: o_apply)
wenzelm@21632
   894
  done
wenzelm@21632
   895
wenzelm@24147
   896
lemma Always_tokens_allocRel_le_rel: "System : Always (INT i: lessThan Nclients.
wenzelm@24147
   897
                          {s. (tokens o sub i o allocRel) s
paulson@21710
   898
                           \<le> (tokens o rel o sub i o client) s})"
wenzelm@21632
   899
  apply (rule Always_allocRel_le_rel [THEN Always_weaken])
wenzelm@21632
   900
  apply (auto intro: tokens_mono_prefix simp add: o_apply)
wenzelm@21632
   901
  done
wenzelm@21632
   902
paulson@21710
   903
text{*safety (1), step 4 (final result!) *}
paulson@21710
   904
theorem System_safety: "System : system_safety"
wenzelm@21632
   905
  apply (unfold system_safety_def)
wenzelm@39159
   906
  apply (tactic {* rtac (Always_Int_rule [@{thm System_sum_bounded},
wenzelm@39159
   907
    @{thm Always_tokens_giv_le_allocGiv}, @{thm Always_tokens_allocRel_le_rel}] RS
wenzelm@39159
   908
    @{thm Always_weaken}) 1 *})
wenzelm@21632
   909
  apply auto
wenzelm@21632
   910
  apply (rule setsum_fun_mono [THEN order_trans])
wenzelm@21632
   911
  apply (drule_tac [2] order_trans)
wenzelm@21632
   912
  apply (rule_tac [2] add_le_mono [OF order_refl setsum_fun_mono])
wenzelm@21632
   913
  prefer 3 apply assumption
wenzelm@21632
   914
  apply auto
wenzelm@21632
   915
  done
wenzelm@21632
   916
paulson@21710
   917
subsection {* Proof of the progress property (2) *}
wenzelm@21632
   918
paulson@21710
   919
text{*progress (2), step 1 is @{text System_Follows_ask} and
paulson@21710
   920
      @{text System_Follows_rel}*}
wenzelm@21632
   921
paulson@21710
   922
text{*progress (2), step 2; see also @{text System_Increasing_allocRel}*}
wenzelm@21632
   923
(* i < Nclients ==> System : Increasing (sub i o allocAsk) *)
wenzelm@21632
   924
lemmas System_Increasing_allocAsk =  System_Follows_ask [THEN Follows_Increasing1, standard]
wenzelm@21632
   925
paulson@21710
   926
text{*progress (2), step 3: lifting @{text Client_Bounded} to systemState*}
wenzelm@24147
   927
lemma rename_Client_Bounded: "i : I
wenzelm@24147
   928
    ==> rename sysOfClient (plam x: I. rename client_map Client) :
wenzelm@24147
   929
          UNIV  guarantees
paulson@21710
   930
          Always {s. ALL elt : set ((ask o sub i o client) s). elt \<le> NbT}"
wenzelm@24147
   931
  by rename_client_map
paulson@21710
   932
wenzelm@21632
   933
wenzelm@24147
   934
lemma System_Bounded_ask: "i < Nclients
wenzelm@24147
   935
      ==> System : Always
paulson@21710
   936
                    {s. ALL elt : set ((ask o sub i o client) s). elt \<le> NbT}"
wenzelm@21632
   937
  apply (rule component_guaranteesD [OF rename_Client_Bounded Client_component_System])
wenzelm@21632
   938
  apply auto
wenzelm@21632
   939
  done
wenzelm@21632
   940
wenzelm@21632
   941
lemma Collect_all_imp_eq: "{x. ALL y. P y --> Q x y} = (INT y: {y. P y}. {x. Q x y})"
wenzelm@21632
   942
  apply blast
wenzelm@21632
   943
  done
wenzelm@21632
   944
paulson@21710
   945
text{*progress (2), step 4*}
wenzelm@24147
   946
lemma System_Bounded_allocAsk: "System : Always {s. ALL i<Nclients.
paulson@21710
   947
                          ALL elt : set ((sub i o allocAsk) s). elt \<le> NbT}"
wenzelm@21632
   948
  apply (auto simp add: Collect_all_imp_eq)
wenzelm@39159
   949
  apply (tactic {* rtac (Always_Int_rule [@{thm Always_allocAsk_le_ask},
wenzelm@39159
   950
    @{thm System_Bounded_ask}] RS @{thm Always_weaken}) 1 *})
wenzelm@21632
   951
  apply (auto dest: set_mono)
wenzelm@21632
   952
  done
wenzelm@21632
   953
paulson@21710
   954
text{*progress (2), step 5 is @{text System_Increasing_allocGiv}*}
wenzelm@21632
   955
paulson@21710
   956
text{*progress (2), step 6*}
wenzelm@21632
   957
(* i < Nclients ==> System : Increasing (giv o sub i o client) *)
wenzelm@21632
   958
lemmas System_Increasing_giv =  System_Follows_allocGiv [THEN Follows_Increasing1, standard]
wenzelm@21632
   959
wenzelm@21632
   960
wenzelm@24147
   961
lemma rename_Client_Progress: "i: I
wenzelm@24147
   962
   ==> rename sysOfClient (plam x: I. rename client_map Client)
wenzelm@24147
   963
        : Increasing (giv o sub i o client)
wenzelm@24147
   964
          guarantees
wenzelm@24147
   965
          (INT h. {s. h \<le> (giv o sub i o client) s &
wenzelm@24147
   966
                            h pfixGe (ask o sub i o client) s}
paulson@21710
   967
                  LeadsTo {s. tokens h \<le> (tokens o rel o sub i o client) s})"
wenzelm@24147
   968
  apply rename_client_map
wenzelm@21632
   969
  apply (simp add: Client_Progress [simplified o_def])
wenzelm@21632
   970
  done
wenzelm@21632
   971
wenzelm@21632
   972
paulson@21710
   973
text{*progress (2), step 7*}
wenzelm@24147
   974
lemma System_Client_Progress:
wenzelm@24147
   975
  "System : (INT i : (lessThan Nclients).
wenzelm@24147
   976
            INT h. {s. h \<le> (giv o sub i o client) s &
wenzelm@24147
   977
                       h pfixGe (ask o sub i o client) s}
paulson@21710
   978
                LeadsTo {s. tokens h \<le> (tokens o rel o sub i o client) s})"
wenzelm@21632
   979
  apply (rule INT_I)
wenzelm@21632
   980
(*Couldn't have just used Auto_tac since the "INT h" must be kept*)
wenzelm@21632
   981
  apply (rule component_guaranteesD [OF rename_Client_Progress Client_component_System])
wenzelm@21632
   982
  apply (auto simp add: System_Increasing_giv)
wenzelm@21632
   983
  done
wenzelm@21632
   984
wenzelm@21632
   985
(*Concludes
wenzelm@24147
   986
 System : {s. k \<le> (sub i o allocGiv) s}
wenzelm@21632
   987
          LeadsTo
paulson@21710
   988
          {s. (sub i o allocAsk) s \<le> (ask o sub i o client) s} Int
paulson@21710
   989
          {s. k \<le> (giv o sub i o client) s} *)
wenzelm@21632
   990
paulson@21710
   991
lemmas System_lemma1 =
paulson@21710
   992
  Always_LeadsToD [OF System_Follows_ask [THEN Follows_Bounded]
paulson@21710
   993
                      System_Follows_allocGiv [THEN Follows_LeadsTo]]
wenzelm@21632
   994
paulson@21710
   995
lemmas System_lemma2 =
paulson@21710
   996
  PSP_Stable [OF System_lemma1
wenzelm@24147
   997
              System_Follows_ask [THEN Follows_Increasing1, THEN IncreasingD]]
paulson@21710
   998
paulson@21710
   999
wenzelm@24147
  1000
lemma System_lemma3: "i < Nclients
wenzelm@24147
  1001
      ==> System : {s. h \<le> (sub i o allocGiv) s &
wenzelm@24147
  1002
                       h pfixGe (sub i o allocAsk) s}
wenzelm@24147
  1003
                   LeadsTo
wenzelm@24147
  1004
                   {s. h \<le> (giv o sub i o client) s &
wenzelm@21632
  1005
                       h pfixGe (ask o sub i o client) s}"
wenzelm@21632
  1006
  apply (rule single_LeadsTo_I)
wenzelm@24147
  1007
  apply (rule_tac k6 = "h" and x2 = " (sub i o allocAsk) s"
paulson@21710
  1008
         in System_lemma2 [THEN LeadsTo_weaken])
wenzelm@21632
  1009
  apply auto
paulson@21710
  1010
  apply (blast intro: trans_Ge [THEN trans_genPrefix, THEN transD] prefix_imp_pfixGe)
wenzelm@21632
  1011
  done
wenzelm@21632
  1012
wenzelm@21632
  1013
paulson@21710
  1014
text{*progress (2), step 8: Client i's "release" action is visible system-wide*}
wenzelm@24147
  1015
lemma System_Alloc_Client_Progress: "i < Nclients
wenzelm@24147
  1016
      ==> System : {s. h \<le> (sub i o allocGiv) s &
wenzelm@24147
  1017
                       h pfixGe (sub i o allocAsk) s}
paulson@21710
  1018
                   LeadsTo {s. tokens h \<le> (tokens o sub i o allocRel) s}"
wenzelm@21632
  1019
  apply (rule LeadsTo_Trans)
wenzelm@21632
  1020
   prefer 2
wenzelm@21632
  1021
   apply (drule System_Follows_rel [THEN
wenzelm@21632
  1022
     mono_tokens [THEN mono_Follows_o, THEN [2] rev_subsetD],
wenzelm@21632
  1023
     THEN Follows_LeadsTo])
wenzelm@21632
  1024
   apply (simp add: o_assoc)
wenzelm@21632
  1025
  apply (rule LeadsTo_Trans)
wenzelm@21632
  1026
   apply (cut_tac [2] System_Client_Progress)
wenzelm@21632
  1027
   prefer 2
wenzelm@21632
  1028
   apply (blast intro: LeadsTo_Basis)
paulson@21710
  1029
  apply (erule System_lemma3)
wenzelm@21632
  1030
  done
wenzelm@21632
  1031
paulson@21710
  1032
text{*Lifting @{text Alloc_Progress} up to the level of systemState*}
wenzelm@21632
  1033
paulson@21710
  1034
text{*progress (2), step 9*}
wenzelm@24147
  1035
lemma System_Alloc_Progress:
wenzelm@24147
  1036
 "System : (INT i : (lessThan Nclients).
wenzelm@24147
  1037
            INT h. {s. h \<le> (sub i o allocAsk) s}
wenzelm@21632
  1038
                   LeadsTo {s. h pfixLe (sub i o allocGiv) s})"
wenzelm@21632
  1039
  apply (simp only: o_apply sub_def)
wenzelm@24147
  1040
  apply (insert Alloc_Progress [THEN rename_guarantees_sysOfAlloc_I])
haftmann@32139
  1041
  apply (simp add: o_def del: INT_iff)
paulson@21710
  1042
  apply (erule component_guaranteesD)
wenzelm@24147
  1043
  apply (auto simp add:
paulson@21710
  1044
    System_Increasing_allocRel [simplified sub_apply o_def]
paulson@21710
  1045
    System_Increasing_allocAsk [simplified sub_apply o_def]
paulson@21710
  1046
    System_Bounded_allocAsk [simplified sub_apply o_def]
paulson@21710
  1047
    System_Alloc_Client_Progress [simplified sub_apply o_def])
wenzelm@21632
  1048
  done
wenzelm@21632
  1049
paulson@21710
  1050
text{*progress (2), step 10 (final result!) *}
wenzelm@21632
  1051
lemma System_Progress: "System : system_progress"
wenzelm@21632
  1052
  apply (unfold system_progress_def)
wenzelm@21632
  1053
  apply (cut_tac System_Alloc_Progress)
wenzelm@21632
  1054
  apply (blast intro: LeadsTo_Trans
wenzelm@21632
  1055
    System_Follows_allocGiv [THEN Follows_LeadsTo_pfixLe]
wenzelm@21632
  1056
    System_Follows_ask [THEN Follows_LeadsTo])
wenzelm@21632
  1057
  done
wenzelm@21632
  1058
wenzelm@21632
  1059
paulson@21710
  1060
theorem System_correct: "System : system_spec"
wenzelm@21632
  1061
  apply (unfold system_spec_def)
wenzelm@21632
  1062
  apply (blast intro: System_safety System_Progress)
wenzelm@21632
  1063
  done
wenzelm@21632
  1064
wenzelm@21632
  1065
paulson@21710
  1066
text{* Some obsolete lemmas *}
wenzelm@21632
  1067
wenzelm@24147
  1068
lemma non_dummy_eq_o_funPair: "non_dummy = (% (g,a,r). (| giv = g, ask = a, rel = r |)) o
wenzelm@21632
  1069
                              (funPair giv (funPair ask rel))"
wenzelm@21632
  1070
  apply (rule ext)
wenzelm@21632
  1071
  apply (auto simp add: o_def non_dummy_def)
wenzelm@21632
  1072
  done
wenzelm@21632
  1073
wenzelm@24147
  1074
lemma preserves_non_dummy_eq: "(preserves non_dummy) =
wenzelm@21632
  1075
      (preserves rel Int preserves ask Int preserves giv)"
wenzelm@21632
  1076
  apply (simp add: non_dummy_eq_o_funPair)
wenzelm@21632
  1077
  apply auto
wenzelm@21632
  1078
    apply (drule_tac w1 = rel in subset_preserves_o [THEN [2] rev_subsetD])
wenzelm@21632
  1079
    apply (drule_tac [2] w1 = ask in subset_preserves_o [THEN [2] rev_subsetD])
wenzelm@21632
  1080
    apply (drule_tac [3] w1 = giv in subset_preserves_o [THEN [2] rev_subsetD])
wenzelm@21632
  1081
    apply (auto simp add: o_def)
wenzelm@21632
  1082
  done
wenzelm@21632
  1083
paulson@21710
  1084
text{*Could go to Extend.ML*}
wenzelm@21632
  1085
lemma bij_fst_inv_inv_eq: "bij f ==> fst (inv (%(x, u). inv f x) z) = f z"
wenzelm@21632
  1086
  apply (rule fst_inv_equalityI)
wenzelm@21632
  1087
   apply (rule_tac f = "%z. (f z, ?h z) " in surjI)
wenzelm@21632
  1088
   apply (simp add: bij_is_inj inv_f_f)
wenzelm@21632
  1089
  apply (simp add: bij_is_surj surj_f_inv_f)
wenzelm@21632
  1090
  done
paulson@11194
  1091
paulson@11194
  1092
end