| 
7626
 | 
     1  | 
(*  Title:      HOL/BCV/Machine.thy
  | 
| 
 | 
     2  | 
    ID:         $Id$
  | 
| 
 | 
     3  | 
    Author:     Tobias Nipkow
  | 
| 
 | 
     4  | 
    Copyright   1999 TUM
  | 
| 
 | 
     5  | 
  | 
| 
 | 
     6  | 
A register machine.
  | 
| 
 | 
     7  | 
*)
  | 
| 
 | 
     8  | 
  | 
| 
 | 
     9  | 
Machine = Types + DFAimpl +
  | 
| 
 | 
    10  | 
  | 
| 
 | 
    11  | 
datatype ('a,'b,'c)instr =
 | 
| 
 | 
    12  | 
    Move nat nat
  | 
| 
 | 
    13  | 
  | Aload 'a nat | Bload 'b nat | Cload 'c nat
  | 
| 
 | 
    14  | 
  | Aop nat nat nat | Bop nat nat nat | Cop nat nat nat
  | 
| 
 | 
    15  | 
  | Comp nat nat nat
  | 
| 
 | 
    16  | 
  | Halt
  | 
| 
 | 
    17  | 
  | 
| 
 | 
    18  | 
consts maxreg :: ('a,'b,'c)instr => nat
 | 
| 
 | 
    19  | 
       maxregs :: ('a,'b,'c)instr list => nat
 | 
| 
 | 
    20  | 
primrec
  | 
| 
 | 
    21  | 
"maxreg(Move m n) = max m n"
  | 
| 
 | 
    22  | 
"maxreg(Aload x n) = n"
  | 
| 
 | 
    23  | 
"maxreg(Bload x n) = n"
  | 
| 
 | 
    24  | 
"maxreg(Cload x n) = n"
  | 
| 
 | 
    25  | 
"maxreg(Aop i j k) = max i (max j k)"
  | 
| 
 | 
    26  | 
"maxreg(Bop i j k) = max i (max j k)"
  | 
| 
 | 
    27  | 
"maxreg(Cop i j k) = max i (max j k)"
  | 
| 
 | 
    28  | 
"maxreg(Comp i j l) = max i j"
  | 
| 
 | 
    29  | 
"maxreg Halt = 0"
  | 
| 
 | 
    30  | 
  | 
| 
 | 
    31  | 
primrec
  | 
| 
 | 
    32  | 
"maxregs [] = 0"
  | 
| 
 | 
    33  | 
"maxregs (x#xs) = max (maxreg x+1) (maxregs xs)"
  | 
| 
 | 
    34  | 
  | 
| 
 | 
    35  | 
constdefs
  | 
| 
 | 
    36  | 
  | 
| 
 | 
    37  | 
 wt_instr :: ('a,'b,'c)instr => nat => typ list option list => bool
 | 
| 
 | 
    38  | 
"wt_instr b p T ==
  | 
| 
 | 
    39  | 
 case T!p of
  | 
| 
 | 
    40  | 
   None => True
  | 
| 
 | 
    41  | 
 | Some ts =>
  | 
| 
 | 
    42  | 
 case b of
  | 
| 
 | 
    43  | 
   Move i j  => Some(ts[j:=ts!i]) <= T!(p+1)
  | 
| 
 | 
    44  | 
 | Aload x i => Some(ts[i:=Atyp]) <= T!(p+1)
  | 
| 
 | 
    45  | 
 | Bload x i => Some(ts[i:=Btyp]) <= T!(p+1)
  | 
| 
 | 
    46  | 
 | Cload x i => Some(ts[i:=Ctyp]) <= T!(p+1)
  | 
| 
 | 
    47  | 
 | Aop i j k => ts!i <= Atyp & ts!j <= Atyp & Some(ts[k:=Atyp]) <= T!(p+1)
  | 
| 
 | 
    48  | 
 | Bop i j k => ts!i <= Btyp & ts!j <= Btyp & Some(ts[k:=Btyp]) <= T!(p+1)
  | 
| 
 | 
    49  | 
 | Cop i j k => ts!i <= Ctyp & ts!j <= Ctyp & Some(ts[k:=Ctyp]) <= T!(p+1)
  | 
| 
 | 
    50  | 
 | Comp i j q => (ts!i <= ts!j & ts!j ~= Top | ts!j <= ts!i & ts!i ~= Top) &
  | 
| 
 | 
    51  | 
                 T!p <= T!(p+1) & T!p <= T!q
  | 
| 
 | 
    52  | 
 | Halt =>      True"
  | 
| 
 | 
    53  | 
  | 
| 
 | 
    54  | 
 stype :: ('a,'b,'c)instr list => typ list set
 | 
| 
 | 
    55  | 
"stype bs == listsn (maxregs bs) UNIV"
  | 
| 
 | 
    56  | 
  | 
| 
 | 
    57  | 
constdefs
  | 
| 
 | 
    58  | 
 succs :: "('a,'b,'c)instr => nat => nat list"
 | 
| 
 | 
    59  | 
"succs instr p ==
  | 
| 
 | 
    60  | 
  case instr of
  | 
| 
 | 
    61  | 
    Move i j  => [p+1]
  | 
| 
 | 
    62  | 
  | Aload x i => [p+1]
  | 
| 
 | 
    63  | 
  | Bload x i => [p+1]
  | 
| 
 | 
    64  | 
  | Cload x i => [p+1]
  | 
| 
 | 
    65  | 
  | Aop i j k => [p+1]
  | 
| 
 | 
    66  | 
  | Bop i j k => [p+1]
  | 
| 
 | 
    67  | 
  | Cop i j k => [p+1]
  | 
| 
 | 
    68  | 
  | Comp i j q => [p+1,q]
  | 
| 
 | 
    69  | 
  | Halt       => []"
  | 
| 
 | 
    70  | 
  | 
| 
 | 
    71  | 
 exec :: "('a,'b,'c)instr => typ list => typ list option"
 | 
| 
 | 
    72  | 
"exec instr ts ==
  | 
| 
 | 
    73  | 
  case instr of
  | 
| 
 | 
    74  | 
    Move i j  => Some(ts[j := ts!i])
  | 
| 
 | 
    75  | 
  | Aload x i => Some(ts[i := Atyp])
  | 
| 
 | 
    76  | 
  | Bload x i => Some(ts[i := Btyp])
  | 
| 
 | 
    77  | 
  | Cload x i => Some(ts[i := Ctyp])
  | 
| 
 | 
    78  | 
  | Aop i j k => if ts!i <= Atyp & ts!j <= Atyp
  | 
| 
 | 
    79  | 
                 then Some(ts[k := Atyp])
  | 
| 
 | 
    80  | 
                 else None
  | 
| 
 | 
    81  | 
  | Bop i j k => if ts!i <= Btyp & ts!j <= Btyp
  | 
| 
 | 
    82  | 
                 then Some(ts[k := Btyp])
  | 
| 
 | 
    83  | 
                 else None
  | 
| 
 | 
    84  | 
  | Cop i j k => if ts!i <= Ctyp & ts!j <= Ctyp
  | 
| 
 | 
    85  | 
                 then Some(ts[k := Ctyp])
  | 
| 
 | 
    86  | 
                 else None
  | 
| 
 | 
    87  | 
  | Comp i j q => if ts!i <= ts!j & ts!j ~= Top | ts!j <= ts!i & ts!i ~= Top
  | 
| 
 | 
    88  | 
                  then Some ts
  | 
| 
 | 
    89  | 
                  else None
  | 
| 
 | 
    90  | 
  | Halt       => Some ts"
  | 
| 
 | 
    91  | 
(*
  | 
| 
 | 
    92  | 
  | Bop i j k => if ts!i <= Btyp & ts!j <= Btyp
  | 
| 
 | 
    93  | 
                 then Some(ts[k := ts!i+ts!j])
  | 
| 
 | 
    94  | 
                 else None
  | 
| 
 | 
    95  | 
*)
  | 
| 
 | 
    96  | 
end
  |