Empirically Successful Automated Reasoning in Large Theories

@inproceedings{Sutcliffe2007EmpiricallySA,
  title={Empirically Successful Automated Reasoning in Large Theories},
  author={Geoff Sutcliffe and Stephan Schulz},
  year={2007}
}
Decision procedures for checking satisfiability of logical formulas are crucial for many verification applications. Of particular recent interest are solvers for Satisfiability Modulo Theories (SMT). SMT solvers decide logical satisfiability (or dually, validity) of formulas in classical multi-sorted first-order logic with equality, with respect to a background theory. The success of SMT for verification applications is largely due to the suitability of supported background theories for… CONTINUE READING

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…