Ground interpolation for combined theories

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

Volumn 5663 LNAI, Issue , 2009, Pages 183-198

  Goel, Amit ^a   Krstić, Sava ^a   Tinelli, Cesare ^b  

^a INTEL CORPORATION   (United States)

^b The University of Iowa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERPOLANTS; LITERALS; MODULAR GENERATION; NOVEL ALGORITHM; PROOF TREE; SEARCH STRATEGIES;

ALGORITHMS;

AUTOMATION;

EID: 69949135753     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02959-2_16     Document Type: Conference Paper

References (18)

1. Andrews, P.B.: Resolution with merging. J. ACM 15(3), 367-381 (1968)
2. Barrett, C., et al.: Satisfiability Modulo Theories. In: Biere, A., et al. (eds.) Handbook of Satisfiability, pp. 825-885. IOS Press, Amsterdam (2009)
3. Beyer, D., Zufferey, D., Majumdar, R.: CSIsat: Interpolation for LA+EUF. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 304-308. Springer, Heidelberg (2008)
4. Bozzano, M., et al.: Efficient theory combination via Boolean search. Information and Computation 204(10), 1493-1525 (2006)
5. Büning, H.K., Lettmann, T.: Propositional Logic: Deduction and Algorithms. Cambridge University Press, New York (1999)
6. Cimatti, A., Griggio, A., Sebastiani, R.: Efficient interpolant generation in Satis-fiability Modulo Theories. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 397-412. Springer, Heidelberg (2008)
7. de Moura, L., Bjørner, N.: Model-based theory combination. ENTCS 198, 37-49 (2008)
8. Dutertre, B., de Moura, L.: A fast linear-arithmetic solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81-94. Springer, Heidelberg (2006)
9. Fuchs, A., et al.: Ground interpolation for the theory of equality. In: TACAS. LNCS, vol. 5505, pp. 413-427. Springer, Heidelberg (2009)
10. Henzinger, T.A., et al.: Abstractions from proofs. In: POPL, pp. 232-244. ACM, New York (2004)
11. Jhala, R., McMillan, K.L.: Interpolant-based transition relation approximation. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 39-51. Springer, Heidelberg (2005)
12. Krstić, S., Goel, A.: Architecting solvers for SAT Modulo Theories: Nelson-Oppen with DPLL. In: Konev, B., Wolter, F. (eds.) FroCos 2007. LNCS, vol. 4720, pp. 1-27. Springer, Heidelberg (2007)
13. McMillan, K.L.: Interpolation and SAT-based model checking. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 1-13. Springer, Heidelberg (2003)
14. McMillan, K.L.: An interpolating theorem prover. Theoretical Computer Science 345(1), 101-121 (2005)
15. McMillan, K.L.: Lazy abstraction with interpolants. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 123-136. Springer, Heidelberg (2006)
16. Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Abstract DPLL and abstract DPLL modulo theories. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS, vol. 3452, pp. 36-50. Springer, Heidelberg (2005)
17. Rybalchenko, A., Sofronie-Stokkermans, V.: Constraint solving for interpolation. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 346-362. Springer, Heidelberg (2007)
18. Yorsh, G., Musuvathi, M.: A combination method for generating interpolants. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS, vol. 3632, pp. 353-368. Springer, Heidelberg (2005)