Invariant synthesis for combined theories

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

Volumn 4349 LNCS, Issue , 2007, Pages 378-394

  Beyer, Dirk ^a   Henzinger, Thomas A ^b   Majumdar, Rupak ^c   Rybalchenko, Andrey ^b,d  

^a SIMON FRASER UNIVERSITY   (Canada)

^b EPFL   (Switzerland)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DIGITAL ARITHMETIC; FUNCTIONS;

COMBINED THEORY; MEMORY ALLOCATORS; PROGRAM CORRECTNESS; UNINTERPRETED FUNCTION SYMBOLS;

INVARIANCE;

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

References (23)

1. T. Ball and S. K. Rajamani. The SLAM project: Debugging system software via static analysis. In Proc. POPL, pages 1-3. ACM, 2002.
2. A. R. Bradley, Z. Manna, and H. B. Sipma. What's decidable about arrays? In Proc. VMCAI, LNCS 3855, pages 427-442. Springer, 2006.
3. C. C. Chang and H. J. Keisler. Model Theory. North-Holland, 3rd edition, 1990.
4. G. E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Automata Theory and Formal Languages, LNCS 33, pages 134-183. Springer, 1975.
5. M. Colón, S. Sankaranarayanan, and H. B. Sipma. Linear invariant generation using non-linear constraint solving. In Proc. CAV, LNCS 2725, pages 420-432. Springer, 2003.
6. P. Cousot. Proving program invariance and termination by parametric abstraction, Lagrangian relaxation and semidefinite programming. In Proc. VMCAI, LNCS 3385. Springer, 2005.
7. P. Cousot and R. Cousot. Comparing the Galois connection and widening/narrowing approaches to abstract interpretation. In Proc. PLILP, LNCS 631, pages 269-295. Springer, 1992.
8. C. Flanagan, K. R. M. Leino, M. Lillibridge, G. Nelson, J. B. Saxe, and R. Stata. Extended static checking for Java. In Proc. PLDI, pages 234-245. ACM, 2002.
9. R. W. Floyd. Assigning meanings to programs. In Mathematical Aspects of Computer Science, pages 19-32. AMS, 1967.
10. S. Gulwani and A. Tiwari. Combining abstract interpreters. In Proc. PLDI, pages 376-386. ACM, 2006.
11. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Proc. POPL, pages 58-70. ACM, 2002.
12. C Holzbaur. OFAI clp(q,r) Manual, Edition 1.3.3. Austrian Research Institute for Artificial Intelligence, Vienna, 1995. TR-95-09.
13. D. Kapur. Automatically generating loop invariants using quantifier elimination. In Proc. Deduction and Applications, volume 05431. IBFI Schloss Dagstuhl, 2006.
14. D. Kapur and C. Zarba. A reduction approach to decision procedures. Technical Report TR-CS-2005-44, University of New Mexico, 2005.
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. Z. Manna and A. Pnueli. Temporal verification of reactive systems: Safety. Springer, 1995.
17. J. McCarthy. Towards a mathematical science of computation. In Proc. IFIP Congress, pages 21-28. North-Holland, 1962.
18. G. Nelson. Techniques for program verification. Technical Report CSL81-10, Xerox Palo Alto Research Center, 1981.
19. S. Sankaranarayanan, H. B. Sipma, and Z. Manna. Constraint-based linear-relations analysis. In Proc. SAS, LNCS 3148, pages 53-68. Springer, 2004.
20. S. Sankaranarayanan, H. B. Sipma, and Z. Manna. Non-linear loop invariant generation using Gröbner bases. In Proc. POPL, pages 318-329. ACM, 2004.
21. S. Sankaranarayanan, H. B. Sipma, and Z. Manna. Scalable analysis of linear systems using mathematical programming. In Proc. VMCAI, LNCS 3385, pages 25-41. Springer, 2005.
22. A. Schrijver. Theory of Linear and Integer Programming. Wiley, 1986.
23. V. Sofronie-Stokkermans. Hierarchic reasoning in local theory extensions. In Proc. CADE, LNCS 3632, pages 219-234. Springer, 2005.