- Added a good idea for the output.

This commit is contained in:
ccremers 2004-08-18 21:44:30 +00:00
parent c929fa6ea3
commit d73351ace7

View File

@ -1,3 +1,10 @@
- If there is a limit on the runs for Arachne, but this limit is never
reached, the proof is still complete. The same goes for other bounds. We
thus need a flag to indicate that a state was pruned because of a bound.
Then, we get more possible results for the output.
1. Correct and complete
2. Correct within bounds
3. Incorrect
- Fix term encryption level pruning for arachne, depending on the match type. - Fix term encryption level pruning for arachne, depending on the match type.
- Constraint logic now also has no checks for when a run is done by the - Constraint logic now also has no checks for when a run is done by the
intruder (which should be excluded). intruder (which should be excluded).