diff options
| author |  wuestholz <unknown> | 2014-05-29 21:41:00 +0200 |
|---|---|---|
| committer | wuestholz <unknown> | 2014-05-29 21:41:00 +0200 |
| commit | 607ef28aadb281ab61a2be493a637126e967a388 (patch) | |
| tree | aae16c049c860e443920f9c6ee31af4e35f8a800 /Test/dafny2/COST-verif-comp-2011-2-MaxTree-datatype.dfy | |
| parent | dc0a9130355352d0f47e07232d8119fc7219ccbc (diff) | |
Set up the same test infrastructure as in Boogie.
Diffstat (limited to 'Test/dafny2/COST-verif-comp-2011-2-MaxTree-datatype.dfy')
| -rw-r--r-- | Test/dafny2/COST-verif-comp-2011-2-MaxTree-datatype.dfy | 3 |
1 files changed, 3 insertions, 0 deletions
diff --git a/Test/dafny2/COST-verif-comp-2011-2-MaxTree-datatype.dfy b/Test/dafny2/COST-verif-comp-2011-2-MaxTree-datatype.dfy index 8dd7bd2d..24cd541c 100644 --- a/Test/dafny2/COST-verif-comp-2011-2-MaxTree-datatype.dfy +++ b/Test/dafny2/COST-verif-comp-2011-2-MaxTree-datatype.dfy @@ -1,3 +1,6 @@ +// RUN: %dafny /compile:0 /dprint:"%t.dprint" "%s" > "%t"
+// RUN: %diff "%s.expect" "%t"
+
// This Dafny program was inspired by Claude Marche's Why3ML program that solves
// Challenge 2 of the COST Verification Competition. It particular, it uses an
// inductive datatype for the Tree data structure, and it uses a Contains function
|