diff options
author | 2011-02-17 23:46:15 +0000 | |
---|---|---|
committer | 2011-02-17 23:46:15 +0000 | |
commit | 93abae9561c85aaebe799a19aebd5759cefba643 (patch) | |
tree | b2be1520da76cf9357865040c9bbc7529a285209 /Test/dafny0/Datatypes.dfy | |
parent | a90583e8b65fb89881efe6826c5af1274ff6ec3f (diff) |
Dafny:
* Big change: Add type and allocatedness information everywhere in the Boogie translation. This not only fixes some potential soundness problems (see Test/dafny1/TypeAntecedents.dfy), but it also gives more information about the program. On the downside, it also requires discharging more antecedents in order to use some axioms. Another downside is that overall performance has gone down (however, this may be just an indirect consequence of the change, as it was in one investigated case).
* Increase the applicability of function axioms (extending the coarse-grain function/module height mechanism used as an antecedent of function axioms). (Internally, this uses the new canCall mechanism.)
* Extend language with "allocated( Expr )" expressions, which for any type of expression "Expr" says that "Expr" is allocated and has the expected type.
* More details error messages about ill-defined expressions (internally, by using CheckWellformedness instead of "assert IsTotal")
* Add axioms about idempotence of set union and intersection
* The compiler does not support (the experimental feature) coupling invariants, so generate error if the compiler ever gets one
* In the implementation, combine common behavior of MatchCaseStmt and MatchCaseExpr into a superclass MatchCase
* Fixed error in translation of while(*)
Diffstat (limited to 'Test/dafny0/Datatypes.dfy')
-rw-r--r-- | Test/dafny0/Datatypes.dfy | 30 |
1 files changed, 30 insertions, 0 deletions
diff --git a/Test/dafny0/Datatypes.dfy b/Test/dafny0/Datatypes.dfy index 2b3168b2..a7ac03d9 100644 --- a/Test/dafny0/Datatypes.dfy +++ b/Test/dafny0/Datatypes.dfy @@ -63,3 +63,33 @@ class AnotherNode { 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
+ }
+ }
+}
|