src/HOL/ex/InductiveInvariant_examples.thy
author wenzelm
Tue, 06 Sep 2005 19:10:43 +0200
changeset 17289 8608f7a881eb
parent 16417 9bc16273c2d4
child 17388 495c799df31d
permissions -rw-r--r--
converted to Isar theory format;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
16417
9bc16273c2d4 migrated theory headers to new format
haftmann
parents: 15636
diff changeset
     1
theory InductiveInvariant_examples imports InductiveInvariant  begin
15636
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
     2
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
     3
(** Authors: Sava Krsti\'{c} and John Matthews **)
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
     4
(**    Date: Oct 17, 2003                      **)
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
     5
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
     6
text "A simple example showing how to use an inductive invariant
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
     7
      to solve termination conditions generated by recdef on
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
     8
      nested recursive function definitions."
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
     9
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    10
consts g :: "nat => nat"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    11
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    12
recdef (permissive) g "less_than"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    13
  "g 0 = 0"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    14
  "g (Suc n) = g (g n)"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    15
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    16
text "We can prove the unsolved termination condition for
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    17
      g by showing it is an inductive invariant."
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    18
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    19
recdef_tc g_tc[simp]: g
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    20
apply (rule allI)
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    21
apply (rule_tac x=n in tfl_indinv_wfrec [OF g_def])
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    22
apply (auto simp add: indinv_def split: nat.split)
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    23
apply (frule_tac x=nat in spec)
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    24
apply (drule_tac x="f nat" in spec)
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    25
by auto
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    26
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    27
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    28
text "This declaration invokes Isabelle's simplifier to
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    29
      remove any termination conditions before adding
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    30
      g's rules to the simpset."
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    31
declare g.simps [simplified, simp]
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    32
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    33
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    34
text "This is an example where the termination condition generated
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    35
      by recdef is not itself an inductive invariant."
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    36
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    37
consts g' :: "nat => nat"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    38
recdef (permissive) g' "less_than"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    39
  "g' 0 = 0"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    40
  "g' (Suc n) = g' n + g' (g' n)"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    41
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    42
thm g'.simps
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    43
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    44
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    45
text "The strengthened inductive invariant is as follows
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    46
      (this invariant also works for the first example above):"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    47
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    48
lemma g'_inv: "g' n = 0"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    49
thm tfl_indinv_wfrec [OF g'_def]
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    50
apply (rule_tac x=n in tfl_indinv_wfrec [OF g'_def])
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    51
by (auto simp add: indinv_def split: nat.split)
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    52
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    53
recdef_tc g'_tc[simp]: g'
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    54
by (simp add: g'_inv)
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    55
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    56
text "Now we can remove the termination condition from
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    57
      the rules for g' ."
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    58
thm g'.simps [simplified]
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    59
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    60
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    61
text {* Sometimes a recursive definition is partial, that is, it
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    62
        is only meant to be invoked on "good" inputs. As a contrived
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    63
        example, we will define a new version of g that is only
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    64
        well defined for even inputs greater than zero. *}
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    65
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    66
consts g_even :: "nat => nat"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    67
recdef (permissive) g_even "less_than"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    68
  "g_even (Suc (Suc 0)) = 3"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    69
  "g_even n = g_even (g_even (n - 2) - 1)"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    70
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    71
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    72
text "We can prove a conditional version of the unsolved termination
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    73
      condition for @{term g_even} by proving a stronger inductive invariant."
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    74
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    75
lemma g_even_indinv: "\<exists>k. n = Suc (Suc (2*k)) ==> g_even n = 3"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    76
apply (rule_tac D="{n. \<exists>k. n = Suc (Suc (2*k))}" and x=n in tfl_indinv_on_wfrec [OF g_even_def])
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    77
apply (auto simp add: indinv_on_def split: nat.split)
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    78
by (case_tac ka, auto)
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    79
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    80
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    81
text "Now we can prove that the second recursion equation for @{term g_even}
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    82
      holds, provided that n is an even number greater than two."
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    83
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    84
theorem g_even_n: "\<exists>k. n = 2*k + 4 ==> g_even n = g_even (g_even (n - 2) - 1)"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    85
apply (subgoal_tac "(\<exists>k. n - 2 = 2*k + 2) & (\<exists>k. n = 2*k + 2)")
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    86
by (auto simp add: g_even_indinv, arith)
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    87
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    88
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    89
text "McCarthy's ninety-one function. This function requires a
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    90
      non-standard measure to prove termination."
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    91
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    92
consts ninety_one :: "nat => nat"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    93
recdef (permissive) ninety_one "measure (%n. 101 - n)"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    94
  "ninety_one x = (if 100 < x
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    95
                     then x - 10
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    96
                     else (ninety_one (ninety_one (x+11))))"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    97
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    98
text "To discharge the termination condition, we will prove
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
    99
      a strengthened inductive invariant:
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   100
         S x y == x < y + 11"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   101
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   102
lemma ninety_one_inv: "n < ninety_one n + 11"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   103
apply (rule_tac x=n in tfl_indinv_wfrec [OF ninety_one_def])
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   104
apply force
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   105
apply (auto simp add: indinv_def measure_def inv_image_def)
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   106
apply (frule_tac x="x+11" in spec)
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   107
apply (frule_tac x="f (x + 11)" in spec)
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   108
by arith
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   109
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   110
text "Proving the termination condition using the
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   111
      strengthened inductive invariant."
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   112
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   113
recdef_tc ninety_one_tc[rule_format]: ninety_one
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   114
apply clarify
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   115
by (cut_tac n="x+11" in ninety_one_inv, arith)
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   116
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   117
text "Now we can remove the termination condition from
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   118
      the simplification rule for @{term ninety_one}."
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   119
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   120
theorem def_ninety_one:
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   121
"ninety_one x = (if 100 < x
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   122
                   then x - 10
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   123
                   else ninety_one (ninety_one (x+11)))"
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   124
by (subst ninety_one.simps,
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   125
    simp add: ninety_one_tc measure_def inv_image_def)
57c437b70521 converted from DOS to UNIX format
paulson
parents: 14244
diff changeset
   126
14244
f58598341d30 InductiveInvariant_examples illustrates advanced recursive function definitions
paulson
parents:
diff changeset
   127
end