Common — library smtlib-low-level-theory.theory — module Zbit
1
module Zbit
2
use int.Int
3
4
predicate
bittest
(x i:int)
5
6
axiom
prop_bittest
: forall x i. i < 0 -> not (bittest x i)
7
axiom
ext_bittest
: forall x y. (forall i. i >= 0 -> bittest x i = bittest y i) -> x = y
8
axiom
even_bittest
: forall x i. 0 <= i -> (bittest (2*x) i) =
9
if i = 0 then False else bittest x (i-1)
10
axiom
bittest_0
: forall i. 0 <= i -> not (bittest 0 i)
11
axiom
bittest_minus_1
: forall i. 0 <= i -> (bittest (-1) i)
12
axiom
odd_bittest
: forall x i. 0 <= i -> (bittest (2*x+1) i) =
13
if i = 0 then True else bittest x (i-1)
14
15
function
land
(x y:int) : int
16
17
axiom
def_land
: forall x y. forall i. i >= 0 -> (bittest x i /\ bittest y i) = (bittest (land x y) i)
18
19
function
lor
(x y:int) : int
20
21
axiom
def_lor
: forall x y. forall i. i >= 0 -> (bittest x i \/ bittest y i) = (bittest (lor x y) i)
22
23
function
lxor
(x y:int) : int
24
25
axiom
def_lxor
: forall x y. forall i. i >= 0 -> (not (bittest x i = bittest y i)) = (bittest (lxor x y) i)
26
27
function
lnot
(x:int) : int
28
29
axiom
def_lnot
: forall x. forall i. i >= 0 -> bittest x i = (not (bittest (lnot x) i))
30
31
function
asr
(x offset:int) : int
32
function
asl
(x offset:int) : int
33
34
axiom
def_asr
: forall x offset. forall i. i >= 0 -> bittest x (i+offset) = (bittest (asr x offset) i)
35
axiom
def_asl
: forall x offset. forall i. i >= 0 -> bittest x (i-offset) = (bittest (asl x offset) i)
36
37
function
extract
(x pos len:int) : int
38
function
signed_extract
(x pos len:int) : int
39
function
update
(dst pos len src:int) : int
40
41
axiom
def_extract
: forall x pos len.
42
forall i. i >= 0 ->
43
bittest (extract x pos len) i = (if i < len then bittest x (pos+i) else false)
44
45
axiom
def_signed_extract
: forall x pos len.
46
forall i. i >= 0 ->
47
bittest (signed_extract x pos len) i =
48
(if i < len then bittest x (pos+i) else if len <= 0 then false else bittest x (pos+len-1))
49
50
axiom
def_update
: forall dst src pos len. forall i. i>= 0 ->
51
bittest (update dst pos len src) i =
52
(if pos <= i < pos + len then bittest src (i-pos) else bittest dst i)
53
54
55
end