andr3/scyther
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
1,582 Commits 1 Branch 0 Tags 21 MiB
d4c188659c
Commit Graph

24 Commits

Author SHA1 Message Date
Cas Cremers
d06247fcfe Updating time stamps for next release. 2013-10-05 23:56:12 +01:00
Cas Cremers
5608b29dc0 Refactored first_origination code. 2012-05-01 14:46:01 +02:00
Cas Cremers
1cbe9826ac Updated dates. 2012-04-24 13:56:51 +02:00
Cas Cremers
739f59174f Removed unused functions. 2008-08-21 16:58:12 +02:00
Cas Cremers
03522b7108 Try to not draw duplicate arrows. 
This cleans up some graphs rather nicely. There is only one potential
drawback (not observed in practive):
If two bindings have the same from/to, but different interpretations,
we might lose information. In particular the 'select' intermediate nodes might
pose a problem and we would be better off by not having any interpretation on
what is selected.
 2008-01-16 11:55:15 +01:00
Cas Cremers
7d584cca1e Added GPL 2 License to the C sources. 
A first step towards releasing Scyther completely to the public.
 2007-06-11 14:01:04 +02:00
ccremers
d2058d937b - Revised cost heuristic. Trace length is no longer the real 
optimization.
 2006-04-02 12:29:02 +00:00
ccremers
895852de89 - Added iterators. 
- More space in encryption notation for better readability.
 2006-03-10 14:48:40 +00:00
ccremers
0ce88af6ac - [[[ Broken commit ]]] 
Committing partial new Warshall work because it is getting too big.
 2006-02-26 15:00:58 +00:00
ccremers
da75862d82 - Huge code documentation effort. 2006-01-02 21:06:08 +00:00
ccremers
cb315aafc8 - Added '--extend-trivial' switch. This is not a complete '--extend' 
algorithm, as it is pretty dumb, but it works in most cases. Use with
  care.
 2005-08-12 12:13:50 +00:00
ccremers
f22ce0dcb9 - Big change in the Arachne algorithm: decryptor sequences now get 
expanded explicitly. This solves a long-standing issue with {k}k
  decryption to yield k. Needs some testing to ensure that it did not
  introduce any new errors.
 2005-05-17 18:45:01 +00:00
ccremers
820c2caed8 - Revisited type matching conditions. 
- Introduced tuple unfolding stuff for Arachne. -m2 should work now.
 2005-01-14 18:18:40 +00:00
ccremers
19b3c74e65 - Remove obsolete child parameter. 2004-10-18 13:06:22 +00:00
ccremers
94b3ac7c96 - Added debug code for dot output. 
- Push/pop goals are counted now, making the child parameter obsolete.
 2004-10-18 13:04:34 +00:00
ccremers
391c939b83 - New algorithm to draw bindings between runs. Much cleaner. 2004-08-28 13:47:37 +00:00
ccremers
4f534410bd - Implemented ordering checks. Need some test to validate this though. 2004-08-27 19:06:15 +00:00
ccremers
72d52a6e12 - Key goals now have priority. This strategy yields complete proofs for 
e.g. bke, and reduces states for NSL.
 2004-08-20 10:52:40 +00:00
ccremers
b2d21f0a8a BROKEN 
- Working on new algorithm. Some memory error can occur.
 2004-08-18 14:06:14 +00:00
ccremers
b2838ed1e4 - Made a start with the new version. 2004-08-17 15:52:52 +00:00
ccremers
5dd6127e4b - Added term to binding relation. 2004-08-17 11:03:18 +00:00
ccremers
91a679a129 - Made the output of the semistate include the bindings. 2004-08-15 17:50:41 +00:00
ccremers
28782548b0 - Implemented cycle detection. Untested. 2004-08-15 14:07:34 +00:00
ccremers
ef2586236c - Added bindings module. 2004-08-15 11:55:22 +00:00