Mon, 01 Feb 2010 21:59:27 +0100 More mixin tests.
ballarin [Mon, 01 Feb 2010 21:59:27 +0100] rev 36089
More mixin tests.
Mon, 01 Feb 2010 21:55:00 +0100 Use serial to be more debug friendly.
ballarin [Mon, 01 Feb 2010 21:55:00 +0100] rev 36088
Use serial to be more debug friendly.
Wed, 07 Apr 2010 20:40:42 +0200 buffered output (faster than direct output)
boehmes [Wed, 07 Apr 2010 20:40:42 +0200] rev 36087
buffered output (faster than direct output)
Wed, 07 Apr 2010 20:40:42 +0200 simplified Cache_IO interface (input is just a string and not already stored in a file)
boehmes [Wed, 07 Apr 2010 20:40:42 +0200] rev 36086
simplified Cache_IO interface (input is just a string and not already stored in a file)
Wed, 07 Apr 2010 20:40:42 +0200 shortened interface (do not export unused options and functions)
boehmes [Wed, 07 Apr 2010 20:40:42 +0200] rev 36085
shortened interface (do not export unused options and functions)
Wed, 07 Apr 2010 20:40:42 +0200 always unfold definitions of specific constants (including special binders)
boehmes [Wed, 07 Apr 2010 20:40:42 +0200] rev 36084
always unfold definitions of specific constants (including special binders)
Wed, 07 Apr 2010 20:40:42 +0200 shorten the code by conditional function application
boehmes [Wed, 07 Apr 2010 20:40:42 +0200] rev 36083
shorten the code by conditional function application
Wed, 07 Apr 2010 20:38:11 +0200 fail for problems containg the universal sort (as those problems cannot be atomized)
boehmes [Wed, 07 Apr 2010 20:38:11 +0200] rev 36082
fail for problems containg the universal sort (as those problems cannot be atomized)
Wed, 07 Apr 2010 19:48:58 +0200 renamed "smt_record" to "smt_fixed" (somewhat more expressive) and inverted its semantics
boehmes [Wed, 07 Apr 2010 19:48:58 +0200] rev 36081
renamed "smt_record" to "smt_fixed" (somewhat more expressive) and inverted its semantics
Wed, 07 Apr 2010 17:24:44 +0200 Added Information theory and Example: dining cryptographers
hoelzl [Wed, 07 Apr 2010 17:24:44 +0200] rev 36080
Added Information theory and Example: dining cryptographers
Wed, 07 Apr 2010 11:05:11 +0200 simplified induction case in finite_psubset_induct; tuned the proof that uses this induction principle
Christian Urban <urbanc@in.tum.de> [Wed, 07 Apr 2010 11:05:11 +0200] rev 36079
simplified induction case in finite_psubset_induct; tuned the proof that uses this induction principle
Tue, 06 Apr 2010 11:00:57 +0200 removed (latex output) notation which is sometimes very ugly
krauss [Tue, 06 Apr 2010 11:00:57 +0200] rev 36078
removed (latex output) notation which is sometimes very ugly
Tue, 06 Apr 2010 10:48:16 +0200 merged
boehmes [Tue, 06 Apr 2010 10:48:16 +0200] rev 36077
merged
Tue, 06 Apr 2010 10:46:28 +0200 added missing mult_1_left to linarith simp rules
boehmes [Tue, 06 Apr 2010 10:46:28 +0200] rev 36076
added missing mult_1_left to linarith simp rules
Tue, 06 Apr 2010 09:27:03 +0200 tuned proof (no induction needed); removed unused lemma and fuzzy comment
krauss [Tue, 06 Apr 2010 09:27:03 +0200] rev 36075
tuned proof (no induction needed); removed unused lemma and fuzzy comment
(0) -30000 -10000 -3000 -1000 -300 -100 -15 +15 +100 +300 +1000 +3000 +10000 +30000 tip