Beautiful interpolants

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

Volumn 8044 LNCS, Issue , 2013, Pages 313-329

  Albarghouthi, Aws ^a   McMillan, Kenneth L ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRAIG INTERPOLATION; DECISION PROCEDURE; INTERPOLANTS; NUMERICAL PROGRAMS; RATIONAL ARITHMETICS;

COMPUTER AIDED ANALYSIS;

INTERPOLATION;

EID: 84881151835     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-39799-8_22     Document Type: Conference Paper

References (32)

1. Competition On Software Verification, http://sv-comp.sosy-lab.org/
2. Merriam-Webster Dictionary (December 2012), www.merriam-webster.com
3. Albarghouthi, A., Gurfinkel, A., Chechik, M.: Craig interpretation. In: Miné, A., Schmidt, D. (eds.) SAS 2012. LNCS, vol. 7460, pp. 300-316. Springer, Heidelberg (2012)
4. Albarghouthi, A., Gurfinkel, A., Chechik, M.: From under-approximations to over-approximations and back. In: Flanagan, C., König, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 157-172. Springer, Heidelberg (2012)
5. Albarghouthi, A., Li, Y., Gurfinkel, A., Chechik, M.: ufo: A framework for abstraction- and interpolation-based software verification. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 672-678. Springer, Heidelberg (2012)
6. Albarghouthi, A., McMillan, K.L.: Beautiful interpolants. Tech. Rep. MSR-TR-2013-42, Microsoft Research (April 2013)
7. Alur, R., Dang, T., Ivančić, F.: Counter-example guided predicate abstraction of hybrid systems. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 208-223. Springer, Heidelberg (2003)
8. Barrett, C.W., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Handbook of Satisfiability (2009)
9. Beyer, D., Cimatti, A., Griggio, A., Keremoglu, M.E., Sebastiani, R.: Software Model Checking via Large-Block Encoding. In: FMCAD 2009, pp. 25-32 (2009)
10. Beyer, D., Keremoglu, M.E.: cPAchecker: A tool for configurable software verification. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 184-190. Springer, Heidelberg (2011)
11. Cimatti, A., Griggio, A., Sebastiani, R.: Efficient Generation of Craig Interpolants in Satisfiability Modulo Theories. ACM Trans. Comput. 12(1), 7 (2010)
12. Colón, M.A., Sankaranarayanan, S., Sipma, H.B.: Linear invariant generation using non-linear constraint solving. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 420-432. Springer, Heidelberg (2003)
13. Dillig, I., Dillig, T., Li, B.: Personal Communication (2012)
14. D'Silva, V., Kroening, D., Purandare, M., Weissenbacher, G.: Interpolant strength. In: Barthe, G., Hermenegildo, M. (eds.) VMCAI 2010. LNCS, vol. 5944, pp. 129-145. Springer, Heidelberg (2010)
15. Gulavani, B.S., Chakraborty, S., Nori, A.V., Rajamani, S.K.: Automatically Refining Abstract Interpretations. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 443-458. Springer, Heidelberg (2008)
16. Gulwani, S., Srivastava, S., Venkatesan, R.: Program analysis as constraint solving. In: PLDI 2008, pp. 281-292 (2008)
17. Gupta, A., Rybalchenko, A.: InvGen: An efficient invariant generator. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 634-640. Springer, Heidelberg (2009)
18. Hamadi, Y., Marques-Silva, J., Wintersteiger, C.M.: Lazy decomposition for distributed decision procedures. In: PDMC 2011, pp. 43-54 (2011)
19. Hoder, K., Kovács, L., Voronkov, A.: Playing in the grey area of proofs. In: POPL 2012, pp. 259-272 (2012)
20. 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) (Pubitemid 44019391)
21. Kroening, D., Weissenbacher, G.: Lifting propositional interpolants to the wordlevel. In: FMCAD 2007, pp. 85-89 (2007)
22. 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)
23. McMillan, K.L.: Interpolants from Z3 proofs. In: FMCAD 2011, pp. 19-27 (2011)
24. McMillan, K.L.: An interpolating theorem prover. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 16-30. Springer, Heidelberg (2004)
25. McMillan, K.L., Rybalchenko, A.: Computing relational fixed points using interpolation. Tech. Rep. MSR-TR-2013-6, Microsoft Research (2013)
26. Megiddo, N.: On the complexity of polyhedral separability. Discrete & Computational Geometry 3, 325-337 (1988)
27. de Moura, L., Bjørner, N.S.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008)
28. Rollini, S.F., Sery, O., Sharygina, N.: Leveraging interpolant strength in model checking. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 193-209. Springer, Heidelberg (2012)
29. Rybalchenko, A., Sofronie-Stokkermans, V.: Constraint solving for interpolation. J. Symb. Comput. 45(11), 1212-1233 (2010)
30. Schrijver, A.: Theory of linear and integer programming. John Wiley & Sons, Inc., New York (1986)
31. Sharma, R., Nori, A.V., Aiken, A.: Interpolants as classifiers. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 71-87. Springer, Heidelberg (2012)
32. Weissenbacher, G.: Interpolant strength revisited. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 312-326. Springer, Heidelberg (2012)