From strong amalgamability to modularity of quantifier-free interpolation

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

Volumn 7364 LNAI, Issue , 2012, Pages 118-133

  Bruttomesso, Roberto ^a   Ghilardi, Silvio ^a   Ranise, Silvio ^b  

^a UNIVERSITY OF MILAN   (Italy)

^b FONDAZIONE BRUNO KESSLER   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPONENT THEORIES; INTERPOLANTS; INTERPOLATION ALGORITHMS; SUFFICIENT AND NECESSARY CONDITION; SUFFICIENT CONDITIONS; SYNTACTIC CHARACTERIZATION;

METALS;

INTERPOLATION;

EID: 84863633080     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31365-3_12     Document Type: Conference Paper

References (32)

1. Bacsich, P.D.: Amalgamation properties and interpolation theorems for equational theories. Algebra Universalis 5, 45-55 (1975)
2. 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)
3. Bozzano, M., Bruttomesso, R., Cimatti, A., Junttila, T., Ranise, S., van Rossum, P., Sebastiani, R.: Efficient Satisfiability Modulo Theories via Delayed Theory Combination. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 335-349. Springer, Heidelberg (2005) (Pubitemid 41431746)
4. Brillout, A., Kroening, D., Rümmer, P., Wahl, T.: An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic. In: Giesl, J., Hähnle, R. (eds.) IJCAR 2010. LNCS, vol. 6173, pp. 384-399. Springer, Heidelberg (2010)
5. Brillout, A., Kroening, D., Rümmer, P., Wahl, T.: Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 88-102. Springer, Heidelberg (2011)
6. Bruttomesso, R., Ghilardi, S., Ranise, S.: A Combination of Rewriting and Constraint Solving for the Quantifier-Free Interpolation of Arrays with Integer Difference Constraints. In: Tinelli, C., Sofronie-Stokkermans, V. (eds.) FroCos 2011. LNCS, vol. 6989, pp. 103-118. Springer, Heidelberg (2011)
7. Bruttomesso, R., Ghilardi, S., Ranise, S.: Rewriting-based Quantifier-free Interpolation for a Theory of Arrays. In: RTA (2011)
8. Bruttomesso, R., Ghilardi, S., Ranise, S.: From Strong Amalgamation to Modularity of Quantifier-Free Interpolation. Technical Report RI 337-12, Dip. Scienze dell'Informazione, Univ. di Milano (2012)
9. Bruttomesso, R., Ghilardi, S., Ranise, S.: Quantifier-Free Interpolation of a Theory of Arrays. Logical Methods in Computer Science (to appear, 2012)
10. Chang, C., Keisler, J.H.: Model Theory, 3rd edn. North-Holland, Amsterdam (1990)
11. Cimatti, A., Griggio, A., Sebastiani, R.: Efficient Interpolant Generation in Satisfiability Modulo Theories. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 397-412. Springer, Heidelberg (2008)
12. Enderton, H.B.: A Mathematical Introduction to Logic. Academic Press, New York (1972)
13. Fuchs, A., Goel, A., Grundy, J., Krstić, S., Tinelli, C.: Ground Interpolation for the Theory of Equality. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 413-427. Springer, Heidelberg (2009)
14. Ghilardi, S.: Model theoretic methods in combined constraint satisfiability. Journal of Automated Reasoning 33(3-4), 221-249 (2004)
15. Goel, A., Krstić, S., Tinelli, C.: Ground Interpolation for Combined Theories. In: Schmidt, R.A. (ed.) CADE 2009. LNCS, vol. 5663, pp. 183-198. Springer, Heidelberg (2009)
16. Henzinger, T., McMillan, K.L., Jhala, R., Majumdar, R.: Abstractions from Proofs. In: POPL (2004)
17. Mal'cev, A.I.: Axiomatizable classes of locally free algebras of certain types. Sibirsk. Mat. Ž. 3, 729-743 (1962)
18. Jhala, R., McMillan, K.L.: A Practical and Complete Approach to Predicate Refinement. In: Hermanns, H. (ed.) TACAS 2006. LNCS, vol. 3920, pp. 459-473. Springer, Heidelberg (2006) (Pubitemid 44019391)
19. Jónsson, B.: Universal relational systems. Math. Scand. 4, 193-208 (1956)
20. Kapur, D., Majumdar, R., Zarba, C.: Interpolation for Data Structures. In: SIGSOFT 2006/FSE-14, pp. 105-116 (2006)
21. Kiss, E.W., Márki, L., Pröhle, P., Tholen, W.: Categorical algebraic properties. A compendium on amalgamation, congruence extension, epimorphisms, residual smallness, and injectivity. Studia Sci. Math. Hungar. 18(1), 79-140 (1982)
22. Kovács, L., Voronkov, A.: Finding Loop Invariants for Programs over Arrays Using a Theorem Prover. In: Chechik, M., Wirsing, M. (eds.) FASE 2009. LNCS, vol. 5503, pp. 470-485. Springer, Heidelberg (2009)
23. McMillan, K.: Interpolants from Z3 proofs. In: Proc. of FMCAD (2011)
24. McMillan, K.L.: An Interpolating Theorem Prover. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 16-30. Springer, Heidelberg (2004)
25. McMillan, K.L.: An Interpolating Theorem Prover. Theor. Comput. Sci. 345(1), 101-121 (2005)
26. Nelson, G., Oppen, D.C.: Simplification by Cooperating Decision Procedures. ACM Transactions on Programming Languages and Systems 1(2), 245-257 (1979)
27. Oppen, D.C.: Reasoning about recursively defined data structures. Journal of the ACM 27, 403-411 (1980)
28. Ringel, C.M.: The intersection property of amalgamations. J. Pure Appl. Algebra 2, 341-342 (1972)
29. Rybalchenko, A., Sofronie-Stokkermans, V.: Constraint Solving for Interpolation. J. of Symbolic Logic 45(11), 1212-1233 (2010)
30. Sofronie-Stokkermans, V.: Interpolation in Local Theory Extensions. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 235-250. Springer, Heidelberg (2006)
31. Tinelli, C., Harandi, M.T.: A new correctness proof of the Nelson-Oppen combination procedure. In: Proc. FroCoS 1996, pp. 103-119 (1996)
32. Yorsh, G., Musuvathi, M.: A Combination Method for Generating Interpolants. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 353-368. Springer, Heidelberg (2005); Extended version available as Technical Report MSR-TR-2004-108, Microsoft Research (October 2004)