honours/impl/test, branch master My honours project from 2012. http://onix.zancanaro.id.au/Archive/honours/atom?h=master 2012-11-29T05:39:52Z A test I forgot to commit earlier. 2012-11-29T05:39:52Z Carlo Zancanaro carlo@carlo-laptop 2012-11-29T05:39:52Z urn:sha1:77a327835f40a59a1419b156a2c02c2ef60a7172 Fixing up some equation system stuff. 2012-11-01T09:02:14Z Zancanaro; Carlo czan8762@plang3.cs.usyd.edu.au 2012-11-01T09:02:14Z urn:sha1:ff5ec13849a69ef4a53bab009eed880456931a14 Adding function arguments to the system, as well as making it slightly easier to read. A bunch of fixes to the solver, and moving it in to clang. 2012-11-01T07:06:13Z Zancanaro; Carlo czan8762@plang3.cs.usyd.edu.au 2012-11-01T07:06:13Z urn:sha1:b7eaa99578037789a337c5061c0ea8ee3150b63c Also some contribution writing stuff. Basically: lots of work. Merge branch 'master' of ssh://bitbucket.org/czan/honours 2012-10-30T09:56:38Z Carlo Zancanaro carlo@carlo-laptop 2012-10-30T09:56:38Z urn:sha1:6a4786bde976e9a023c7f65a395384d214c5102c Conflicts: impl/test/run Don't show stderr in tests. That's just annoying. 2012-10-27T02:37:57Z Carlo Zancanaro carlo@carlo-laptop 2012-10-27T02:37:57Z urn:sha1:97a9582ec8928624cd78146ae060aadfd92a9b22 Add some tests, and stuff. 2012-10-26T05:35:28Z Carlo Zancanaro carlo@pc-4w14-0.cs.usyd.edu.au 2012-10-26T05:35:28Z urn:sha1:e5e937b77b45dd683af97da82f8c8a1761c6d4f0 Add a fix for mutually-recursive infinite things 2012-10-23T23:34:15Z Carlo Zancanaro carlo@carlo-laptop 2012-10-23T23:34:15Z urn:sha1:a3860a4cd6ca6a1ee664634ea472b5487535b2b5 So now it will solve correctly for x = y + 1 y = max(0, x + 1) I also added in tests for this (and a slightly different form with `x` going through another variable, `z`, for indirection). The tests will also stop now after five seconds of execution. If they can't be solved in five seconds then they're considered a failure. Another fix, with a test for what the problem was. 2012-10-23T07:03:33Z Carlo Zancanaro carlo@carlo-laptop 2012-10-23T07:03:33Z urn:sha1:8253e957e54d31699b4bd827300bc1fa794c4660 Make the recursive solver work properly. 2012-10-23T03:40:38Z Carlo Zancanaro carlo@carlo-laptop 2012-10-23T03:40:38Z urn:sha1:a1b28d756fe52a53d9d4da4d23853969fd529115 If you ignore the intermediate results for the strategy iteration phase then you're in the clear! I think! Okay, the solver is now correct. 2012-10-22T03:44:57Z Carlo Zancanaro carlo@pc-4w14-0.cs.usyd.edu.au 2012-10-22T03:44:57Z urn:sha1:86ca7448849aaaea6db34b1d2bcf8d99d7d7b12c It runs in two separate passes: - improve strategy (for all) - evaluate fixpoint Unfortunately this loses out on locality at the moment. I really want a local solver, so I'll have to see what I can do about that.