-
Notifications
You must be signed in to change notification settings - Fork 82
/
Copy pathproposal-rw2022.rs
75 lines (68 loc) · 1.42 KB
/
proposal-rw2022.rs
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
use builtin::*;
use builtin_macros::*;
use vstd::{prelude::*, *};
verus! {
spec fn fibo(n: nat) -> nat
decreases n,
{
if n == 0 {
0
} else if n == 1 {
1
} else {
fibo((n - 2) as nat) + fibo((n - 1) as nat)
}
}
proof fn lemma_fibo_is_monotonic(i: nat, j: nat)
requires
i <= j,
ensures
fibo(i) <= fibo(j),
decreases j - i,
{
if i < 2 && j < 2 {
} else if i == j {
} else if i == j - 1 {
reveal_with_fuel(fibo, 2);
lemma_fibo_is_monotonic(i, (j - 1) as nat);
} else {
lemma_fibo_is_monotonic(i, (j - 1) as nat);
lemma_fibo_is_monotonic(i, (j - 2) as nat);
}
}
spec fn fibo_fits_u64(n: nat) -> bool {
fibo(n) <= 0xffff_ffff_ffff_ffff
}
exec fn fibo_impl(n: u64) -> (result: u64)
requires
fibo_fits_u64(n as nat),
ensures
result == fibo(n as nat),
{
if n == 0 {
return 0;
}
let mut prev: u64 = 0;
let mut cur: u64 = 1;
let mut i: u64 = 1;
while i < n
invariant
0 < i <= n,
fibo_fits_u64(n as nat),
fibo_fits_u64(i as nat),
cur == fibo(i as nat),
prev == fibo((i - 1) as nat),
{
i = i + 1;
proof {
lemma_fibo_is_monotonic(i as nat, n as nat);
}
let new_cur = cur + prev;
prev = cur;
cur = new_cur;
}
cur
}
fn main() {
}
} // verus!