-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy paththeories-FixedSizeBitVectors.shtml
381 lines (288 loc) · 11.9 KB
/
theories-FixedSizeBitVectors.shtml
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
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<!--
Design by http://www.bluewebtemplates.com
Released for free under a Creative Commons Attribution 3.0 License
-->
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<title>SMT-LIB The Satisfiability Modulo Theories Library</title>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />
<link href="style.css" rel="stylesheet" type="text/css" />
<!-- CuFon: Enables smooth pretty custom font rendering. 100% SEO friendly. To disable, remove this section -->
<script type="text/javascript" src="js/cufon-yui.js"></script>
<script type="text/javascript" src="js/arial.js"></script>
<script type="text/javascript" src="js/cuf_run.js"></script>
<!-- CuFon ends -->
<link href="code-prettify/prettify.css" type="text/css" rel="stylesheet" />
<script src="code-prettify/run_prettify.js?lang=smtlib&skin=desert"></script>
</head>
<body>
<div class="main">
<div class="header">
<div class="header_resize">
<div class="menu_nav">
<ul>
<li><a href="index.shtml">Home</a></li>
<li><a href="about.shtml">About</a></li>
<li><a href="news.shtml">News</a></li>
<li class="active"><a href="standard.shtml">Standard</a></li>
<li><a href="benchmarks.shtml">Benchmarks</a></li>
<li><a href="software.shtml">Software</a></li>
<li><a href="credits.shtml">Credits</a></li>
</ul>
</div>
<div class="clr"></div>
<div class="logo">
<h1><a href="index.shtml">SMT-LIB <br/>
<small>The Satisfiability Modulo Theories Library</small></a>
</h1>
</div>
</div>
</div>
<div class="content">
<div class="content_resize">
<div class="mainbar">
<h2>FixedSizeBitVectors</h2>
<pre class="prettyprint lang-smtlib">
(theory FixedSizeBitVectors
:smt-lib-version 2.7
:smt-lib-release "2024-07-21"
:written-by "Clark Barrett, Pascal Fontaine, Silvio Ranise, and Cesare Tinelli"
:date "2010-05-02"
:last-updated "2024-07-21"
:update-history
"Note: history only accounts for content changes, not release changes.
2024-07-21 Updated to Version 2.7.
2024-07-16 Added conversion operators between bitvectors and integers
2024-07-14 Fixed minor typos
2023-11-29 Added bvnego bvuaddo bvsaddo bvumulo bvsmulo
2020-05-20 Fixed minor typo
2017-06-13 Added :left-assoc attribute to bvand, bvor, bvadd, bvmul
2017-05-03 Updated to version 2.6; changed semantics of division and
remainder operators.
2016-04-20 Minor formatting of notes fields.
2015-04-25 Updated to Version 2.5.
2013-06-24 Renamed theory's name from Fixed_Size_Bit_Vectors to FixedSizeBitVectors,
for consistency.
Added :value attribute.
"
:notes
"This theory declaration defines a core theory for fixed-size bitvectors
where the operations of concatenation and extraction of bitvectors as well
as the usual logical and arithmetic operations are overloaded.
"
:sorts_description "
All sort symbols of the form (_ BitVec m)
where m is a numeral greater than 0.
"
; Bitvector literals
:funs_description "
All binaries #bX of sort (_ BitVec m) where m is the number of digits in X.
All hexadeximals #xX of sort (_ BitVec m) where m is 4 times the number of
digits in X.
"
:funs_description "
All function symbols with declaration of the form
(concat (_ BitVec i) (_ BitVec j) (_ BitVec m))
where
- i, j, m are numerals
- i > 0, j > 0
- i + j = m
"
:funs_description "
All function symbols with declaration of the form
((_ extract i j) (_ BitVec m) (_ BitVec n))
where
- i, j, m, n are numerals
- m > i ≥ j ≥ 0,
- n = i - j + 1
"
:funs_description "
All function symbols with declaration of the form
(op1 (_ BitVec m) (_ BitVec m))
or
(op2 (_ BitVec m) (_ BitVec m) (_ BitVec m))
where
- op1 is from {bvnot, bvneg}
- op2 is from {bvand, bvor, bvadd, bvmul, bvudiv, bvurem, bvshl, bvlshr}
- m is a numeral greater than 0
The operators in {bvand, bvor, bvadd, bvmul} have the :left-assoc attribute.
"
:funs_description "
All function symbols with declaration of the form
(bvult (_ BitVec m) (_ BitVec m) Bool)
where
- m is a numeral greater than 0
"
:definition
"For every expanded signature Sigma, the instance of FixedSizeBitVectors
with that signature is the theory consisting of all Sigma-models that
satisfy the constraints detailed below.
The sort (_ BitVec m), for m > 0, is the set of finite functions
whose domain is the initial segment [0, m) of the naturals, starting at
0 (included) and ending at m (excluded), and whose co-domain is {0, 1}.
To define some of the semantics below, we need the following additional
functions :
o div and mod, binary infix functions on integers defined as the
interpretations of the corresponding operators in the Ints theory,
i.e., the operators satisfying:
(forall ((m Int) (n Int))
(=> (distinct n 0)
(let ((q (div m n)) (r (mod m n)))
(and (= m (+ (* n q) r))
(<= 0 r (- (abs n) 1))))))
Note that an important consequence of the above definition is that
for n > 0, m mod n is always in the range [0, n).
o bv2nat, which takes a bitvector b: [0, m) → {0, 1}
with 0 < m, and returns an integer in the range [0, 2^m),
and is defined as follows:
bv2nat(b) := b(m-1)*2^{m-1} + b(m-2)*2^{m-2} + ⋯ + b(0)*2^0
o bv2int, which takes a bitvector b: [0, m) → {0, 1}
with 0 < m, and returns an integer in the range [- 2^(m - 1), 2^(m - 1)),
and is defined as follows:
bv2int(b) := if b(m-1) = 0 then bv2nat(b) else bv2nat(b) - 2^m
o nat2bv[m], with 0 < m, which takes a non-negative integer and returns the (unique) bitvector
b: [0, m) -> {0, 1} such that:
b(m-1)*2^{m-1} + ⋯ + b(0)*2^0 = n mod 2^m
o int2bv[m], with 0 < m, which takes an integer n and returns the (unique) bitvector
b: [0, m) -> {0, 1} such that:
b(m-1)*2^{m-1} + ⋯ + b(0)*2^0 = (n + 2^m) mod 2^m
The semantic interpretation [[_]] of well-sorted BitVec-terms is
inductively defined as follows.
- Variables
If v is a variable of sort (_ BitVec m) with 0 < m, then
[[v]] is some element of {[0, m) → {0, 1}}, the set of total
functions from [0, m) to {0, 1}.
- Constant symbols
The constant symbols #b0 and #b1 of sort (_ BitVec 1) are defined as follows
[[#b0]] := λx:[0, 1). 0
[[#b1]] := λx:[0, 1). 1
More generally, given a string #b followed by a sequence of 0's and 1's,
if n is the numeral represented in base 2 by the sequence of 0's and 1's
and m is the length of the sequence, then the term represents
nat2bv[m](n).
The string #x followed by a sequence of digits and/or letters from A to
F is interpreted similarly: if n is the numeral represented in hexadecimal
(base 16) by the sequence of digits and letters from A to F and m is four
times the length of the sequence, then the term represents nat2bv[m](n).
For example, #xFF is equivalent to #b11111111.
- Function symbols for concatenation
[[(concat s t)]] := λx:[0, n+m). if (x < m) then [[t]](x) else [[s]](x - m)
where
s and t are terms of sort (_ BitVec n) and (_ BitVec m), respectively,
0 < n, 0 < m.
- Function symbols for extraction
[[((_ extract i j) s))]] := λx:[0, i-j+1). [[s]](j + x)
where s is of sort (_ BitVec l), 0 ≤ j ≤ i < l.
- Bit-wise operations
[[(bvnot s)]] := λx:[0, m). if [[s]](x) = 0 then 1 else 0
[[(bvand s t)]] := λx:[0, m). if [[s]](x) = 0 then 0 else [[t]](x)
[[(bvor s t)]] := λx:[0, m). if [[s]](x) = 1 then 1 else [[t]](x)
where s and t are both of sort (_ BitVec m) and 0 < m.
- Arithmetic operations
Now, we can define the following operations. Suppose s and t are both terms
of sort (_ BitVec m), m > 0.
[[(bvneg s)]] := nat2bv[m](2^m - bv2nat([[s]]))
[[(bvadd s t)]] := nat2bv[m](bv2nat([[s]]) + bv2nat([[t]]))
[[(bvmul s t)]] := nat2bv[m](bv2nat([[s]]) * bv2nat([[t]]))
[[(bvudiv s t)]] := if bv2nat([[t]]) = 0
then λx:[0, m). 1
else nat2bv[m](bv2nat([[s]]) div bv2nat([[t]]))
[[(bvurem s t)]] := if bv2nat([[t]]) = 0
then [[s]]
else nat2bv[m](bv2nat([[s]]) mod bv2nat([[t]]))
We also define the following predicates
[[(bvnego s)]] := bv2int([[s]]) == -2^(m - 1)
[[(bvuaddo s t)]] := (bv2nat([[s]]) + bv2nat([[t]])) >= 2^m
[[(bvsaddo s t)]] := (bv2int([[s]]) + bv2int([[t]])) >= 2^(m - 1) or
(bv2int([[s]]) + bv2int([[t]])) < -2^(m - 1)
[[(bvumulo s t)]] := (bv2nat([[s]]) * bv2nat([[t]])) >= 2^m
[[(bvsmulo s t)]] := (bv2int([[s]]) * bv2int([[t]])) >= 2^(m - 1) or
(bv2int([[s]]) * bv2int([[t]])) < -2^(m - 1)
- Shift operations
Suppose s and t are both terms of sort (_ BitVec m), m > 0. We make use of
the definitions given for the arithmetic operations, above.
[[(bvshl s t)]] := nat2bv[m](bv2nat([[s]]) * 2^(bv2nat([[t]])))
[[(bvlshr s t)]] := nat2bv[m](bv2nat([[s]]) div 2^(bv2nat([[t]])))
Finally, we can define bvult:
[[bvult s t]] := true iff bv2nat([[s]]) < bv2nat([[t]])
If the Ints theory is also present, let [[_]] be extended to additionally
interpret terms of sort Int. For operations in that theory, [[_]]
interprets them according to the semantics defined there. We further define:
[[(bv2nat b)]] := bv2nat([[b]])
[[(bv2int b)]] := bv2int([[b]])
[[(_ nat2bv M) N]] := nat2bv[[[M]]]([[N]])
[[(_ int2bv M) N]] := int2bv[[[M]]]([[N]]),
where M and N are terms of sort Int.
"
:values
"For all m > 0, the values of sort (_ BitVec m) are all binaries #bX with m digits.
"
:notes
"After extensive discussion, it was decided to fix the value of
(bvudiv s t) and (bvurem s t) in the case when bv2nat([[t]]) is 0.
While this solution is not preferred by all users, it has the
advantage that it simplifies solver implementations. Furthermore,
it is straightforward for users to use alternative semantics by
defining their own version of these operators (using define-fun) and
using ite to insert their own semantics when the second operand is
0.
"
)
</pre>
(<a href="Theories/FixedSizeBitVectors.smt2">raw file</a>)
<br>
<br>
</div>
<div class="sidebar">
<div class="gadget">
<ul class="sb_menu">
<li><a href="index.shtml">Home</a></li>
<li><a href="about.shtml">About</a></li>
<li><a href="news.shtml">News</a></li>
<li>Standard
<ul class="ex_menu">
<li><a href="language.shtml">Language</a>
<li><a href="theories.shtml">Theories</a>
<li><a href="logics.shtml">Logics</a>
<li><a href="examples.shtml">Examples</a>
</ul>
</li>
<li><a href="benchmarks.shtml">Benchmarks</a></li>
<li>Software
<ul class="ex_menu">
<li><a href="solvers.shtml">Solvers</a></li>
<li><a href="utilities.shtml">Utilities</a></li>
</ul>
</li>
<li><a href="contact.shtml">Contact</a></li>
<li><a href="related.shtml">Related</a></li>
<li><a href="credits.shtml">Credits</a></li>
</ul>
</div>
</div>
</div>
</div>
<div class="clr"></div>
<div class="footer">
<div class="footer_resize">
<p class="lf">
© Copyright The SMT-LIB Initiative <br>
Based on a design by
Blue <a href="http://www.bluewebtemplates.com">Web Templates</a>
</p>
<ul class="fmenu">
<li><a href="index.shtml">Home</a></li>
<li><a href="about.shtml">About</a></li>
<li><a href="news.shtml">News</a></li>
<li class="active"><a href="standard.shtml">Standard</a></li>
<li><a href="benchmarks.shtml">Benchmarks</a></li>
<li><a href="software.shtml">Software</a></li>
<li><a href="credits.shtml">Credits</a></li>
</ul>
<div class="clr"></div>
</div>
</div>
</div>
</body>
</html>