Cover algorithms and their combination

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

Volumn 4960 LNCS, Issue , 2008, Pages 193-207

  Gulwani, Sumit ^a   Musuvathi, Madan ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT INTERPRETATIONS; CONFERENCES (CHEMICAL INDUSTRY); EUROPEAN; HEIDELBERG (CO); LANGUAGES AND SYSTEMS; LINEAR ARITHMETIC; PROGRAM ANALYSIS; QUANTIFIER ELIMINATION (QE); SYMBOLIC MODEL CHECKING; UNINTERPRETED FUNCTIONS; VERIFICATION TECHNIQUES;

BOOLEAN FUNCTIONS; COMPUTER SOFTWARE; DIGITAL ARITHMETIC; EIGENVALUES AND EIGENFUNCTIONS; LEARNING SYSTEMS; MODEL CHECKING; PROGRAM INTERPRETERS;

PROGRAMMING THEORY;

EID: 47249132975     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78739-6_16     Document Type: Conference Paper

References (17)

1. Ball, T., Rajamani, S.K.: The SLAM project: Debugging system software via static analysis. In: 29th Annual Symposium on POPL, pp. 1-3 (2002)
2. Beyer, D., Henzinger, T., Majumdar, R., Rybalchenko, A.: Invariant synthesis for combined theories. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 378-394. Springer, Heidelberg (2007)
3. Chaki, S., Clarke, E., Groce, A., Jha, S., Veith, H.: Modular verification of software components in C. Transactions on Software Engg. 30(6), 388-402 (2004)
4. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL (1977)
5. Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: 5th ACM Symposium on POPL, pp. 84-96 (1978)
6. Gulavani, B., Rajamani, S.: Counterexample driven refinement for abstract interpretation. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, Springer, Heidelberg (2006)
7. Gulwani, S., Musuvathi, M.: Cover algorithms and their combination. Technical Report MSR-TR-2006-09, Microsoft Research (January 2006)
8. Gulwani, S., Necula, G.C.: Global value numbering using random interpretation. In: 31st Annual ACM Symposium on POPL (January 2004)
9. Gulwani, S., Necula, G.C.: A polynomial-time algorithm for global value numbering. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol. 3148, pp. 212-227. Springer, Heidelberg (2004)
10. Gulwani, S., Tiwari, A.: Combining abstract interpreters. In: PLDI, pp. 376-386 (2006)
11. Henzinger, T.A., Jhala, R., Majumdar, R., McMillan, K.L.: Abstractions from proofs. In: 31st Annual ACM Symposium on POPL, pp. 232-244 (2004)
12. Kakas, A.C., Kowalski, R.A., Toni, F.: Abductive logic programming. Journal of Logic and Computation 2(6), 719-770 (1992)
13. Lahiri, S.K., Ball, T., Cook, B.: Predicate Abstraction via Symbolic Decision Procedures. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 24-38. Springer, Heidelberg (2005)
14. McMillan, K.: Symbolic model checking: an approach to the state explosion problem. PhD thesis, Carnegie Mellon University (1992)
15. McMillan, K.: An Interpolating Theorem Prover. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 16-30. Springer, Heidelberg (2004)
16. Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM TOPLAS 1(2), 245-257 (1979)
17. Paul, G.: Ai approaches to abduction, 35-98 (2000)