Test/dafny0/Refinement.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

// Concrete language syntax for a Dafny extension with refinement. 
// IntegerCounter example.
// 6/28/2010

class A { 
  var n : int;
    
  method Init() modifies this; 
  { n := 0;}

  method Inc() modifies this; 
  { n := n + 1;}

  method Dec() 
    modifies this;
    requires n > 0; 
  { n := n - 1;}  
  
  method Test1(p: int) returns (i: int) 
  {   
    assume true;
  }

  method Test2() returns (o: object)
  { o := this; }
}

class B refines A {
  var inc : int, dec : int;
    
  replaces n by n == inc - dec;
  // transforms n into inc - dec;
    
  refines Init() modifies this;
  { inc := 0; dec := 0;}
    
  refines Inc() modifies this;
  { inc := inc + 1; }  
  
  refines Dec() 
    modifies this;
    requires inc > dec; 
  { dec := dec + 1; }

  refines Test1(p: int) returns (i: int) 
  {
    i := p;
  }
}

// Carrol Morgan's calculator
// 7/2/2010 Kuat

class ACalc {
  var vals: seq<int>;
  
  method reset() 
    modifies this;
  {
    vals := [];
  }
  
  method add(x: int) 
    modifies this;
  {
    vals := [x] + vals;
  }
  
  method mean() returns (m: int)     
    requires |vals| > 0;
  {
    m := seqsum(vals)/|vals|;
  }

  static function method seqsum(x:seq<int>) : int
    decreases x;
  {
    if (x == []) then 0 else x[0] + seqsum(x[1..])
  }
}


class CCalc refines ACalc {
  var sum: int;
  var num: int;
  replaces vals by sum == seqsum2(vals) && num == |vals|;

  refines reset() 
    modifies this;
  {
    sum := 0;
    num := 0;
  }

  refines add(x: int)
    modifies this;
  {
    sum := sum + x;
    num := num + 1;
  }

  refines mean() returns (m: int)
    requires num > 0;
  {
    m := sum/num;
  }

  static function method seqsum2(x:seq<int>) : int
    decreases x;
  {
    if (x == []) then 0 else x[0] + seqsum2(x[1..])
  }
}

// Sequence refined to a singly linked list
// 6/22/2010: Kuat Yessenov

class List<T> {
  var rep: seq<T>;
  method Clear() 
    modifies this;
  {
    rep := [];
  }
  
  method Append(x: T) 
    modifies this; 
  {
    rep := rep + [x];
  }
  
  method Prepend(x: T) 
    modifies this; 
  {
    rep := [x] + rep;
  }
  
  method Insert(i: int, x: T) 
    requires 0 <= i && i < |rep|;
    modifies this;
  {
    rep := rep[i:=x];
  }
}

class Node<T> {
  var data: T;
  var next: Node<T>;
}   

class LinkedList refines List {
  var first: Node<T>;
  ghost var nodes: set<Node<T>>;
    
  function Abstraction(n: Node<T>, nodes: set<Node<T>>, rep: seq<T>) : bool
  decreases nodes;
  reads n, nodes;
  {
    if (n == null) then 
            rep == [] &&
            nodes == {}
        else 
            |rep| >= 1 &&
            n.data == rep[0] &&
            n in nodes &&
            n.next in nodes + {null} &&
            Abstraction(n.next, nodes - {n}, rep[1..])
  }

  replaces rep by Abstraction(first, nodes, rep);     

  refines Clear() 
    modifies this;
  {
    first := null;
    nodes := {};
  }

  refines Prepend(x: T) 
    modifies this;
  {
    var n := new Node<T>;
    n.data := x;
    n.next := first;
    first := n;
    nodes := {n} + nodes;
    assert nodes - {n} == old(nodes); //set extensionality
  }
}