-
Notifications
You must be signed in to change notification settings - Fork 4
/
collections.dfy
618 lines (538 loc) · 17.5 KB
/
collections.dfy
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
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
include "../nonlin/arith.dfy"
module Collections
{
import opened Arith
lemma seq_ext_eq<T>(xs: seq<T>, ys: seq<T>)
requires |xs| == |ys|
requires forall i :: 0 <= i < |xs| ==> xs[i] == ys[i]
ensures xs == ys
{}
// workaround for Dafny bug https://github.com/dafny-lang/dafny/issues/1113
ghost function to_seq<T>(s: seq<T>): seq<T> { s }
// sequence indexing
lemma double_prefix<T>(xs: seq<T>, a: nat, b: nat)
requires b <= a <= |xs|
ensures xs[..a][..b] == xs[..b]
{}
lemma double_suffix<T>(xs: seq<T>, a: nat, b: nat)
requires a+b <= |xs|
ensures xs[a..][b..] == xs[a+b..]
{}
lemma double_subslice<T>(xs: seq<T>, a: nat, b: nat, c: nat, d: nat)
requires a <= b <= |xs|
requires c <= d <= (b-a)
ensures xs[a..b][c..d] == xs[a+c..a+d]
{
// consequence of the bounds that make xs[..a+d] well-formed
assert d + a <= b;
assert xs[a..b] == xs[a..][..(b-a)];
}
lemma app_assoc<T>(xs: seq<T>, ys: seq<T>, zs: seq<T>)
ensures (xs + ys) + zs == xs + (ys + zs)
{}
lemma split_rejoin<T>(xs: seq<T>, n: int)
requires 0 <= n < |xs|
ensures xs == xs[..n] + xs[n..]
{}
// this is a useful way to use double_subslice automatically in a controlled way
// that generally works, because it has such a specific trigger
//
// see http://leino.science/papers/krml265.html for some more ideas
lemma double_subslice_auto<T>(xs: seq<T>)
ensures forall a: nat, b: nat, c: nat, d: nat {:trigger xs[a..b][c..d]} |
a <= b <= |xs| && c <= d <= (b-a) ::
xs[a..b][c..d] == xs[a+c..a+d]
{
forall a: nat, b: nat, c: nat, d: nat |
a <= b <= |xs| && c <= d <= (b-a)
ensures xs[a..b][c..d] == xs[a+c..a+d]
{
double_subslice(xs, a, b, c, d);
}
}
// fmap over sequences
function {:opaque}
seq_fmap<T,U>(f: T -> U, xs: seq<T>): (ys:seq<U>) decreases xs
ensures |ys| == |xs| && forall i :: 0 <= i < |xs| ==> ys[i] == f(xs[i])
{
if xs == [] then [] else [f(xs[0])] + seq_fmap(f, xs[1..])
}
lemma seq_fmap_app<T,U>(f: T -> U, xs: seq<T>, ys: seq<T>)
ensures seq_fmap(f, xs + ys) == seq_fmap(f, xs) + seq_fmap(f, ys)
{}
lemma seq_fmap_compose<T,U,V>(f: T -> U, g: U -> V, xs: seq<T>)
ensures seq_fmap(g, seq_fmap(f, xs)) == seq_fmap(x => g(f(x)), xs)
{}
// filter
function seq_filter<T>(p: T -> bool, xs: seq<T>): (ys:seq<T>)
ensures |ys| <= |xs| && forall y :: y in ys ==> p(y) && y in xs
{
if xs == [] then []
else (if p(xs[0]) then [xs[0]] else []) + seq_filter(p, xs[1..])
}
lemma seq_filter_size<T>(p: T -> bool, xs: seq<T>)
ensures |seq_filter(p, xs)| == count_matching(p, xs)
{}
lemma seq_filter_app<T>(p: T -> bool, xs1: seq<T>, xs2: seq<T>)
ensures seq_filter(p, xs1 + xs2) == seq_filter(p, xs1) + seq_filter(p, xs2)
{
if xs1 == [] { assert xs1 + xs2 == xs2; }
if xs1 != [] {
assert (xs1 + xs2)[1..] == xs1[1..] + xs2;
seq_filter_app(p, xs1[1..], xs2);
}
}
// find_first
function find_first<T>(p: T -> bool, xs: seq<T>): (i:nat)
ensures i < |xs| ==> p(xs[i])
{
if xs == [] then 0
else if p(xs[0]) then 0 as nat else 1 + find_first(p, xs[1..])
}
lemma {:induction xs} find_first_complete<T>(p: T -> bool, xs: seq<T>)
ensures find_first(p, xs) <= |xs|
ensures forall k:nat | k < find_first(p, xs) :: !p(xs[k])
{}
lemma find_first_characterization<T>(p: T -> bool, xs: seq<T>, i: nat)
requires i < |xs| ==> p(xs[i])
requires i <= |xs|
requires forall k:nat | k < i :: !p(xs[k])
ensures i == find_first(p, xs)
{
if 0 < |xs| {
if p(xs[0]) {}
else {
find_first_characterization(p, xs[1..], i-1);
}
}
}
// count matching a predicate
function count_matching<T>(p: T -> bool, xs: seq<T>): (i:nat)
ensures i <= |xs|
{
if xs == [] then 0
else (if p(xs[0]) then 1 else 0) + count_matching(p, xs[1..])
}
lemma {:induction xs1} count_matching_app<T>(p: T -> bool, xs1: seq<T>, xs2: seq<T>)
ensures count_matching(p, xs1 + xs2) == count_matching(p, xs1) + count_matching(p, xs2)
{
if xs1 == [] {
assert xs1 + xs2 == xs2;
} else {
assert (xs1 + xs2)[1..] == xs1[1..] + xs2;
}
}
// repeat
function repeat<T>(x: T, count: nat): (xs:seq<T>)
{
seq(count, _ => x)
}
lemma repeat_seq_fmap_auto<T, U>()
ensures forall f: T -> U, x:T, count {:trigger seq_fmap(f, repeat(x, count))} :: seq_fmap(f, repeat(x, count)) == repeat(f(x), count)
{}
// equation for repeat for induction on count
lemma repeat_unfold<T>(x: T, count: nat)
requires 0 < count
ensures repeat(x, count) == [x] + repeat(x, count-1)
{}
lemma repeat_split<T>(x: T, count: nat, count1: nat, count2: nat)
requires count == count1 + count2
ensures repeat(x, count) == repeat(x, count1) + repeat(x, count2)
{}
// concat
function concat<T>(xs: seq<seq<T>>): (ys: seq<T>)
decreases xs
{
if xs == [] then []
else xs[0] + concat(xs[1..])
}
lemma {:induction ls1} concat_app<T>(ls1: seq<seq<T>>, ls2: seq<seq<T>>)
ensures concat(ls1 + ls2) == concat(ls1) + concat(ls2)
{
if ls1 == [] {
assert [] + ls2 == ls2;
} else {
assert (ls1 + ls2)[1..] == ls1[1..] + ls2;
concat_app(ls1[1..], ls2);
}
}
lemma {:induction ls} concat_homogeneous_len<T>(ls: seq<seq<T>>, len: nat)
requires forall l | l in ls :: |l| == len
ensures |concat(ls)| == len * |ls|
{
if ls == [] {}
else {
concat_homogeneous_len(ls[1..], len);
calc {
|ls[0] + concat(ls[1..])|;
len + |concat(ls[1..])|;
len + len*(|ls|-1);
{ mul_distr_add_l(len, |ls|, -1); }
len * |ls|;
}
}
}
ghost predicate concat_spec<T>(ls: seq<seq<T>>, x1: nat, x2: nat, len: nat)
requires forall l | l in ls :: |l| == len
requires x1 < |ls|
requires x2 < len
{
concat_homogeneous_len(ls, len);
mul_positive(x1, len);
&& x1 * len + x2 < len * |ls|
&& concat(ls)[x1 * len + x2] == ls[x1][x2]
}
lemma {:induction ls} concat_homogeneous_spec<T>(ls: seq<seq<T>>, len: nat)
decreases ls
requires forall l | l in ls :: |l| == len
ensures |concat(ls)| == len * |ls|
ensures forall x1:nat, x2:nat | x1 < |ls| && x2 < len ::
concat_spec(ls, x1, x2, len)
{
concat_homogeneous_len(ls, len);
if ls == [] {}
else {
concat_homogeneous_spec(ls[1..], len);
forall x1:nat, x2:nat | x1 < |ls| && x2 < len
ensures concat_spec(ls, x1, x2, len)
{
if x1 == 0 {
} else {
assert concat_spec(ls[1..], x1-1, x2, len);
mul_positive(x1-1, len);
assert concat(ls[1..])[(x1-1) * len + x2] == ls[1..][x1-1][x2];
mul_distr_add_r(x1, -1, len);
assert (x1-1) * len + x2 == (x1*len + x2) - len;
}
}
}
}
lemma concat_homogeneous_spec1<T>(ls: seq<seq<T>>, x1: nat, x2: nat, len: nat)
requires forall l | l in ls :: |l| == len
requires x1 < |ls| && x2 < len
ensures concat_spec(ls, x1, x2, len)
{
concat_homogeneous_spec(ls, len);
}
lemma concat_homogeneous_spec_alt<T>(ls: seq<seq<T>>, len: nat)
requires forall l | l in ls :: |l| == len
ensures |concat(ls)| == len * |ls|
ensures forall x: nat | x < len * |ls| ::
&& 0 <= x/len < |ls|
&& concat(ls)[x] == ls[x / len][x % len]
{
concat_homogeneous_len(ls, len);
forall x: nat | x < len * |ls|
ensures 0 <= x / len < |ls|
ensures x % len < len
ensures concat_spec(ls, x / len, x % len, len)
ensures 0 <= x/len < |ls|
ensures concat(ls)[x] == ls[x / len][x % len]
{
div_incr(x, |ls|, len);
div_positive(x, len);
concat_homogeneous_spec1(ls, x/len, x%len, len);
div_mod_split(x, len);
assert concat_spec(ls, x/len, x%len, len);
assert (x/len) * len + (x%len) == x;
assert concat(ls)[(x/len) * len + (x%len)] == concat(ls)[x];
}
}
lemma {:induction ls} concat_in<T>(ls: seq<seq<T>>, x: T)
ensures x in concat(ls) <==> exists i:nat :: i < |ls| && x in ls[i]
{}
lemma concat_in_intro<T>(ls: seq<seq<T>>, x: T, i: nat)
requires i < |ls|
requires x in ls[i]
ensures x in concat(ls)
{
concat_in(ls, x);
}
lemma {:induction ls} concat_in_elim<T>(ls: seq<seq<T>>, x: T) returns (i: nat)
requires x in concat(ls)
ensures i < |ls| && x in ls[i]
{
concat_in(ls, x);
i :| i < |ls| && x in ls[i];
}
lemma {:induction ls} concat_app1<T>(ls: seq<seq<T>>, x: seq<T>)
decreases ls
ensures concat(ls + [x]) == concat(ls) + x
{
if ls == [] {
} else {
concat_app1(ls[1..], x);
assert (ls + [x])[1..] == ls[1..] + [x];
}
}
// extracting one full list from a concatnation
lemma concat_homogeneous_one_list<T>(ls: seq<seq<T>>, k: nat, len: nat)
requires forall l | l in ls :: |l| == len
requires 1 < len
requires k < |ls|
ensures 0 <= k*len
ensures k * len + len <= |concat(ls)|
ensures concat(ls)[k * len..k*len + len] == ls[k]
{
mul_positive(k, len);
mul_distr_add_r(k, 1, len);
mul_add_bound(k, 1, |ls|, len);
mul_r_incr(k+1, |ls|, len);
concat_homogeneous_spec(ls, len);
forall i: nat | i < len
ensures concat(ls)[k * len + i] == ls[k][i]
{
assert concat_spec(ls, k, i, len);
}
}
lemma concat_repeat<T>(x: T, count1: nat, count2: nat)
ensures 0 <= count2*count1
ensures concat(repeat(repeat(x, count1), count2)) == repeat(x, count2*count1)
{
mul_positive(count1, count2);
concat_homogeneous_spec_alt(repeat(repeat(x, count1), count2), count1);
}
// map to domain as a set
function map_domain<K, V>(m: map<K, V>): set<K> {
set k:K | k in m
}
// map lemmas
lemma map_update<K, V>(m1: map<K, V>, m2: map<K, V>, k: K, v: V)
requires k in m2 && m2[k] == v
requires forall k':K :: k' in m1 <==> k' in m2
requires forall k':K | k != k' && k' in m1 && k' in m2 :: m1[k'] == m2[k']
ensures m2 == m1[k := v]
{}
// prefix_of
ghost predicate prefix_of<T>(s1: seq<T>, s2: seq<T>) {
|s1| <= |s2| && s1 == s2[..|s1|]
}
lemma prefix_of_concat2<T>(s1: seq<T>, s2: seq<T>, s: seq<T>)
requires prefix_of(s1, s2)
ensures prefix_of(s1, s2 + s)
{
}
lemma prefix_of_refl<T>(s: seq<T>)
ensures prefix_of(s, s)
{
}
lemma prefix_of_refl_inv<T>(s1: seq<T>, s2: seq<T>)
requires prefix_of(s1, s2)
requires |s1| == |s2|
ensures s1 == s2
{
}
lemma prefix_of_app2<T>(s1: seq<T>, s2: seq<T>, n: nat)
requires prefix_of(s1, s2)
requires n <= |s1|
ensures prefix_of(s1[n..], s2[n..])
{
}
// summation
function sum_nat(xs: seq<nat>): nat
decreases xs
{
if xs == [] then 0
else xs[0] + sum_nat(xs[1..])
}
lemma {:induction count} sum_repeat(x: nat, count: nat)
ensures sum_nat(repeat(x, count)) == count * x
{
if count > 0 {
repeat_unfold(x, count);
}
mul_distr_sub_r(count, 1, x);
}
// NOTE(tej): if you happen to know the proof, then Dafny can automatically
// prove this with just {:induction xs, i} (but not just i or xs or even i, xs)
lemma {:induction xs, i} sum_update(xs: seq<nat>, i:nat, x: nat)
requires i < |xs|
decreases xs
ensures sum_nat(xs[i:=x]) == sum_nat(xs)-xs[i]+x
{
assert 0 < |xs|;
if i == 0 {}
else {
// assert (xs[i:=x])[1..] == xs[1..][i-1:=x];
sum_update(xs[1..], i-1, x);
}
}
// unique
ghost predicate unique<T>(xs: seq<T>)
{
forall i, j | 0 <= i < |xs| && 0 <= j < |xs| :: xs[i] == xs[j] ==> i == j
}
lemma unique_extend<T>(xs: seq<T>, x: T)
requires unique(xs)
requires x !in xs
ensures unique(xs + [x])
{}
// without_last, last
ghost function without_last<T>(xs: seq<T>): seq<T>
requires 0 < |xs|
{
xs[..|xs|-1]
}
ghost function last<T>(xs: seq<T>): T
requires 0 < |xs|
{
xs[|xs|-1]
}
lemma concat_split_last<T>(xs: seq<seq<T>>)
requires 0 < |xs|
ensures concat(xs) == concat(without_last(xs)) + last(xs)
{
assert xs == without_last(xs) + [last(xs)];
concat_app1(without_last(xs), last(xs));
}
// splice (insert sequence)
function splice<T>(xs: seq<T>, off: nat, ys: seq<T>): (xs':seq<T>)
requires off + |ys| <= |xs|
ensures |xs'| == |xs|
{
xs[..off] + ys + xs[off+|ys|..]
}
lemma splice_get_i<T>(xs: seq<T>, off: nat, ys: seq<T>, i: nat)
requires off + |ys| <= |xs|
requires i < |xs|
ensures splice(xs, off, ys)[i] == if (off <= i < off + |ys|) then ys[i-off] else xs[i]
{}
lemma splice_get_ys<T>(xs: seq<T>, off: nat, ys: seq<T>)
requires off + |ys| <= |xs|
ensures splice(xs, off, ys)[off..off+|ys|] == ys
{}
lemma splice_at_0<T>(xs: seq<T>, ys: seq<T>)
requires |ys| <= |xs|
ensures splice(xs, 0, ys) == ys + xs[|ys|..]
{}
lemma splice_till_end<T>(xs: seq<T>, off: nat, ys: seq<T>)
requires off + |ys| == |xs|
ensures splice(xs, off, ys) == xs[..off] + ys
{}
lemma splice_all<T>(xs: seq<T>, ys: seq<T>)
requires |ys| == |xs|
ensures splice(xs, 0, ys) == ys
{}
lemma splice_prefix_comm<T>(xs: seq<T>, off: nat, ys: seq<T>, max: nat)
requires off + |ys| <= max <= |xs|
ensures splice(xs, off, ys)[..max] == splice(xs[..max], off, ys)
{}
lemma splice_prefix_comm_auto<T>(xs: seq<T>)
ensures forall off: nat, ys: seq<T>, max: nat {:trigger {splice(xs, off, ys)[..max]}}
| off + |ys| <= max <= |xs| ::
splice(xs, off, ys)[..max] == splice(xs[..max], off, ys)
{
forall off: nat, ys: seq<T>, max: nat
| off + |ys| <= max <= |xs|
ensures splice(xs, off, ys)[..max] == splice(xs[..max], off, ys)
{
splice_prefix_comm(xs, off, ys, max);
}
}
lemma double_splice<T>(xs: seq<T>, start: nat, end: nat, off: nat, ys: seq<T>)
requires start <= end <= |xs|
requires off + |ys| <= end - start
ensures splice(xs, start, splice(xs[start..end], off, ys)) ==
splice(xs, start + off, ys)
{}
lemma double_splice_auto<T>(xs: seq<T>)
ensures forall start: nat, end: nat, off: nat, ys: seq<T> ::
start <= end <= |xs| ==>
off + |ys| <= end - start ==>
splice(xs, start, splice(xs[start..end], off, ys)) ==
splice(xs, start + off, ys)
{}
lemma concat_homogeneous_subslice<T>(xs: seq<seq<T>>, start: nat, end: nat, len: nat)
requires start <= end <= |xs|
requires 0 < len
requires forall l | l in xs :: |l| == len
ensures 0 <= start*len <= end*len <= |concat(xs)| == len*|xs|
ensures concat(xs[start..end]) == concat(xs)[start*len..end*len]
{
assert 0 <= start*len <= end*len <= |concat(xs)| == len*|xs| by {
concat_homogeneous_len(xs, len);
mul_positive(start, len);
mul_positive(end, len);
mul_r_incr(start, end, len);
mul_r_incr(end, |xs|, len);
}
assert xs == xs[..start] + xs[start..end] + xs[end..];
assert concat(xs) == concat(xs[..start]) + concat(xs[start..end]) + concat(xs[end..]) by {
concat_app(xs[..start] + xs[start..end], xs[end..]);
concat_app(xs[..start], xs[start..end]);
}
concat_homogeneous_len(xs[..start], len);
concat_homogeneous_len(xs[start..end], len);
concat_homogeneous_len(xs[end..], len);
assert |concat(xs[..start])| == start*len by {
Arith.mul_comm(start, len);
}
assert |concat(xs[start..end])| == end*len - start*len by {
assert |xs[start..end]| == end - start;
Arith.mul_distr_sub_r(end, start, len);
Arith.mul_comm(start, len);
Arith.mul_comm(end, len);
}
}
lemma concat_homogeneous_prefix<T>(xs: seq<seq<T>>, end: nat, len: nat)
requires end <= |xs|
requires 0 < len
requires forall l | l in xs :: |l| == len
ensures 0 <= end*len <= |concat(xs)| == len*|xs|
ensures concat(xs[..end]) == concat(xs)[..end*len]
{
concat_homogeneous_subslice(xs, 0, end, len);
}
lemma concat_homogeneous_suffix<T>(xs: seq<seq<T>>, start: nat, len: nat)
requires start <= |xs|
requires 0 < len
requires forall l | l in xs :: |l| == len
ensures 0 <= start*len <= |concat(xs)| == len*|xs|
ensures concat(xs[start..]) == concat(xs)[start*len..]
{
concat_homogeneous_subslice(xs, start, |xs|, len);
assert xs[start..|xs|] == xs[start..];
}
lemma concat_homogeneous_splice_one<T>(xs: seq<seq<T>>, off: nat, ys: seq<T>, len: nat)
requires 0 < len
requires forall l | l in xs :: |l| == len
requires |ys| == len
requires off < |xs|
ensures 0 <= off*len < off*len+len <= |concat(xs)|
ensures concat(xs[off:=ys]) == splice(concat(xs), off*len, ys)
{
concat_homogeneous_len(xs, len);
assert (off+1)* len == off*len + len by {
mul_distr_add_r(off, 1, len);
}
assert 0 <= off*len < off*len + len <= |concat(xs)| by {
mul_positive(off, len);
mul_r_incr(off+1, |xs|, len);
}
var l1: seq<T> := concat(xs[off:=ys]);
var l2: seq<T> := splice(concat(xs), off*len, ys);
concat_homogeneous_len(xs[off:=ys], len);
concat_homogeneous_spec_alt(xs, len);
concat_homogeneous_spec_alt(xs[off:=ys], len);
forall i:nat | i < |xs|*len
ensures l1[i] == l2[i]
{
assert l1[i] == xs[off:=ys][i / len][i % len];
if off*len <= i < (off+1)*len {
Arith.div_mod_spec(i, off, len);
assert i / len == off;
} else {
assert i / len != off by {
if i < off*len {
div_incr(i, off, len);
} else {
assert (off+1)*len <= i;
Arith.div_increasing((off+1)*len, i, len);
Arith.mul_div_id(off+1, len);
}
}
}
}
assert l1 == l2;
}
}