Constraint solving for interpolation

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

Volumn 4349 LNCS, Issue , 2007, Pages 346-362

  Rybalchenko, Andrey ^a,b   Sofronie Stokkermans, Viorica ^b  

^a EPFL   (Switzerland)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIGITAL ARITHMETIC; OPTIMIZATION; VERIFICATION;

CONSTRAINT SOLVING; LINEAR ARITHMETIC; PROGRAM VERIFICATION; SYMBOLS; UNINTERPRETED FUNCTIONS;

INTERPOLATION;

EID: 36348933844     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69738-1_25     Document Type: Conference Paper

References (26)

1. B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné, D. Monniaux, and X. Rival. A static analyzer for large safety-critical software. In PLDI'2003: Programming Language Design and Implementation, pages 196-207. ACM Press, June 7-14 2003.
2. A. R. Bradley, Z. Manna, and H. B. Sipma. Linear ranking with reachability. In CAV'2005: Computer Aided Verification, volume 3576 of LNCS, pages 491-504. Springer, 2005.
3. M. Colón, S. Sankaranarayanan, and H. Sipma. Linear invariant generation using non-linear constraint solving. 420-432. In CAV'2003: Computer Aided Verification, volume 2725 of LNCS, pages 420-432. Springer, 2003.
4. P. Cousot. Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming. In VMCAI'2005: Verification, Model Checking, and Abstract Interpretation, volume 3385 of LNCS, pages 1-24. Springer, 2005.
5. W. Craig. Linear reasoning. A new form of the Herbrand-Gentzen theorem. J. Symb. Log., 22(3):250-268, 1957.
6. J. Esparza, S. Kiefer, and S. Schwoon. Abstraction refinement with Craig interpolation and symbolic pushdown systems. In TACAS'2006: Tools and Algorithms for the Construction and Analysis of Systems, volume 3920 of LNCS, pages 489-503. Springer, 2006.
7. T. A. Henzinger, R. Jhala, R. Majumdar, and K. L. McMillan. Abstractions from proofs. In POPL'2004'. Principles of Programming Languages, pages 232-244. ACM Press, 2004.
8. C Holzbaur. OFAI clp(q,r) Manual, Edition 1.3.3. Austrian Research Institute for Artificial Intelligence, Vienna, 1995. TR-95-09.
9. J. Jaffar and S. Michaylov. Methodology and implementation of a CLP system. In ICLP'1987: Int. Conf. on Logic Programming, volume 1. MIT Press, 1987.
10. R. Jhala and K. L. McMillan. Interpolant-based transition relation approximation. In CAV'2005: Computer Aided Verification, volume 3576 of Lecture Notes in Computer Science, pages 39-51. Springer, 2005.
11. R. Jhala and K. L. McMillan. A practical and complete approach to predicate refinement. In TACAS'2006: Tools and Algorithms for the Construction and Analysis of Systems, volume 3920 of LNCS, pages 459-473. Springer, 2006.
12. D. Kapur, R. Majumdar, and C. G. Zarba. Interpolation for data structures. In FSE'2006: Foundations of Software Engineering. ACM, 2006. To appear.
13. M. Koubarakis. Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning. Theoretical Computer Science, 266(1-2): 311-339, 2001.
14. J. Krajíèek. Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic. J. Symb. Log., 62(2):457-486, 1997.
15. 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.
16. K. L. McMillan. Interpolation and SAT-based model checking. In CAV'2003: Computer Aided Verification, volume 2725 of LNCS, pages 1-13. Springer, 2003.
17. K. L. McMillan. An interpolating theorem prover. Theor. Comput. Sci., 345(1):101-121, 2005.
18. K. L. McMillan. Lazy abstraction with interpolants. In CAV'2006: Computer Aided Verification, volume 4144 of LNCS, pages 123-136. Springer, 2006.
19. R. Meyer, J. Faber, and A. Rybalchenko. Model checking duration calculus: A practical approach. In ICTAC'2006: Int. Colloq. on Theoretical Aspects of Computing, volume 4281 of LNCS, pages 332-346. Springer, 2006.
20. A. Podelski and A. Rybalchenko. ARMC: the logical choice for software model checking with abstraction refinement. In PADL'2007: Practical Aspects of Declarative Languages, LNCS. Springer, 2007. to appear.
21. P. Pudlák. Lower bounds for resolution and cutting plane proofs and monotone computations. J. Symb. Log., 62(3):981-998, 1997.
22. A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons Ltd., 1986.
23. V. Sofronie-Stokkermans. Hierarchic reasoning in local theory extensions. In CADE'2005: Int. Conf. on Automated Deduction, volume 3632 of LNCS, pages 219-234. Springer, 2005.
24. V. Sofronie-Stokkermans. Interpolation in local theory extensions. In IJCAR'2006: Int. Joint Conf. on Automated Reasoning, volume 4130 of LNCS, pages 235-250. Springer, 2006.
25. E. Sontag. Real addition and the polynomial hierarchy. Information Processing Letters, 20(3):115-120, 1985.
26. G. Yorsh and M. Musuvathi. A combination method for generating interpolants. In CADE'2005: Int. Conf. on Automated Deduction, volume 3632 of LNCS, pages 353-368. Springer, 2005.