Quantified invariant generation using an interpolating saturation prover

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

Volumn 4963 LNCS, Issue , 2008, Pages 413-427

  McMillan, K L ^a  

^a Cadence Berkeley Labs

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTION-REFINEMENT; AXIOMATIZATION; EUROPEAN; FIRST ORDERS; HEAP DATA; HEIDELBERG (CO); INTERNATIONAL CONFERENCES; INTERPOLANTS; INVARIANT GENERATION; PARAMODULATION; TRANSITIVE CLOSURES;

COMPUTER AIDED LANGUAGE TRANSLATION; FILE ORGANIZATION; INTERPOLATION;

DATA STRUCTURES;

EID: 47249118875     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78800-3_31     Document Type: Conference Paper

References (14)

1. Biere, A., Cimatti, A., Clarke, E.M., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, Springer, Heidelberg (1999)
2. Clarke, E., Kroening, D., Lerda, F.: A tool for checking ANSI-C programs. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 168-176. Springer, Heidelberg (2004)
3. Craig, W.: Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. J. Symbolic Logic 22(3), 269-285 (1957)
4. Henzinger, T.A., Jhala, R., Majumdar, R., McMillan, K.L.: Abstractions from proofs. In: POPL, pp. 232-244. ACM, New York (2004)
5. Jhala, R., McMillan, K.L.: A practical and complete approach to predicate refinement. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 459-473. Springer, Heidelberg (2006)
6. Lahiri, S.K., Bryant, R.E.: Constructing quantified invariants via predicate abstraction. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 267-281. Springer, Heidelberg (2004)
7. McMillan, K.L.: Interpolation and SAT-based model checking. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 1-13. Springer, Heidelberg (2003)
8. McMillan, K.L.: An interpolating theorem prover. Theor. Comput. Sci. 345(1), 101-121 (2005)
9. McMillan, K.L.: Lazy abstraction with interpolants. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 123-136. Springer, Heidelberg (2006)
10. Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, ch. 7, pp. 371-443. Elsevier Science, Amsterdam (2001)
11. Robinson, G.A., Wos, L.T.: Paramodulation and theorem proving in first order theories with equality. Machine Intelligence 4, 135-150 (1969)
12. Sagiv, S., Reps, T.W., Wilhelm, R.: Parametric shape analysis via 3-valued logic. In: POPL, pp. 105-118. ACM, New York (1999)
13. Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Constraint-based linear-relations analysis. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol. 3148, pp. 53-68. Springer, Heidelberg (2004)
14. Weidenbach, C., Schmidt, R.A., Hillenbrand, T., Rusev, R., Topic, D.: System description: SPASS version 3.0. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 514-520. Springer, Heidelberg (2007)