forked from pirapira/eth-isabelle
-
Notifications
You must be signed in to change notification settings - Fork 6
/
Parse.thy
233 lines (202 loc) · 6.67 KB
/
Parse.thy
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
(*
Copyright 2016 Yoichi Hirai
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
theory Parse
imports Main "lem/Evm"
begin
type_synonym "nibble" = "4 word"
type_synonym "byte" = "8 word"
datatype parse_byte_result =
Complete inst
| Incomplete nat
abbreviation "push n ==
Incomplete n"
definition parse_byte :: "byte \<Rightarrow> parse_byte_result"
where
"parse_byte =
(\<lambda> b. Complete (Unknown b))
( 0x00 := Complete (Misc STOP)
, 0x01 := Complete (Arith ADD)
, 0x02 := Complete (Arith MUL)
, 0x03 := Complete (Arith SUB)
, 0x04 := Complete (Arith DIV)
, 0x05 := Complete (Sarith SDIV)
, 0x06 := Complete (Arith MOD)
, 0x07 := Complete (Sarith SMOD)
, 0x08 := Complete (Arith ADDMOD)
, 0x09 := Complete (Arith MULMOD)
, 0x0a := Complete (Arith EXP)
, 0x0b := Complete (Sarith SIGNEXTEND)
, 0x10 := Complete (Arith inst_LT)
, 0x11 := Complete (Arith inst_GT)
, 0x12 := Complete (Sarith SLT)
, 0x13 := Complete (Sarith SGT)
, 0x14 := Complete (Arith inst_EQ)
, 0x15 := Complete (Arith ISZERO)
, 0x16 := Complete (Bits inst_AND)
, 0x17 := Complete (Bits inst_OR)
, 0x18 := Complete (Bits inst_XOR)
, 0x19 := Complete (Bits inst_NOT)
, 0x1a := Complete (Bits BYTE)
, 0x20 := Complete (Arith SHA3)
, 0x30 := Complete (Info ADDRESS)
, 0x31 := Complete (Info BALANCE)
, 0x32 := Complete (Info ORIGIN)
, 0x33 := Complete (Info CALLER)
, 0x34 := Complete (Info CALLVALUE)
, 0x35 := Complete (Stack CALLDATALOAD)
, 0x36 := Complete (Info CALLDATASIZE)
, 0x37 := Complete (Memory CALLDATACOPY)
, 0x38 := Complete (Info CODESIZE)
, 0x39 := Complete (Memory CODECOPY)
, 0x3a := Complete (Info GASPRICE)
, 0x3b := Complete (Info EXTCODESIZE)
, 0x3c := Complete (Memory EXTCODECOPY)
, 0x40 := Complete (Info BLOCKHASH)
, 0x41 := Complete (Info COINBASE)
, 0x42 := Complete (Info TIMESTAMP)
, 0x43 := Complete (Info NUMBER)
, 0x44 := Complete (Info DIFFICULTY)
, 0x45 := Complete (Info GASLIMIT)
, 0x50 := Complete (Stack POP)
, 0x51 := Complete (Memory MLOAD)
, 0x52 := Complete (Memory MSTORE)
, 0x53 := Complete (Memory MSTORE8)
, 0x54 := Complete (Storage SLOAD)
, 0x55 := Complete (Storage SSTORE)
, 0x56 := Complete (Pc JUMP)
, 0x57 := Complete (Pc JUMPI)
, 0x58 := Complete (Pc PC)
, 0x59 := Complete (Memory MSIZE)
, 0x5a := Complete (Info GAS)
, 0x5b := Complete (Pc JUMPDEST)
, 0x60 := push 1
, 0x61 := push 2
, 0x62 := push 3
, 0x63 := push 4
, 0x64 := push 5
, 0x65 := push 6
, 0x66 := push 7
, 0x67 := push 8
, 0x68 := push 9
, 0x69 := push 10
, 0x6a := push 11
, 0x6b := push 12
, 0x6c := push 13
, 0x6d := push 14
, 0x6e := push 15
, 0x6f := push 16
, 0x70 := push 17
, 0x71 := push 18
, 0x72 := push 19
, 0x73 := push 20
, 0x74 := push 21
, 0x75 := push 22
, 0x76 := push 23
, 0x77 := push 24
, 0x78 := push 25
, 0x79 := push 26
, 0x7a := push 27
, 0x7b := push 28
, 0x7c := push 29
, 0x7d := push 30
, 0x7e := push 31
, 0x7f := push 32
, 0x80 := Complete (Dup 0)
, 0x81 := Complete (Dup 1)
, 0x82 := Complete (Dup 2)
, 0x83 := Complete (Dup 3)
, 0x84 := Complete (Dup 4)
, 0x85 := Complete (Dup 5)
, 0x86 := Complete (Dup 6)
, 0x87 := Complete (Dup 7)
, 0x88 := Complete (Dup 8)
, 0x89 := Complete (Dup 9)
, 0x8a := Complete (Dup 10)
, 0x8b := Complete (Dup 11)
, 0x8c := Complete (Dup 12)
, 0x8d := Complete (Dup 13)
, 0x8e := Complete (Dup 14)
, 0x8f := Complete (Dup 15)
, 0x90 := Complete (Swap 0)
, 0x91 := Complete (Swap 1)
, 0x92 := Complete (Swap 2)
, 0x93 := Complete (Swap 3)
, 0x94 := Complete (Swap 4)
, 0x95 := Complete (Swap 5)
, 0x96 := Complete (Swap 6)
, 0x97 := Complete (Swap 7)
, 0x98 := Complete (Swap 8)
, 0x99 := Complete (Swap 9)
, 0x9a := Complete (Swap 10)
, 0x9b := Complete (Swap 11)
, 0x9c := Complete (Swap 12)
, 0x9d := Complete (Swap 13)
, 0x9e := Complete (Swap 14)
, 0x9f := Complete (Swap 15)
, 0xa0 := Complete (Log LOG0)
, 0xa1 := Complete (Log LOG1)
, 0xa2 := Complete (Log LOG2)
, 0xa3 := Complete (Log LOG3)
, 0xa4 := Complete (Log LOG4)
, 0xf0 := Complete (Misc CREATE)
, 0xf1 := Complete (Misc CALL)
, 0xf2 := Complete (Misc CALLCODE)
, 0xf3 := Complete (Misc RETURN)
, 0xf4 := Complete (Misc DELEGATECALL)
, 0xff := Complete (Misc SUICIDE)
)"
value "parse_byte 0xa8"
(* Now, need to parse a sequence of bytes.
When you meet Incomplete, you have to make sure that the
result is shorter.
*)
fun parse_bytes :: "byte list \<Rightarrow> inst list" where
"parse_bytes [] = []"
| "parse_bytes (b # rest) =
(case parse_byte b of
Complete i \<Rightarrow>
i # (parse_bytes rest)
| Incomplete n \<Rightarrow> (* TODO: maybe do a pattern match on n and rest to make it faster *)
(Stack (PUSH_N (take n rest ))) # (parse_bytes (drop n rest))
)"
declare parse_bytes.simps [simp]
value "parse_bytes [0x60, 0x60, 0x60, 0x40]"
text "I still want to parse something like 0x6060604052604051"
text "How do I do that?"
text "Maybe Isabelle/HOL has some string literals."
value "''foobar'' ! 1 :: char"
definition byte_of_char :: "char \<Rightarrow> byte"
where
"byte_of_char c = of_nat (String.of_char c)"
declare byte_of_char_def [simp]
definition integer_of_hex_char :: "char \<Rightarrow> integer"
where
"integer_of_hex_char c =
(if integer_of_char c \<ge> 48 \<and> integer_of_char c < 58 then
integer_of_char c - 48
else if integer_of_char c \<ge> 97 \<and> integer_of_char c < 103 then
integer_of_char c - 87
else 0
)"
declare integer_of_hex_char_def [simp]
value "integer_of_hex_char (CHR ''0'')"
fun bytes_of_hex_content :: "char list \<Rightarrow> byte list"
where
"bytes_of_hex_content [] = []" |
"bytes_of_hex_content (m # n # rest) = (word_of_int (int_of_integer ((integer_of_hex_char m) * 16 + integer_of_hex_char n)) # bytes_of_hex_content rest)"
abbreviation parse_bytecode :: "char list \<Rightarrow> inst list" where
"parse_bytecode c == parse_bytes (bytes_of_hex_content c)"
value "parse_byte 111"
value "parse_bytes [111, 200, 75, 166, 188, 149, 72, 64, 8, 246, 54, 47, 147, 22, 14, 243, 229, 99]"
value "parse_bytecode ''6060604052600035900463ffffffff168063dffeadd014603a575b5b34156041575b6047''"
end