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
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
|
//Should not verify, as ghost loops should not be allowed to diverge.
method GhostDivergentLoop()
{
var a := new int [2];
a[0] := 1;
a[1] := -1;
ghost var i := 0;
while (i < 2)
decreases *; // error: not allowed on a ghost loop
invariant i <= 2;
invariant (forall j :: 0 <= j && j < i ==> a[j] > 0);
{
i := 0;
}
assert a[1] != a[1]; // ...for then this would incorrectly verify
}
method ManyIndices<T>(a: array3<T>, b: array<T>, m: int, n: int)
{
// the following invalid expressions were once incorrectly resolved:
var x := a[m, n]; // error
var y := a[m]; // error
var z := b[m, n, m, n]; // error
}
method SB(b: array2<int>, s: int) returns (x: int, y: int)
requires b != null;
{
while
{
case b[x,y] == s =>
}
}
// -------- name resolution
class Global {
var X: int;
function method F(x: int): int { x }
static function method G(x: int): int { x }
method M(x: int) returns (r: int)
{
r := x + X;
}
static method N(x: int) returns (r: int)
{
r := x + X; // error: cannot access instance field X from static method
}
}
method TestNameResolution0() {
var z: int;
z := Global.X; // error: X is an instance field
z := F(2); // error: cannot resolve F
z := Global.F(2); // error: invocation of instance function requires an instance
z := G(2); // error: cannot resolve G
z := Global.G(2);
z := M(2); // error: cannot resolve M
z := Global.M(2); // error: call to instance method requires an instance
z := N(1); // error: cannot resolve N
z := Global.N(1);
z := z(5); // error: using local as if it were a function
z := Global.z; // error: class Global does not have a member z
var Global: Global; // a local variable with the name 'Global'
z := Global.X; // this means the instance field X of the object stored in the local variable 'Global'
var gg: Global := null;
var y := gg.G(5);
y := gg.N(5);
}
datatype Abc = Abel | Benny | Cecilia(y: int) | David(x: int) | Eleanor;
datatype Xyz = Alberta | Benny | Constantine(y: int) | David(x: int);
datatype Rst = David(x: int, y: int);
function Tuv(arg0: Abc, arg1: bool): int { 10 }
var Eleanor: bool;
method TestNameResolution1() {
var a0 := Abel;
var a1 := Alberta;
var b0 := Benny; // error: there's more than one constructor with the name Benny; needs qualification
var b1 := Abc.Benny;
var b2 := Xyz.Benny;
var Benny := 15; // introduce a local variable with the name 'Benny'
var b3 := Benny;
var d0 := David(20); // error: constructor name David is ambiguous
var d1 := David; // error: constructor name David is ambiguous (never mind that the signature does
// not match either of them)
var d2 := David(20, 40); // error: constructor name Davis is ambiguous (never mind that the given
// parameters match the signature of only one of those constructors)
var d3 := Abc.David(20, 40); // error: wrong number of parameters
var d4 := Rst.David(20, 40);
var e := Eleanor;
assert Tuv(e, this.Eleanor) == 10;
}
// --------------- ghost tests -------------------------------------
datatype GhostDt =
Nil(ghost extraInfo: int) |
Cons(data: int, tail: GhostDt, ghost moreInfo: int);
class GhostTests {
method M(dt: GhostDt) returns (r: int) {
ghost var g := 5;
r := g; // error: RHS is ghost, LHS is not
r := F(18, g); // error: RHS is a ghost and will not be available at run time
r := G(20, g); // it's fine to pass a ghost as a parameter to a non-ghost, because
// only the ghost goes away during compilation
r := N(22, g); // ditto
r := N(g, 22); // error: passing in 'g' as non-ghost parameter
r := P(24, 22); // error: 'P' is ghost, but its result is assigned to a non-ghost
match (dt) {
case Nil(gg) =>
case Cons(dd, tt, gg) =>
r := G(dd, dd); // fine
r := G(dd, gg); // fine
r := G(gg, gg); // error: cannot pass ghost 'gg' as non-ghost parameter to 'G'
}
var dd;
dd := GhostDt.Nil(g); // fine
dd := GhostDt.Cons(g, dt, 2); // error: cannot pass 'g' as non-ghost parameter
ghost var dtg := GhostDt.Cons(g, dt, 2); // fine, since result is ghost
}
function F(x: int, y: int): int {
y
}
function method G(x: int, ghost y: int): int {
y // error: cannot return a ghost from a non-ghost function
}
function method H(dt: GhostDt): int {
match dt
case Nil(gg) => gg // error: cannot return a ghost from a non-ghost function
case Cons(dd, tt, gg) => dd + gg // error: ditto
}
method N(x: int, ghost y: int) returns (r: int) {
r := x;
}
ghost method P(x: int, y: int) returns (r: int) {
ghost var g := 5;
r := y; // allowed, since the entire method is ghost
r := r + g; // fine, for the same reason
r := N(20, 20); // error: call to non-ghost method from ghost method is not okay
}
ghost method NiceTry()
ensures false;
{
while (true)
decreases *; // error: not allowed in ghost context
{
}
}
ghost method BreaksAreFineHere(t: int)
{
var n := 0;
ghost var k := 0;
while (true)
invariant n <= 112;
decreases 112 - n;
{
label MyStructure: {
if (k % 17 == 0) { break MyStructure; } // this is fine, because it's a ghost method
k := k + 1;
}
label MyOtherStructure:
if (k % 17 == 0) {
break MyOtherStructure;
} else {
k := k + 1;
}
if (n == 112) {
break;
} else if (n == t) {
return;
}
n := n + 1;
}
}
method BreakMayNotBeFineHere(ghost t: int)
{
var n := 0;
ghost var k := 0;
var p := 0;
while (true)
invariant n <= 112;
decreases 112 - n;
{
label MyStructure: {
if (k % 17 == 0) { break MyStructure; } // error: break from ghost to non-ghost point
k := k + 1;
}
label MyOtherStructure:
if (k % 17 == 0) {
break MyOtherStructure; // this break is fine
} else {
k := k + 1;
}
var dontKnow;
if (n == 112) {
ghost var m := 0;
label LoopLabel0:
label LoopLabel1:
while (m < 200) {
if (m % 103 == 0) {
if {
case true => break; // fine, since this breaks out of the enclosing ghost loop
case true => break LoopLabel0; // fine
case true => break LoopLabel1; // fine
}
} else if (m % 101 == 0) {
break break; // error: break out of non-ghost loop from ghost context
}
m := m + 3;
}
break;
} else if (dontKnow == 708) {
var q := 0;
while (q < 1) {
label IfNest:
if (p == 67) {
break break; // fine, since this is not a ghost context
} else if (*) {
break break break; // error: tries to break out of more loop levels than there are
} else if (*) {
break break; // fine, since this is not a ghost context
} else if (k == 67) {
break break; // error, because this is a ghost context
}
q := q + 1;
}
} else if (n == t) {
return; // error: this is a ghost context trying to return from a non-ghost method
}
n := n + 1;
p := p + 1;
}
}
}
method DuplicateLabels(n: int) {
var x;
if (n < 7) {
label DuplicateLabel: x := x + 1;
} else {
label DuplicateLabel: x := x + 1;
}
label DuplicateLabel: x := x + 1;
label DuplicateLabel: {
label AnotherLabel:
label DuplicateLabel: // error: duplicate label
label OneMoreTime:
x := x + 1;
}
label DuplicateLabel:
label DuplicateLabel: // error: duplicate label
x := x + 1;
label DuplicateLabel: x := x + 1;
}
// --------------- constructors -------------------------------------
class ClassWithConstructor {
var y: int;
method NotTheOne() { }
constructor InitA() { }
constructor InitB() modifies this; { y := 20; }
}
class ClassWithoutConstructor {
method Init() modifies this; { }
}
method ConstructorTests()
{
var o := new object; // fine: does not have any constructors
o := new ClassWithoutConstructor; // fine: don't need to call anything particular method
o := new ClassWithoutConstructor.Init(); // this is also fine
var c := new ClassWithConstructor.InitA();
c := new ClassWithConstructor; // error: must call a constructor
c := new ClassWithConstructor.NotTheOne(); // error: must call a constructor, not an arbitrary method
c := new ClassWithConstructor.InitB();
c.InitB(); // error: not allowed to call constructors except during allocation
}
// ------------------- datatype destructors ---------------------------------------
datatype DTD_List = DTD_Nil | DTD_Cons(Car: int, Cdr: DTD_List, ghost g: int);
method DatatypeDestructors(d: DTD_List) {
if {
case d.DTD_Nil? =>
assert d == DTD_Nil;
case d.DTD_Cons? =>
var hd := d.Car;
var tl := d.Cdr;
assert hd == d.Cdr; // type error
assert tl == d.Car; // type error
assert d.DTD_Cons? == d.Car; // type error
assert d == DTD_Cons(hd, tl, 5);
ghost var g0 := d.g; // fine
var g1 := d.g; // error: cannot use ghost member in non-ghost code
}
}
// ------------------- print statements ---------------------------------------
method PrintOnlyNonGhosts(a: int, ghost b: int)
{
print "a: ", a, "\n";
print "b: ", b, "\n"; // error: print statement cannot take ghosts
}
// ------------------- auto-added type arguments ------------------------------
class GenericClass<T> { var data: T; }
method MG0(a: GenericClass, b: GenericClass)
requires a != null && b != null;
modifies a;
{
a.data := b.data; // allowed, since both a and b get the same auto type argument
}
method G_Caller()
{
var x := new GenericClass;
MG0(x, x); // fine
var y := new GenericClass;
MG0(x, y); // also fine (and now y's type argument is constrained to be that of x's)
var z := new GenericClass<int>;
y.data := z.data; // this will have the effect of unifying all type args so far to be 'int'
assert x.data == 5; // this is type correct
var w := new GenericClass<bool>;
MG0(x, w); // error: types don't match up
}
datatype GList<T> = GNil | GCons(hd: T, tl: GList);
method MG1(l: GList, n: nat)
{
if (n != 0) {
MG1(l, n-1);
MG1(GCons(12, GCons(20, GNil)), n-1);
}
var t := GCons(100, GNil);
t := GCons(120, l); // error: types don't match up (List<T$0> versus List<int>)
}
// ------------------- calc statements ------------------------------
method TestCalc(m: int, n: int, a: bool, b: bool)
{
calc {
a + b; // error: invalid line
n + m;
}
calc {
a && b;
n + m; // error: all lines must have the same type
}
calc ==> {
n + m; // error: ==> operator requires boolean lines
n + m + 1;
n + m + 2;
}
calc {
n + m;
n + m + 1;
==> n + m + 2; // error: ==> operator requires boolean lines
}
calc {
n + m;
{ print n + m; } // error: non-ghost statements are not allowed in hints
m + n;
}
}
// ------------------- nameless constructors ------------------------------
class YHWH {
var data: int;
constructor (x: int)
modifies this;
{
data := x;
}
constructor (y: bool) // error: duplicate constructor name
{
}
method Test() {
var IAmWhoIAm := new YHWH(5);
IAmWhoIAm := new YHWH._ctor(7); // but, in fact, it is also possible to use the underlying name
IAmWhoIAm := new YHWH; // error: the class has a constructor, so one must be used
var s := new Lucifer.Init(5);
s := new Lucifer.FromArray(null);
s := new Lucifer(false);
s := new Lucifer._ctor(false);
s := new Lucifer.M(); // error: there is a constructor, so one must be called
s := new Lucifer; // error: there is a constructor, so one must be called
var l := new Lamb;
l := new Lamb(); // error: there is no default constructor
l := new Lamb.Gwen();
}
}
class Lucifer {
constructor Init(y: int) { }
constructor (nameless: bool) { }
constructor FromArray(a: array<int>) { }
method M() { }
}
class Lamb {
method Jesus() { }
method Gwen() { }
}
// ------------------- assign-such-that and ghosts ------------------------------
method AssignSuchThatFromGhost()
{
var x: int;
ghost var g: int;
x := g; // error: ghost cannot flow into non-ghost
x := *;
assume x == g; // this mix of ghosts and non-ghosts is cool (but, of course,
// the compiler will complain)
x :| x == g; // error: left-side has non-ghost, so RHS must be non-ghost as well
x :| assume x == g; // this is cool, since it's an assume (but, of course, the
// compiler will complain)
x :| x == 5;
g :| g <= g;
g :| assume g < g; // the compiler will complain here, despite the LHS being
// ghost -- and rightly so, since an assume is used
}
// ------------------------ inferred type arguments ----------------------------
// Put the following tests in a separate module, so that the method bodies will
// be type checked even if there are resolution errors in other modules.
module NoTypeArgs0 {
datatype List<T> = Nil | Cons(T, List);
datatype Tree<A,B> = Leaf(A, B) | Node(Tree, Tree<B,A>);
method DoAPrefix0<A, B, C>(xs: List) returns (ys: List<A>)
{
ys := xs;
}
method DoAPrefix1<A, B, C>(xs: List) returns (ys: List<B>)
{
ys := xs; // error: List<B> cannot be assign to a List<A>
}
method DoAPrefix2<A, B, C>(xs: List) returns (ys: List<B>)
{
ys := xs; // error: List<B> cannot be assign to a List<A>
}
function FTree0(t: Tree): Tree
{
match t
case Leaf(_,_) => t
case Node(x, y) => x
}
function FTree1(t: Tree): Tree
{
match t
case Leaf(_,_) => t
case Node(x, y) => y // error: y does not have the right type
}
function FTree2<A,B,C>(t: Tree): Tree<A,B>
{
t
}
}
module NoTypeArgs1 {
datatype Tree<A,B> = Leaf(A, B) | Node(Tree, Tree<B,A>);
function FTree3<T>(t: Tree): Tree<T,T> // error: type of 't' does not have enough type parameters
{
t
}
}
|