Generic decision procedures for axiomatic rst-order theories

@inproceedings{Dross2014GenericDP,
  title={Generic decision procedures for axiomatic rst-order theories},
  author={Claire Dross},
  year={2014}
}
SMT solvers are efficient tools to decide the satisfiability of ground formulas, including a number of built-in theories such as congruence, linear arithmetic, arrays, and bit-vectors. Adding a theory to that list requires delving into the implementation details of a given SMT solver, and is done mainly by the developers of the solver itself. For many useful theories, one can alternatively provide a first-order axiomatization. However, in the presence of quantifiers, SMT solvers are incomplete… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 71 REFERENCES