mirror of
https://github.com/Z3Prover/z3
synced 2025-04-18 22:59:02 +00:00
The fix is to remove a hack that used a theory rewriter to simplify the conversion. Now the conversion happens less often than possible. Will need more thinking to fix properly. The unsoundness at this point would cause SPACER to generate lemmas that do not block a proof obligation and then get stuck in an infinite loop blocking and generating the same lemma. |
||
---|---|---|
.. | ||
base | ||
bmc | ||
clp | ||
dataflow | ||
ddnf | ||
fp | ||
rel | ||
spacer | ||
tab | ||
transforms | ||
README |
muZ: routines related to solving satisfiability of Horn clauses and solving Datalog programs. - base - contains base routines and the main context for maintaining fixedpoint solvers - transforms - common rule transformations - rel - relational algebra based Datalog engine - pdr - PDR based Horn clause solver - clp - Dart/Symbolic execution-based solver - tab - Tabulation based solver - bmc - Bounded model checking based solver - fp - main exported routines