src/HOL/Quickcheck.thy
author haftmann
Mon Oct 22 22:24:34 2012 +0200 (2012-10-22)
changeset 49972 f11f8905d9fd
parent 48891 c0eafbd55de3
child 50046 0051dc4f301f
permissions -rw-r--r--
incorporated constant chars into instantiation proof for enum;
tuned proofs for properties on enum of chars;
swapped theory dependency of Enum.thy and String.thy
bulwahn@41922
     1
(* Author: Florian Haftmann & Lukas Bulwahn, TU Muenchen *)
haftmann@26265
     2
bulwahn@41922
     3
header {* A simple counterexample generator performing random testing *}
haftmann@26265
     4
haftmann@26265
     5
theory Quickcheck
bulwahn@40650
     6
imports Random Code_Evaluation Enum
haftmann@26265
     7
begin
haftmann@26265
     8
haftmann@37751
     9
notation fcomp (infixl "\<circ>>" 60)
haftmann@37751
    10
notation scomp (infixl "\<circ>\<rightarrow>" 60)
haftmann@31179
    11
bulwahn@45718
    12
setup {* Code_Target.extend_target ("Quickcheck", (Code_Runtime.target, K I)) *}
bulwahn@45718
    13
bulwahn@45718
    14
subsection {* Catching Match exceptions *}
bulwahn@45718
    15
bulwahn@45801
    16
axiomatization catch_match :: "'a => 'a => 'a"
bulwahn@45718
    17
bulwahn@45718
    18
code_const catch_match 
bulwahn@48273
    19
  (Quickcheck "((_) handle Match => _)")
haftmann@31179
    20
haftmann@26265
    21
subsection {* The @{text random} class *}
haftmann@26265
    22
haftmann@28335
    23
class random = typerep +
haftmann@31205
    24
  fixes random :: "code_numeral \<Rightarrow> Random.seed \<Rightarrow> ('a \<times> (unit \<Rightarrow> term)) \<times> Random.seed"
haftmann@26265
    25
haftmann@26267
    26
haftmann@31260
    27
subsection {* Fundamental and numeric types*}
haftmann@31179
    28
haftmann@31179
    29
instantiation bool :: random
haftmann@31179
    30
begin
haftmann@31179
    31
haftmann@31179
    32
definition
haftmann@37751
    33
  "random i = Random.range 2 \<circ>\<rightarrow>
haftmann@32657
    34
    (\<lambda>k. Pair (if k = 0 then Code_Evaluation.valtermify False else Code_Evaluation.valtermify True))"
haftmann@31179
    35
haftmann@31179
    36
instance ..
haftmann@31179
    37
haftmann@31179
    38
end
haftmann@31179
    39
haftmann@31179
    40
instantiation itself :: (typerep) random
haftmann@31179
    41
begin
haftmann@31179
    42
wenzelm@46975
    43
definition
wenzelm@46975
    44
  random_itself :: "code_numeral \<Rightarrow> Random.seed \<Rightarrow> ('a itself \<times> (unit \<Rightarrow> term)) \<times> Random.seed"
wenzelm@46975
    45
where "random_itself _ = Pair (Code_Evaluation.valtermify TYPE('a))"
haftmann@31179
    46
haftmann@31179
    47
instance ..
haftmann@31179
    48
haftmann@31179
    49
end
haftmann@31179
    50
haftmann@31483
    51
instantiation char :: random
haftmann@31483
    52
begin
haftmann@31483
    53
haftmann@31483
    54
definition
haftmann@49972
    55
  "random _ = Random.select (Enum.enum :: char list) \<circ>\<rightarrow> (\<lambda>c. Pair (c, \<lambda>u. Code_Evaluation.term_of c))"
haftmann@31483
    56
haftmann@31483
    57
instance ..
haftmann@31483
    58
haftmann@31483
    59
end
haftmann@31483
    60
haftmann@31483
    61
instantiation String.literal :: random
haftmann@31483
    62
begin
haftmann@31483
    63
haftmann@31483
    64
definition 
haftmann@32657
    65
  "random _ = Pair (STR '''', \<lambda>u. Code_Evaluation.term_of (STR ''''))"
haftmann@31483
    66
haftmann@31483
    67
instance ..
haftmann@31483
    68
haftmann@31483
    69
end
haftmann@31483
    70
haftmann@31179
    71
instantiation nat :: random
haftmann@31179
    72
begin
haftmann@31179
    73
wenzelm@46975
    74
definition random_nat :: "code_numeral \<Rightarrow> Random.seed
wenzelm@46975
    75
  \<Rightarrow> (nat \<times> (unit \<Rightarrow> Code_Evaluation.term)) \<times> Random.seed"
wenzelm@46975
    76
where
haftmann@37751
    77
  "random_nat i = Random.range (i + 1) \<circ>\<rightarrow> (\<lambda>k. Pair (
haftmann@31205
    78
     let n = Code_Numeral.nat_of k
haftmann@32657
    79
     in (n, \<lambda>_. Code_Evaluation.term_of n)))"
haftmann@31194
    80
haftmann@31194
    81
instance ..
haftmann@31194
    82
haftmann@31194
    83
end
haftmann@31194
    84
haftmann@31194
    85
instantiation int :: random
haftmann@31194
    86
begin
haftmann@31194
    87
haftmann@31194
    88
definition
haftmann@37751
    89
  "random i = Random.range (2 * i + 1) \<circ>\<rightarrow> (\<lambda>k. Pair (
haftmann@31205
    90
     let j = (if k \<ge> i then Code_Numeral.int_of (k - i) else - Code_Numeral.int_of (i - k))
haftmann@32657
    91
     in (j, \<lambda>_. Code_Evaluation.term_of j)))"
haftmann@31179
    92
haftmann@31179
    93
instance ..
haftmann@31179
    94
haftmann@30945
    95
end
haftmann@31179
    96
haftmann@31260
    97
haftmann@31260
    98
subsection {* Complex generators *}
haftmann@31260
    99
haftmann@31603
   100
text {* Towards @{typ "'a \<Rightarrow> 'b"} *}
haftmann@31603
   101
haftmann@31603
   102
axiomatization random_fun_aux :: "typerep \<Rightarrow> typerep \<Rightarrow> ('a \<Rightarrow> 'a \<Rightarrow> bool) \<Rightarrow> ('a \<Rightarrow> term)
wenzelm@46975
   103
  \<Rightarrow> (Random.seed \<Rightarrow> ('b \<times> (unit \<Rightarrow> term)) \<times> Random.seed)
wenzelm@46975
   104
  \<Rightarrow> (Random.seed \<Rightarrow> Random.seed \<times> Random.seed)
haftmann@31603
   105
  \<Rightarrow> Random.seed \<Rightarrow> (('a \<Rightarrow> 'b) \<times> (unit \<Rightarrow> term)) \<times> Random.seed"
haftmann@31603
   106
haftmann@31622
   107
definition random_fun_lift :: "(Random.seed \<Rightarrow> ('b \<times> (unit \<Rightarrow> term)) \<times> Random.seed)
wenzelm@46975
   108
  \<Rightarrow> Random.seed \<Rightarrow> (('a\<Colon>term_of \<Rightarrow> 'b\<Colon>typerep) \<times> (unit \<Rightarrow> term)) \<times> Random.seed"
wenzelm@46975
   109
where
wenzelm@46975
   110
  "random_fun_lift f =
wenzelm@46975
   111
    random_fun_aux TYPEREP('a) TYPEREP('b) (op =) Code_Evaluation.term_of f Random.split_seed"
haftmann@31603
   112
haftmann@38857
   113
instantiation "fun" :: ("{equal, term_of}", random) random
haftmann@31603
   114
begin
haftmann@31603
   115
wenzelm@46975
   116
definition
wenzelm@46975
   117
  random_fun :: "code_numeral \<Rightarrow> Random.seed \<Rightarrow> (('a \<Rightarrow> 'b) \<times> (unit \<Rightarrow> term)) \<times> Random.seed"
wenzelm@46975
   118
  where "random i = random_fun_lift (random i)"
haftmann@31603
   119
haftmann@31603
   120
instance ..
haftmann@31603
   121
haftmann@31603
   122
end
haftmann@31603
   123
haftmann@31603
   124
text {* Towards type copies and datatypes *}
haftmann@31603
   125
wenzelm@46975
   126
definition collapse :: "('a \<Rightarrow> ('a \<Rightarrow> 'b \<times> 'a) \<times> 'a) \<Rightarrow> 'a \<Rightarrow> 'b \<times> 'a"
wenzelm@46975
   127
  where "collapse f = (f \<circ>\<rightarrow> id)"
haftmann@31223
   128
wenzelm@46975
   129
definition beyond :: "code_numeral \<Rightarrow> code_numeral \<Rightarrow> code_numeral"
wenzelm@46975
   130
  where "beyond k l = (if l > k then l else 0)"
haftmann@31260
   131
wenzelm@46975
   132
lemma beyond_zero: "beyond k 0 = 0"
haftmann@31267
   133
  by (simp add: beyond_def)
haftmann@31267
   134
bulwahn@46311
   135
wenzelm@46975
   136
definition (in term_syntax) [code_unfold]:
wenzelm@46975
   137
  "valterm_emptyset = Code_Evaluation.valtermify ({} :: ('a :: typerep) set)"
wenzelm@46975
   138
wenzelm@46975
   139
definition (in term_syntax) [code_unfold]:
wenzelm@46975
   140
  "valtermify_insert x s = Code_Evaluation.valtermify insert {\<cdot>} (x :: ('a :: typerep * _)) {\<cdot>} s"
bulwahn@46311
   141
bulwahn@46311
   142
instantiation set :: (random) random
bulwahn@46311
   143
begin
bulwahn@46311
   144
bulwahn@46311
   145
primrec random_aux_set
bulwahn@46311
   146
where
bulwahn@46311
   147
  "random_aux_set 0 j = collapse (Random.select_weight [(1, Pair valterm_emptyset)])"
wenzelm@46975
   148
| "random_aux_set (Code_Numeral.Suc i) j =
wenzelm@46975
   149
    collapse (Random.select_weight
wenzelm@46975
   150
      [(1, Pair valterm_emptyset),
wenzelm@46975
   151
       (Code_Numeral.Suc i,
wenzelm@46975
   152
        random j \<circ>\<rightarrow> (%x. random_aux_set i j \<circ>\<rightarrow> (%s. Pair (valtermify_insert x s))))])"
bulwahn@46311
   153
bulwahn@46311
   154
lemma [code]:
wenzelm@46975
   155
  "random_aux_set i j =
wenzelm@46975
   156
    collapse (Random.select_weight [(1, Pair valterm_emptyset),
wenzelm@46975
   157
      (i, random j \<circ>\<rightarrow> (%x. random_aux_set (i - 1) j \<circ>\<rightarrow> (%s. Pair (valtermify_insert x s))))])"
bulwahn@46311
   158
proof (induct i rule: code_numeral.induct)
bulwahn@46311
   159
  case zero
bulwahn@46311
   160
  show ?case by (subst select_weight_drop_zero[symmetric])
bulwahn@46311
   161
    (simp add: filter.simps random_aux_set.simps[simplified])
bulwahn@46311
   162
next
huffman@46547
   163
  case (Suc i)
bulwahn@46311
   164
  show ?case by (simp only: random_aux_set.simps(2)[of "i"] Suc_code_numeral_minus_one)
bulwahn@46311
   165
qed
bulwahn@46311
   166
wenzelm@46975
   167
definition "random_set i = random_aux_set i i"
bulwahn@46311
   168
bulwahn@46311
   169
instance ..
bulwahn@46311
   170
bulwahn@46311
   171
end
bulwahn@46311
   172
haftmann@31483
   173
lemma random_aux_rec:
haftmann@31483
   174
  fixes random_aux :: "code_numeral \<Rightarrow> 'a"
haftmann@31483
   175
  assumes "random_aux 0 = rhs 0"
huffman@46547
   176
    and "\<And>k. random_aux (Code_Numeral.Suc k) = rhs (Code_Numeral.Suc k)"
haftmann@31483
   177
  shows "random_aux k = rhs k"
haftmann@31483
   178
  using assms by (rule code_numeral.induct)
haftmann@31483
   179
bulwahn@45718
   180
subsection {* Deriving random generators for datatypes *}
bulwahn@45718
   181
wenzelm@48891
   182
ML_file "Tools/Quickcheck/quickcheck_common.ML" 
wenzelm@48891
   183
ML_file "Tools/Quickcheck/random_generators.ML"
bulwahn@41923
   184
setup Random_Generators.setup
haftmann@34968
   185
haftmann@34968
   186
haftmann@34968
   187
subsection {* Code setup *}
blanchet@33561
   188
bulwahn@41935
   189
code_const random_fun_aux (Quickcheck "Random'_Generators.random'_fun")
haftmann@34968
   190
  -- {* With enough criminal energy this can be abused to derive @{prop False};
haftmann@34968
   191
  for this reason we use a distinguished target @{text Quickcheck}
haftmann@34968
   192
  not spoiling the regular trusted code generation *}
haftmann@34968
   193
bulwahn@41935
   194
code_reserved Quickcheck Random_Generators
haftmann@34968
   195
haftmann@37751
   196
no_notation fcomp (infixl "\<circ>>" 60)
haftmann@37751
   197
no_notation scomp (infixl "\<circ>\<rightarrow>" 60)
haftmann@34968
   198
haftmann@34968
   199
subsection {* The Random-Predicate Monad *} 
bulwahn@33250
   200
bulwahn@35880
   201
fun iter' ::
wenzelm@46975
   202
  "'a itself => code_numeral => code_numeral => code_numeral * code_numeral
wenzelm@46975
   203
    => ('a::random) Predicate.pred"
bulwahn@35880
   204
where
bulwahn@35880
   205
  "iter' T nrandom sz seed = (if nrandom = 0 then bot_class.bot else
bulwahn@35880
   206
     let ((x, _), seed') = random sz seed
bulwahn@35880
   207
   in Predicate.Seq (%u. Predicate.Insert x (iter' T (nrandom - 1) sz seed')))"
bulwahn@35880
   208
wenzelm@46975
   209
definition iter :: "code_numeral => code_numeral => code_numeral * code_numeral
wenzelm@46975
   210
  => ('a::random) Predicate.pred"
bulwahn@35880
   211
where
bulwahn@35880
   212
  "iter nrandom sz seed = iter' (TYPE('a)) nrandom sz seed"
bulwahn@35880
   213
bulwahn@35880
   214
lemma [code]:
bulwahn@35880
   215
  "iter nrandom sz seed = (if nrandom = 0 then bot_class.bot else
bulwahn@35880
   216
     let ((x, _), seed') = random sz seed
bulwahn@35880
   217
   in Predicate.Seq (%u. Predicate.Insert x (iter (nrandom - 1) sz seed')))"
bulwahn@35880
   218
unfolding iter_def iter'.simps[of _ nrandom] ..
bulwahn@35880
   219
bulwahn@42163
   220
type_synonym 'a randompred = "Random.seed \<Rightarrow> ('a Predicate.pred \<times> Random.seed)"
bulwahn@33250
   221
bulwahn@33250
   222
definition empty :: "'a randompred"
bulwahn@33250
   223
  where "empty = Pair (bot_class.bot)"
bulwahn@33250
   224
bulwahn@33250
   225
definition single :: "'a => 'a randompred"
bulwahn@33250
   226
  where "single x = Pair (Predicate.single x)"
bulwahn@33250
   227
bulwahn@33250
   228
definition bind :: "'a randompred \<Rightarrow> ('a \<Rightarrow> 'b randompred) \<Rightarrow> 'b randompred"
bulwahn@33250
   229
  where
bulwahn@33250
   230
    "bind R f = (\<lambda>s. let
bulwahn@33250
   231
       (P, s') = R s;
bulwahn@33250
   232
       (s1, s2) = Random.split_seed s'
bulwahn@33250
   233
     in (Predicate.bind P (%a. fst (f a s1)), s2))"
bulwahn@33250
   234
bulwahn@33250
   235
definition union :: "'a randompred \<Rightarrow> 'a randompred \<Rightarrow> 'a randompred"
bulwahn@33250
   236
where
bulwahn@33250
   237
  "union R1 R2 = (\<lambda>s. let
bulwahn@33250
   238
     (P1, s') = R1 s; (P2, s'') = R2 s'
krauss@44845
   239
   in (sup_class.sup P1 P2, s''))"
bulwahn@33250
   240
bulwahn@33250
   241
definition if_randompred :: "bool \<Rightarrow> unit randompred"
bulwahn@33250
   242
where
bulwahn@33250
   243
  "if_randompred b = (if b then single () else empty)"
bulwahn@33250
   244
bulwahn@36049
   245
definition iterate_upto :: "(code_numeral => 'a) => code_numeral => code_numeral => 'a randompred"
bulwahn@36049
   246
where
haftmann@46664
   247
  "iterate_upto f n m = Pair (Predicate.iterate_upto f n m)"
bulwahn@36049
   248
bulwahn@33250
   249
definition not_randompred :: "unit randompred \<Rightarrow> unit randompred"
bulwahn@33250
   250
where
bulwahn@33250
   251
  "not_randompred P = (\<lambda>s. let
bulwahn@33250
   252
     (P', s') = P s
bulwahn@33250
   253
   in if Predicate.eval P' () then (Orderings.bot, s') else (Predicate.single (), s'))"
bulwahn@33250
   254
bulwahn@33250
   255
definition Random :: "(Random.seed \<Rightarrow> ('a \<times> (unit \<Rightarrow> term)) \<times> Random.seed) \<Rightarrow> 'a randompred"
bulwahn@33250
   256
  where "Random g = scomp g (Pair o (Predicate.single o fst))"
bulwahn@33250
   257
bulwahn@33250
   258
definition map :: "('a \<Rightarrow> 'b) \<Rightarrow> ('a randompred \<Rightarrow> 'b randompred)"
bulwahn@33250
   259
  where "map f P = bind P (single o f)"
bulwahn@33250
   260
bulwahn@45801
   261
hide_fact
wenzelm@46976
   262
  random_bool_def
wenzelm@46976
   263
  random_itself_def
wenzelm@46976
   264
  random_char_def
wenzelm@46976
   265
  random_literal_def
wenzelm@46976
   266
  random_nat_def
wenzelm@46976
   267
  random_int_def
wenzelm@46976
   268
  random_fun_lift_def
wenzelm@46976
   269
  random_fun_def
wenzelm@46976
   270
  collapse_def
wenzelm@46976
   271
  beyond_def
wenzelm@46976
   272
  beyond_zero
bulwahn@45801
   273
  random_aux_rec
bulwahn@45801
   274
bulwahn@45801
   275
hide_const (open) catch_match random collapse beyond random_fun_aux random_fun_lift
bulwahn@45801
   276
wenzelm@46975
   277
hide_fact (open) iter'.simps iter_def empty_def single_def bind_def union_def
wenzelm@46975
   278
  if_randompred_def iterate_upto_def not_randompred_def Random_def map_def 
wenzelm@36176
   279
hide_type (open) randompred
wenzelm@46975
   280
hide_const (open) iter' iter empty single bind union if_randompred
wenzelm@46975
   281
  iterate_upto not_randompred Random map
haftmann@31267
   282
haftmann@31179
   283
end
haftmann@49972
   284