Quantifier instantiation techniques for finite model finding in SMT

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7898 LNAI, Issue , 2013, Pages 377-391

  Reynolds, Andrew ^a   Tinelli, Cesare ^a   Goel, Amit ^b   Krstić, Sava ^b   Deters, Morgan ^c   Barrett, Clark ^c  

^a University of Iowa   (United States)

^b INTEL CORPORATION   (United States)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COUNTER-MODELS; DOMAIN SIZE; EXPERIMENTAL EVIDENCE; FINITE DOMAINS; FINITE MODEL; ON DEMANDS; SATISFIABILITY; SMT SOLVERS;

INDUSTRIAL APPLICATIONS;

FORMAL LOGIC;

EID: 84879972079     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38574-2_26     Document Type: Conference Paper

References (15)

1. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)
2. Baumgartner, P., Tinelli, C.: The Model Evolution calculus as a first-order DPLL method. Artificial Intelligence 172, 591-632 (2008)
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)
4. Blanchette, J.C.: Personal communication (2013)
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)
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)
7. Ganzinger, H., Korovin, K.: New directions in instantiation-based theorem proving. In: Proceedings of LICS 2003, pp. 55-64. IEEE Computer Society (2003)
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)
9. Goel, A., Krstic, S., Tuttle, R.L.M.: SMT-based system verification with DVF. In: Proceedings of SMT 2012 (2012)
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)
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)
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)
13. Reynolds, A., Tinelli, C., Goel, A., Krstić, S.: Finite model finding in SMT. In: Proceedings of CAV 2013. LNCS. Springer (accepted, 2013)
14. Tuttle, M.R., Goel, A.: Protocol proof checking simplified with SMT. In: Proceedings of NCA 2012, pp. 195-202. IEEE Computer Society (2012)
15. Zhang, J., Zhang, H.: SEM: a system for enumerating models. In: Proceedings of IJCAI 1995, pp. 298-303 (1995)