Preliminary results:
1. For typed matching, either heuristic 32 or 34 are best, and far
superior to the previous best (3).
2. For untyped matching, partial tests indicate that heuristic 1 is
best, which is rather interesting.
- Added new switches:
-G,--generate-statespace
-C,--generate-claims
- Claims are now allowed to have no label (they will be generated
automatically)
- Output summary shows parameter of claims
- Internally, new symbols can now be generated by
symbolNextFree(prefixsymbol)
--tupling=n * 0: right-associative; 1: left-associative; others are
reserved for future use.
--ra-tupling * Sets the default, but is there for symmetry.
instead of the default right-associative tupling. Note that this only
matters for full typeflaw matching.
- Adapted multi-nsl test script to test for both association variants.
the (monstrously large) system structure, there is now a global
'switchdata' structure originating in switches.c. This makes it much
easier to see what's happening.
* Note: although this code has been tested, there might be some
hiccups, because doing multiple search&replace actions over all
files is bound to cause some problems.
* removed <term> wrappers
* added <const> wrappers
* removed <role><term> construct, now <rolename>R</rolename>
constructs.
* added <variables> section.
* variable substitutions are followed through in runs. Thus, only
unbound variables occur in the semitrace.
* added the untested claims back in, so that all events in a
role/semitrace are now shown. Note that they can be disabled
again by using the new '-H' switch.
- Some fixes for protocols that do not include matching send/read
combo's. In particular, the max encryption level method ranged over
the sends; now over all events. Maybe it can range over read events
only?
* Hiding of 'discouraged' options: these should not be used by e.g. students.
* Hiding of 'unimportant' options: not harmful, but not often used either.
