Quantifier Instantiation Techniques for Finite Model Finding in SMT

  • Andrew Reynolds
  • Cesare Tinelli
  • Amit Goel
  • Sava Krstić
  • Morgan Deters
  • Clark Barrett
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7898)

Abstract

SMT-based applications increasingly rely on SMT solvers being able to deal with quantified formulas. Current work shows that for formulas with quantifiers over uninterpreted sorts counter-models can be obtained by integrating a finite model finding capability into the architecture of a modern SMT solver. We examine various strategies for on-demand quantifier instantiation in this setting. Here, completeness can be achieved by considering all ground instances over the finite domain of each quantifier. However, exhaustive instantiation quickly becomes unfeasible with larger domain sizes. We propose instantiation strategies to identify and consider only a selection of ground instances that suffices to determine the satisfiability of the input formula. We also examine heuristic quantifier instantiation techniques such as E-matching for the purpose of accelerating the search. We give experimental evidence that our approach is practical for use in industrial applications and is competitive with other approaches.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)Google Scholar
  2. 2.
    Baumgartner, P., Tinelli, C.: The Model Evolution calculus as a first-order DPLL method. Artificial Intelligence 172, 591–632 (2008)MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    de Moura, L., Bjørner, N.S.: Efficient E-matching for SMT solvers. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 183–198. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  4. 4.
    Blanchette, J.C.: Personal communication (2013)Google Scholar
  5. 5.
    Blanchette, J.C., Böhme, S., Paulson, L.C.: Extending Sledgehammer with SMT solvers. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS, vol. 6803, pp. 116–130. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  6. 6.
    Claessen, K., Sörensson, N.: New techniques that improve MACE-style finite model building. In: CADE-19 Workshop: Model Computation – Principles, Algorithms, Applications, pp. 11–27 (2003)Google Scholar
  7. 7.
    Ganzinger, H., Korovin, K.: New directions in instantiation-based theorem proving. In: Proceedings of LICS 2003, pp. 55–64. IEEE Computer Society (2003)Google Scholar
  8. 8.
    Ge, Y., de Moura, L.: Complete instantiation for quantified formulas in satisfiabiliby modulo theories. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 306–320. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  9. 9.
    Goel, A., Krstic, S., Tuttle, R.L.M.: SMT-based system verification with DVF. In: Proceedings of SMT 2012 (2012)Google Scholar
  10. 10.
    Jacobs, S.: Incremental instance generation in local reasoning. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 368–382. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  11. 11.
    Korovin, K.: iProver – an instantiation-based theorem prover for first-order logic (System description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 292–298. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  12. 12.
    Krstić, S., Goel, A.: Architecting solvers for SAT modulo theories: Nelson-Oppen with DPLL. In: Konev, B., Wolter, F. (eds.) FroCos 2007. LNCS (LNAI), vol. 4720, pp. 1–27. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  13. 13.
    Reynolds, A., Tinelli, C., Goel, A., Krstić, S.: Finite model finding in SMT. In: Proceedings of CAV 2013. LNCS. Springer (accepted, 2013)Google Scholar
  14. 14.
    Tuttle, M.R., Goel, A.: Protocol proof checking simplified with SMT. In: Proceedings of NCA 2012, pp. 195–202. IEEE Computer Society (2012)Google Scholar
  15. 15.
    Zhang, J., Zhang, H.: SEM: a system for enumerating models. In: Proceedings of IJCAI 1995, pp. 298–303 (1995)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Andrew Reynolds
    • 1
  • Cesare Tinelli
    • 1
  • Amit Goel
    • 2
  • Sava Krstić
    • 2
  • Morgan Deters
    • 3
  • Clark Barrett
    • 3
  1. 1.Department of Computer ScienceThe University of IowaUSA
  2. 2.Strategic CAD LabsIntel CorporationUSA
  3. 3.New York UniversityUSA

Personalised recommendations