- Mar 22, 2017
-
-
Hans-Peter Deifel authored
Otherwise, the debugger would report the reasoner result to be "Sat" when it should really be "Unsat".
-
Hans-Peter Deifel authored
Also shows the correct binary name in the usage output.
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
- Show a prompt before each input. - Don't die if the verification of a formula fails. Show an error instead and accept the next input.
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
Array.exists is only available since OCaml 4.03.0 and we need to support version at least version 4.02.3.
-
Hans-Peter Deifel authored
This drops the rule implementation for GML and PML, because they were relying on GMLMIP which complicated the build process and didn't work completely. See Issue 19. GML and PML are still implemented as functors but currently disabled. To re-instantiate them, an OCaml implementation is needed.
-
- Mar 21, 2017
-
-
Hans-Peter Deifel authored
-
Hans-Peter Deifel authored
-
- Mar 18, 2017
-
-
Kristin Braun authored
-
- Mar 16, 2017
-
-
Hans-Peter Deifel authored
This fixes the warning "the label idx is defined in both types state and core." by renaming the label to idxS and idxC respectively.
-
Hans-Peter Deifel authored
-
Fixes the syntax of all tests that use R and B as identifiers, which are keywords now. Also disables all tests involving nominals as they are currently all throwing exceptions.
-
R and B are now keywords and were used as identifiers. Now, r and b (lowercase) is used instead in the testcases. For consistency, all other identifiers were lowercased, too.
-
The CAMLparam0() macro must be invoked at the beginning of a function that has local variables.
-
- May 21, 2016
-
-
Christoph authored
-
- May 14, 2016
- May 12, 2016
- May 10, 2016
- Apr 28, 2016
- Apr 27, 2016
-
-
Christoph authored
-
- Apr 19, 2016
-
-
Christoph authored
-
Christoph authored
We want to still have the solver for naive unsat propagation
-
Christoph authored
-
Christoph authored
-
Christoph authored
The satsolver is reatined and only updated with new clauses for every state that is generated out of a core. Once the core becomes Open (as opposed to expandable), the solver is no longer needed. This patch makes the solver a `Solver option` and gets it deallocated once no longer needed and resets the hashtable (makes it empty and zero size) to save memory. This saves about 60% memory usage on some extreme cases (e.g. exp_unsat from the CTL Benchmark set)
-
- Apr 18, 2016
-
-
Christoph authored
Instead of some calculation based of finishing on normal Cores really count proper Open States
-
- Apr 14, 2016