Tue, 17 Nov 2009 13:51:56 +0100 merged
blanchet [Tue, 17 Nov 2009 13:51:56 +0100] rev 33736
merged
Tue, 17 Nov 2009 13:51:16 +0100 use SAT solver that's available everywhere for this example
blanchet [Tue, 17 Nov 2009 13:51:16 +0100] rev 33735
use SAT solver that's available everywhere for this example
Tue, 17 Nov 2009 13:50:46 +0100 invoke Kodkodi from Nitpick using new $KODKOD/bin/kodkodi script;
blanchet [Tue, 17 Nov 2009 13:50:46 +0100] rev 33734
invoke Kodkodi from Nitpick using new $KODKOD/bin/kodkodi script; this requires downloading Kodkodi 1.2.4, or writing a "kodkodi" script that invokes "java de.tum.in.isabelle.Kodkodi.Kodkodi $@"
Tue, 17 Nov 2009 10:58:37 +0100 merged
blanchet [Tue, 17 Nov 2009 10:58:37 +0100] rev 33733
merged
Mon, 16 Nov 2009 11:03:08 +0100 added constraint for Eq^- in Nitpick's implementation of the monotonicity calculus
blanchet [Mon, 16 Nov 2009 11:03:08 +0100] rev 33732
added constraint for Eq^- in Nitpick's implementation of the monotonicity calculus
Mon, 16 Nov 2009 10:24:28 +0100 change the order in which Nitpick tries SAT solvers;
blanchet [Mon, 16 Nov 2009 10:24:28 +0100] rev 33731
change the order in which Nitpick tries SAT solvers; so that the binary JNIs come further down the list and can easily be overridden
(0) -30000 -10000 -3000 -1000 -300 -100 -30 -10 -6 +6 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip