Finding conflicting instances of quantified formulas in SMT

@article{Reynolds2014FindingCI,
  title={Finding conflicting instances of quantified formulas in SMT},
  author={Andrew Reynolds and Cesare Tinelli and Leonardo Mendonça de Moura},
  journal={2014 Formal Methods in Computer-Aided Design (FMCAD)},
  year={2014},
  pages={195-202}
}
In the past decade, Satisfiability Modulo Theories (SMT) solvers have been used successfully in a variety of applications including verification, automated theorem proving, and synthesis. While such solvers are highly adept at handling ground constraints in several decidable background theories, they primarily rely on heuristic quantifier instantiation methods such as E-matching to process quantified formulas. The success of these methods is often hindered by an overproduction of instantiations… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Cvc4

C. Barrett, C. Conway, +5 authors C. Tinelli
Proceedings of CAV’11, volume 6806 of LNCS, pages 171–177. Springer, • 2011
View 16 Excerpts
Highly Influenced

The Satisfiability Modulo Theories Library (SMT-LIB)

C. Barrett, A. Stump, C. Tinelli
www.SMT-LIB.org, • 2010
View 11 Excerpts
Highly Influenced

Cvc3

C. Barrett, C. Tinelli
W. Damm and H. Hermanns, editors, Proceedings of the 19th International Conference on Computer Aided Verification (CAV ’07), volume 4590 of Lecture Notes in Computer Science, pages 298–302. Springer-Verlag, July • 2007
View 5 Excerpts
Highly Influenced

, and C . Tinelli . Solving SAT and SAT Modulo Theories : from an Abstract Davis - Putnam - Logemann - Loveland Procedure to DPLL ( T )

A. Oliveras Nieuwenhuis
Journal of the ACM • 2008

Korovin . iprover – an instantiation - based theorem prover for first - order logic ( system description )

S. Jacobs Ihlemann, V. Sofronie-Stokkermans
On local reasoning in verification . In Tools and Algorithms for the Construction and Analysis of Systems • 2008

Similar Papers

Loading similar papers…