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
|
datatype List<T> {
Nil;
Cons(T, List<T>);
}
class Node {
var data: int;
var next: Node;
function Repr(list: List<int>): bool
reads *;
decreases list;
{ match list
case Nil =>
next == null
case Cons(d,cdr) =>
data == d && next != null && next.Repr(cdr)
}
method Init()
modifies this;
ensures Repr(Nil);
{
next := null;
}
method Add(d: int, L: List<int>) returns (r: Node)
requires Repr(L);
ensures r != null && r.Repr(Cons(d, L));
{
r := new Node;
r.data := d;
r.next := this;
}
}
class AnotherNode {
var data: int;
var next: AnotherNode;
function Repr(n: AnotherNode, list: List<int>): bool
reads *;
decreases list;
{ match list
case Nil =>
n == null
case Cons(d,cdr) =>
n != null && n.data == d && Repr(n.next, cdr)
}
method Create() returns (n: AnotherNode)
ensures Repr(n, Nil);
{
n := null;
}
method Add(n: AnotherNode, d: int, L: List<int>) returns (r: AnotherNode)
requires Repr(n, L);
ensures Repr(r, Cons(d, L));
{
r := new AnotherNode;
r.data := d;
r.next := n;
}
}
method TestAllocatednessAxioms(a: List<Node>, b: List<Node>, c: List<AnotherNode>)
{
var n := new Node;
var p := n;
match a {
case Nil =>
case Cons(x, tail) => assert x != n; p := x;
}
match b {
case Nil =>
case Cons(x, tail) =>
match tail {
case Nil =>
case Cons(y, more) =>
assert y != n;
assert y != p; // error: if p is car(a), then it and y may very well be equal
}
}
match c {
case Nil =>
case Cons(x, tail) =>
match tail {
case Nil =>
case Cons(y, more) =>
var o: object := y;
assert p != null ==> p != o; // follows from well-typedness
}
}
}
class NestedMatchExpr {
function Cadr<T>(a: List<T>, default: T): T
{
match a
case Nil => default
case Cons(x,t) =>
match t
case Nil => default
case Cons(y,tail) => y
}
// CadrAlt is the same as Cadr, but it writes its two outer cases in the opposite order
function CadrAlt<T>(a: List<T>, default: T): T
{
match a
case Cons(x,t) => (
match t
case Nil => default
case Cons(y,tail) => y)
case Nil => default
}
method TestNesting0()
{
var x := 5;
var list := Cons(3, Cons(6, Nil));
assert Cadr(list, x) == 6;
match (list) {
case Nil => assert false;
case Cons(h,t) => assert Cadr(t, x) == 5;
}
}
method TestNesting1(a: List<NestedMatchExpr>)
ensures Cadr(a, this) == CadrAlt(a, this);
{
match (a) {
case Nil =>
case Cons(x,t) =>
match (t) {
case Nil =>
case Cons(y,tail) =>
}
}
}
}
|
