Various little changes like cmethd -> method and cfield -> field.
1 (* Title: HOL/MicroJava/J/Eval.thy
3 Author: David von Oheimb
4 Copyright 1999 Technische Universitaet Muenchen
6 Operational evaluation (big-step) semantics of the
7 execution of Java expressions and statements
13 eval :: "javam prog \\<Rightarrow> (xstate \\<times> expr \\<times> val \\<times> xstate) set"
14 evals :: "javam prog \\<Rightarrow> (xstate \\<times> expr list \\<times> val list \\<times> xstate) set"
15 exec :: "javam prog \\<Rightarrow> (xstate \\<times> stmt \\<times> xstate) set"
18 eval :: "[javam prog,xstate,expr,val,xstate] \\<Rightarrow> bool "("_\\<turnstile>_ -_\\<succ>_\\<rightarrow> _"[51,82,82,82,82]81)
19 evals:: "[javam prog,xstate,expr list,
20 val list,xstate] \\<Rightarrow> bool "("_\\<turnstile>_ -_[\\<succ>]_\\<rightarrow> _"[51,82,51,51,82]81)
21 exec :: "[javam prog,xstate,stmt, xstate] \\<Rightarrow> bool "("_\\<turnstile>_ -_\\<rightarrow> _" [51,82,82, 82]81)
24 "G\\<turnstile>s -e \\<succ> v\\<rightarrow> (x,s')" == "(s, e, v, _args x s') \\<in> eval G"
25 "G\\<turnstile>s -e \\<succ> v\\<rightarrow> s' " == "(s, e, v, s') \\<in> eval G"
26 "G\\<turnstile>s -e[\\<succ>]v\\<rightarrow> (x,s')" == "(s, e, v, _args x s') \\<in> evals G"
27 "G\\<turnstile>s -e[\\<succ>]v\\<rightarrow> s' " == "(s, e, v, s') \\<in> evals G"
28 "G\\<turnstile>s -c \\<rightarrow> (x,s')" == "(s, c, _args x s') \\<in> exec G"
29 "G\\<turnstile>s -c \\<rightarrow> s' " == "(s, c, s') \\<in> exec G"
31 inductive "eval G" "evals G" "exec G" intrs
33 (* evaluation of expressions *)
36 XcptE "G\\<turnstile>(Some xc,s) -e\\<succ>arbitrary\\<rightarrow> (Some xc,s)"
39 NewC "\\<lbrakk>h = heap s; (a,x) = new_Addr h;
40 h'= h(a\\<mapsto>(C,init_vars (fields (G,C))))\\<rbrakk> \\<Longrightarrow>
41 G\\<turnstile>Norm s -NewC C\\<succ>Addr a\\<rightarrow> c_hupd h' (x,s)"
44 Cast "\\<lbrakk>G\\<turnstile>Norm s0 -e\\<succ>v\\<rightarrow> (x1,s1);
45 x2=raise_if (\\<not> cast_ok G T (heap s1) v) ClassCast x1\\<rbrakk> \\<Longrightarrow>
46 G\\<turnstile>Norm s0 -Cast T e\\<succ>v\\<rightarrow> (x2,s1)"
49 Lit "G\\<turnstile>Norm s -Lit v\\<succ>v\\<rightarrow> Norm s"
51 (* cf. 15.13.1, 15.2 *)
52 LAcc "G\\<turnstile>Norm s -LAcc v\\<succ>the (locals s v)\\<rightarrow> Norm s"
55 LAss "\\<lbrakk>G\\<turnstile>Norm s -e\\<succ>v\\<rightarrow> (x,(h,l));
56 l' = (if x = None then l(va\\<mapsto>v) else l)\\<rbrakk> \\<Longrightarrow>
57 G\\<turnstile>Norm s -va\\<Colon>=e\\<succ>v\\<rightarrow> (x,(h,l'))"
60 (* cf. 15.10.1, 15.2 *)
61 FAcc "\\<lbrakk>G\\<turnstile>Norm s0 -e\\<succ>a'\\<rightarrow> (x1,s1);
62 v = the (snd (the (heap s1 (the_Addr a'))) (fn,T))\\<rbrakk> \\<Longrightarrow>
63 G\\<turnstile>Norm s0 -{T}e..fn\\<succ>v\\<rightarrow> (np a' x1,s1)"
66 FAss "\\<lbrakk>G\\<turnstile> Norm s0 -e1\\<succ>a'\\<rightarrow> (x1,s1); a = the_Addr a';
67 G\\<turnstile>(np a' x1,s1) -e2\\<succ>v \\<rightarrow> (x2,s2);
68 h = heap s2; (c,fs) = the (h a);
69 h' = h(a\\<mapsto>(c,(fs((fn,T)\\<mapsto>v))))\\<rbrakk> \\<Longrightarrow>
70 G\\<turnstile>Norm s0 -{T}e1..fn\\<in>=e2\\<succ>v\\<rightarrow> c_hupd h' (x2,s2)"
72 (* cf. 15.11.4.1, 15.11.4.2, 15.11.4.4, 15.11.4.5, 14.15 *)
73 Call "\\<lbrakk>G\\<turnstile>Norm s0 -e\\<succ>a'\\<rightarrow> s1; a = the_Addr a';
74 G\\<turnstile>s1 -ps[\\<succ>]pvs\\<rightarrow> (x,(h,l)); dynT = fst (the (h a));
75 (md,rT,pns,lvars,blk,res) = the (method (G,dynT) (mn,pTs));
76 G\\<turnstile>(np a' x,(h,(init_vars lvars)(pns[\\<mapsto>]pvs)(This\\<mapsto>a'))) -blk\\<rightarrow> s3;
77 G\\<turnstile> s3 -res\\<succ>v \\<rightarrow> (x4,s4)\\<rbrakk> \\<Longrightarrow>
78 G\\<turnstile>Norm s0 -e..mn({pTs}ps)\\<succ>v\\<rightarrow> (x4,(heap s4,l))"
81 (* evaluation of expression lists *)
84 XcptEs "G\\<turnstile>(Some xc,s) -e[\\<succ>]arbitrary\\<rightarrow> (Some xc,s)"
88 "G\\<turnstile>Norm s0 -[][\\<succ>][]\\<rightarrow> Norm s0"
91 Cons "\\<lbrakk>G\\<turnstile>Norm s0 -e \\<succ> v \\<rightarrow> s1;
92 G\\<turnstile> s1 -es[\\<succ>]vs\\<rightarrow> s2\\<rbrakk> \\<Longrightarrow>
93 G\\<turnstile>Norm s0 -e#es[\\<succ>]v#vs\\<rightarrow> s2"
95 (* execution of statements *)
98 XcptS "G\\<turnstile>(Some xc,s) -s0\\<rightarrow> (Some xc,s)"
101 Skip "G\\<turnstile>Norm s -Skip\\<rightarrow> Norm s"
104 Expr "\\<lbrakk>G\\<turnstile>Norm s0 -e\\<succ>v\\<rightarrow> s1\\<rbrakk> \\<Longrightarrow>
105 G\\<turnstile>Norm s0 -Expr e\\<rightarrow> s1"
108 Comp "\\<lbrakk>G\\<turnstile>Norm s0 -s \\<rightarrow> s1;
109 G\\<turnstile> s1 -t \\<rightarrow> s2\\<rbrakk> \\<Longrightarrow>
110 G\\<turnstile>Norm s0 -(s;; t)\\<rightarrow> s2"
113 Cond "\\<lbrakk>G\\<turnstile>Norm s0 -e \\<succ>v\\<rightarrow> s1;
114 G\\<turnstile> s1 -(if the_Bool v then s else t)\\<rightarrow> s2\\<rbrakk> \\<Longrightarrow>
115 G\\<turnstile>Norm s0 -(If(e) s Else t)\\<rightarrow> s2"
117 (* cf. 14.10, 14.10.1 *)
118 Loop "\\<lbrakk>G\\<turnstile>Norm s0 -(If(e) (s;; While(e) s) Else Skip)\\<rightarrow> s1\\<rbrakk> \\<Longrightarrow>
119 G\\<turnstile>Norm s0 -(While(e) s)\\<rightarrow> s1"