-
Notifications
You must be signed in to change notification settings - Fork 1
/
bitml_test.maude
166 lines (140 loc) · 5.92 KB
/
bitml_test.maude
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
***
*** Depends on full-maude, that is not supported by maude+strat alpha version
***
load /usr/share/maude/full-maude.maude
load /home/nicola/repositories/bitml-maude/bitml.maude
load /home/nicola/repositories/MUnit/mUnit.maude
(munit BITML-CHECK-TEST is
***
*** assertEqual(t, t')
***
*** passes if both t and t' are reduced to the same normal form by means of equations.
***
***
*** assertDifferent(t, t')
***
*** passes if the normal forms of t and t' are different.
***
***
*** assertTrue(t)
***
*** passes if the normal form of t is true.
***
***
*** assertFalse(t)
***
*** passes if the normal form of t is false.
***
***
*** assertReachable(t, t')
***
*** passes if t' is reachable from t within an unbounded number of steps.
***
***
*** assertReachableBnd(t, t', bnd)
***
*** passes if t' is reachable from t within bnd steps.
***
***
*** hasSolution(t, pat, mode, bound, cond)}
***
*** passes when there exists at least one reachable term that, starting from t, matches the pattern pat and
*** fulfills the condition cond in at most bound (either unbounded or a natural number) steps. The mode can
*** be either *, for 0 or more steps; +, for 1 or more steps; and !, for final states.
***
***
*** noSolution(t, pat, mode, bound, cond)
***
*** passes when no reachable solution was expected from t, matching the pattern pat and fulfilling the condition cond in at most bound.
***
*** fresh(_)
assertEqual(fresh(empty), 'x0)
assertEqual(fresh('x0), 'x1)
assertEqual(fresh('x0,'x1), 'x2)
assertEqual(fresh('x1), 'x0)
assertEqual(fresh('x1,'x2), 'x0)
*** fresh(_,_)
assertEqual(fresh(empty,3), 'x0, 'x1, 'x2)
assertEqual(fresh(('x1, 'x2),3), 'x0, 'x3, 'x4)
assertEqual(tau . 0, put empty reveal empty if True . 0)
assertEqual(put x . 0, put x reveal empty if True . 0)
assertEqual(put x if p . 0, put x reveal empty if p . 0)
assertEqual(reveal a . 0, put empty reveal a if True . 0)
assertEqual(reveal a if p . 0, put empty reveal a if p . 0)
assertEqual(put x reveal a . 0, put x reveal a if True . 0)
*** $eval e [S]
assertEqual($eval const(42) [S:Configuration], Success(42))
assertEqual($eval const(42) + const(1) [S:Configuration], Success(43))
assertEqual($eval | ref(a:Secret) | [ A:Participant : a:Secret # 10 | S:Configuration], Success(10))
assertEqual($eval | ref(a:Secret) | [{A:Participant : a:Secret # 10} | S:Configuration], Failure("Unable to evaluate the expression"))
assertEqual(after 0 : D, D)
assertEqual(after 5 : after 10 : D, after 10 : D)
assertEqual(A : A : D, A : D)
assertEqual(A : B : D, (A, B) : D)
assertEqual(A : B : A : D, (A, B) : D)
assertEqual((B, A) : D, (A, B) : D)
assertEqual(names in (< 0 , v > x | < 0 , v > y) , (x, y) )
assertEqual(ticks( < after 10 : tau . after 5 : tau . 0 , v > x ), (5 10) )
assertEqual(toSemConf (< 0 , v > x | < 0 , v > y) , [0 | nil | x,y] (< 0 , v > x | < 0 , v > y) )
assertEqual( (< (A, B) : D, v > x), < (A, B) : D, v > x )
*** auth-destroy
assertReachableBnd((toSemConf < A, v > x), ({A authorize-destroy-of x} (ctx:Context < A, v > x | A[ x |># ])), 1)
*** destroy
assertReachableBnd( (toSemConf < A, v > x), ({destroy x} ctx:Context 0), 3)
*** split
assertReachableBnd(
(toSemConf < split(v' ~> (withdraw A) v'' ~> (withdraw B)), v > x),
({split x} [t:Nat | t^:List{Nat<} | x, 'x0, 'x1] < withdraw A, v' > 'x0 | < withdraw B, v'' > 'x1),
2)
*** put
assertReachableBnd(
(toSemConf < put y . 0, v > x | < A, v' > y),
({put(y,empty,x)} [t:Nat | t^:List{Nat<} | x, y, 'x0] < 0, v > 'x0),
1)
*** reveal
assertReachableBnd(
(toSemConf < reveal a . 0, v > x | (A : a # N) ),
({put(empty,a,x)} [t:Nat | t^:List{Nat<} | x, 'x0] < 0, v > 'x0 | (A : a # N)),
1)
*** withdraw
assertReachableBnd(
(toSemConf < withdraw A, v > x),
({A withdraw v from x} [t:Nat | t^:List{Nat<} | x, 'x0] < A, v > 'x0),
1)
*** sum
assertReachableBnd(
(toSemConf < withdraw A + withdraw B, v > x),
({A withdraw v from x} [t:Nat | t^:List{Nat<} | x, 'x0] < A, v > 'x0),
1)
assertReachableBnd(
(toSemConf < withdraw A + withdraw B, v > x),
({B withdraw v from x} [t:Nat | t^:List{Nat<} | x, 'x0] < B, v > 'x0),
1)
assertReachable(
(toSemConf < tau . withdraw A + tau . withdraw B, v > x),
{put(empty,empty,x)} [t:Nat | t^:List{Nat<} | x, 'x0] < withdraw A, v > 'x0) *** choose first tau
assertReachable(
(toSemConf < tau . withdraw A + tau . withdraw B, v > x),
{put(empty,empty,x)} [t:Nat | t^:List{Nat<} | x, 'x0] < withdraw B, v > 'x0) *** choose second tau
assertReachable(
(toSemConf < tau . withdraw A + tau . withdraw B, v > x),
{A withdraw v from 'x0} [t:Nat | t^:List{Nat<} | x, 'x0, 'x1] < A, v > 'x1)
assertReachable(
(toSemConf < tau . withdraw A + tau . withdraw B, v > x),
{B withdraw v from 'x0} [t:Nat | t^:List{Nat<} | x, 'x0, 'x1] < B, v > 'x1)
assertReachable(
(toSemConf < withdraw A + withdraw B, v > x),
{A withdraw v from x} [t:Nat | t^:List{Nat<} | x, 'x0] < A, v > 'x0)
assertReachable(
(toSemConf < withdraw A + withdraw B, v > x),
{B withdraw v from x} [t:Nat | t^:List{Nat<} | x, 'x0] < B, v > 'x0)
assertReachable(
(toSemConf < A : withdraw B, v > x),
{A authorize withdraw B in x} [t:Nat | t^:List{Nat<} | x] < A : withdraw B, v > x | A [ x |> A : withdraw B ])
assertReachable(
(toSemConf < A : withdraw B, v > x),
{B withdraw v from x} [t:Nat | t^:List{Nat<} | x, 'x0] < B, v > 'x0)
assertReachable(
(toSemConf < A : withdraw B, v > x),
{destroy 'x0} [t:Nat | t^:List{Nat<} | x, 'x0] 0)
endu)