| Commit message (Collapse) | Author | Age |
|---|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Now, loops that may possibly
do an infinite number of iterations (that is, loops marked with 'decreases *') and calls to methods
marked with 'decreases *' are allowed only in methods that themselves are marked with 'decreases *'. As
before, ghost loops and ghost methods are not allowed to be marked with 'decreases *'.
Previously, 'decreases *' was allowed on a method only if the method was tail recursive;
this is no longer so. Note, however, that if the method is not tail recursive and engages
in infinite recursion, then it will eventually run out of stack space.
Previously, a 'decreases *' was not inherited in a refining module; this is no longer so.
That is, 'decreases *' is now inherited. To refine a possibly non-terminating method
or loop, the refining version simply provides a decreases clause that does not mention '*'.
Note that if the refined method is not recursive, it still needs to have _some_ decreases
clause in order not to inherit the 'decreases *' from the refined method, but the expression
stated in the decreases clause can be arbitrary (for example, one can write 'decreases true'
or 'decreases 7' or 'decreases x' for some 'x' in scope).
Note, in the new design, a method needs to be declared with 'decreases *' if
it may recurse forever _or_ if it contains a possibly infinite loop.
Note that the absence of 'decreases *' on a loop does not mean the loop will
terminate, but it does mean that the loop will iterate a finite number of times
(the subtle distinction here is that a loop without a 'decreases *' is allowed
to contain a nested loop that has a 'decreases *' -- provided the enclosing
method is also declared with 'decreases *', as previously mentioned).
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
* The reads clause now needs to be self framing.
* The requires clause now needs to be framed by the reads clause.
* There are one-shot lambdas, with a single arrow, but they will probably be
removed.
* There is a {:heapQuantifier} attribute to quantifiers, but they will
probably be removed.
* Add smart handling of type variables
* Add < and > for datatype & type parameter
|
| |\ |
|
| | | |
|
| | |\ |
|
| | |/
|/| |
|
| |/ |
|
| | |
|
| | |
|
| |
|
|
| |
to use it.
|
| | |
|
| | |
|
| |
|
|
|
|
|
| |
similar
to RingBufferAuto.dfy and ExtensibleArrayAuto.dfy, respectively, so that the effect
of {:autocontracts} is more easily seen.
|
| |
|
|
| |
the assign-such-that statement instead. For example: x :| x in S;
|
| | |
|
| | |
|
| |
|
|
| |
around the bound variables optional.
|
| |
|
|
| |
(A nice consequence of this is that the method IsTotal is no longer needed.)
|
| | |
|
| |
|
|
| |
(previously undetected) specification bug in the test suite.
|
| | |
|
| | |
|
| |
|
|
| |
renamed "ghost module" to "abstract module", adding a keyword "abstract"
|
| |
|
|
| |
Changed the test output to make it easier to spot (in the console output) that everything passed with success or if there were any failures
|
| |
|
|
|
|
| |
Iter.dfy!)
Fixed migration issues
|
| | |
|
| |
|
|
|
| |
-allocated(x) removed, as really only useful in old(...)
-old(allocated(x)) and !fresh(x) are equivalent (for x with type ref, set, sequence, and datatype).
|
| | |
|
| | |
|
| | |
|
| |\ |
|
| | | |
|
| | |\ |
|
| | | |
| | |
| | |
| | | |
(in particular, codatatypes), Dafny needs to check this. In these changes, Dafny supports the "(==)" suffix to type parameters, infers that suffix in some cases, and enforces equality support in many places. Refinement and datatypes still need more attention in the Dafny implementation.
|
| | |\| |
|
| | |/
|/|
| |
| | |
the Schorr-Waite algorithm (the staging features, as well as the newly added comments, make the verification much more digestible)
|
| | |\
| |/
|/| |
|
| | | |
|
| |/ |
|
| | |
|
| | |
|
| |
|
|
| |
specifications
|
| | |
|
| |
|
|
| |
parentheses
|
| |\ |
|
| | |
| |
| |
| | |
.cs file with the new /spillTargetCode switch
|
| |/
|
|
| |
arbitrary type (like a global type parameter). In the future, a refined module may allow such types to be instantiated.
|
| | |
|
| |
|
|
| |
a previous lemma
|
| |
|
|
| |
program, Hoare's classic FIND, and some induction tests for negative integers
|
Rustan Leino
Dan Rosén
Unknown
Rustan Leino
Unknown
Unknown
Unknown
Unknown