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