Constraint solving for interpolation

Journal of Symbolic Computation

Volumn 45, Issue 11, 2010, Pages 1212-1233

  Rybalchenko, Andrey ^a   Sofronie Stokkermans, Viorica ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Constraint solving; Hierarchical reasoning; Interpolation; Program verification

Indexed keywords

EID: 77956491017     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2010.06.005     Document Type: Article

References (36)

1. Beyer D., Zufferey D., Majumdar R. CSIsat: interpolation for LA+EUF. LNCS 2008, vol. 5123:304-308.
2. Bradley A.R., Manna Z., Sipma H.B. Linear ranking with reachability. LNCS 2005, vol. 3576:491-504. Springer.
3. Cimatti A., Griggio A., Sebastiani R. Efficient interpolant generation in satisfiability modulo theories. LNCS 2008, vol. 4963:397-412. C.R. Ramakrishnan, J. Rehof (Eds.).
4. Cimatti A., Griggio A., Sebastiani R. Interpolant generation for UTVPI. LNCS 2009, vol. 5663:167-182. R.A. Schmidt (Ed.).
5. Colón M., Sankaranarayanan S., Sipma H. Linear invariant generation using non-linear constraint solving. LNCS 2003, vol. 2725:420-432. Springer.
6. Cousot P. Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming. LNCS 2005, vol. 3385:1-24. Springer.
7. Craig W. Linear reasoning. A new form of the Herbrand-Gentzen theorem. Journal of Symbolic Logic 1957, 22(3):250-268.
8. Esparza J., Kiefer S., Schwoon S. Abstraction refinement with Craig interpolation and symbolic pushdown systems. LNCS 2006, vol. 3920:489-503. Springer.
9. Goel A., Krstic S., Tinelli C. Ground interpolation for combined theories. LNCS 2009, vol. 5663:183-198. R.A. Schmidt (Ed.).
10. Henzinger T.A., Jhala R., Majumdar R., McMillan K.L. Abstractions from proofs. POPL'2004: Principles of Programming Languages 2004, 232-244. ACM Press.
11. Holzbaur, C., OFAI clp(q,r) Manual, Edition 1.3.3. Austrian Research Institute for Artificial Intelligence, Vienna, 1995. TR-95-09.
12. Jaffar J., Michaylov S. Methodology and implementation of a CLP system. ICLP'1987: Int. Conf. on Logic Programming 1987, vol. 1:196-218. MIT Press.
13. Jhala R., McMillan K.L. Interpolant-based transition relation approximation. Lecture Notes in Computer Science 2005, vol. 3576:39-51. Springer.
14. Jhala R., McMillan K.L. A practical and complete approach to predicate refinement. LNCS 2006, vol. 3920:459-473. Springer.
15. Kapur D., Majumdar R., Zarba C.G. Interpolation for data structures. FSE'2006: Foundations of Software Engineering 2006, 105-116. ACM.
16. Koubarakis M. Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning. Theoretical Computer Science 2001, 266(1-2):311-339.
17. Kovács L., Voronkov A. Interpolation and symbol elimination. LNCS 2009, vol. 5663:199-213. R.A. Schmidt (Ed.).
18. Krajícek J. Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic. Journal of Symbolic Logic 1997, 62(2):457-486.
19. Lynch C., Tang Y. Interpolants for linear arithmetic in SMT. LNCS 2008, vol. 5311:156-170.
20. McMillan K.L. Interpolation and SAT-based model checking. LNCS 2003, vol. 2725:1-13. Springer.
21. McMillan K.L. An interpolating theorem prover. Theoretical Computer Science 2005, 345(1):101-121.
22. McMillan K.L. Lazy abstraction with interpolants. LNCS 2006, vol. 4144:123-136. Springer.
23. McMillan K.L. Quantified invariant generation using an interpolating saturation prover. LNCS 2008, vol. 4963:413-427. C.R. Ramakrishnan, J. Rehof (Eds.).
24. Meyer R., Faber J., Hoenicke J., Rybalchenko A. Model checking duration calculus: a practical approach. FACS: Formal Aspects of Computing 2008.
25. Meyer R., Faber J., Rybalchenko A. Model checking duration calculus: A practical approach. LNCS 2006, vol. 4281:332-346. Springer.
26. Miné A. The octagon abstract domain. Higher-Order and Symbolic Computation 2006, 19(1):31-100.
27. Podelski A., Rybalchenko A. ARMC: the logical choice for software model checking with abstraction refinement. LNCS 2007, vol. 4354:245-259. Springer.
28. Pudlák P. Lower bounds for resolution and cutting plane proofs and monotone computations. Journal of Symbolic Logic 1997, 62(3):981-998.
29. Rybalchenko A., Sofronie-Stokkermans V. Constraint solving for interpolation. VMCAI 2007, 346-362.
30. Schrijver A. Theory of Linear and Integer Programming 1986, John Wiley & Sons Ltd.
31. Sofronie-Stokkermans V. Hierarchic reasoning in local theory extensions. LNCS 2005, vol. 3632:219-234. Springer.
32. Sofronie-Stokkermans V. Interpolation in local theory extensions. LNCS 2006, vol. 4130:235-250. Springer.
33. Sofronie-Stokkermans V. Interpolation in local theory extensions. Logical Methods in Computer Science 2008, 4(4). Paper 1.
34. Sontag E. Real addition and the polynomial hierarchy. Information Processing Letters 1985, 20(3):115-120.
35. T.I.S. Laboratory, SICStus Prolog User's Manual. Swedish Institute of Computer Science, PO Box 1263 SE-164 29 Kista, Sweden, October 2001. Release 3.8.7.
36. Yorsh G., Musuvathi M. A combination method for generating interpolants. LNCS 2005, vol. 3632:353-368. Springer.