Interpolants as classifiers

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

Volumn 7358 LNCS, Issue , 2012, Pages 71-87

  Sharma, Rahul ^a   Nori, Aditya V ^b   Aiken, Alex ^a  

^a STANFORD UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

interpolants; machine learning; Static analysis

Indexed keywords

CLASSIFICATION ALGORITHM; CLASSIFICATION TECHNIQUE; INTERPOLANTS; LINEAR STRUCTURES; NONLINEAR PROBLEMS; PROBLEM STRUCTURE; PROGRAM VERIFICATION; SUPERVISED MACHINE LEARNING;

COMPUTER AIDED ANALYSIS; LEARNING ALGORITHMS; LEARNING SYSTEMS; STATIC ANALYSIS; SUPPORT VECTOR MACHINES;

INTERPOLATION;

EID: 84864026969     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31424-7_11     Document Type: Conference Paper

References (26)

1. Balakrishnan, G., Sankaranarayanan, S., Ivancic, F., Gupta, A.: Refining the control structure of loops using static analysis. In: EMSOFT, pp. 49-58 (2009)
2. Blum, A., Rivest, R.L.: Training a 3-node Neural Network is NP-Complete. In: Hanson, S.J., Rivest, R.L., Remmele,W. (eds.) MIT-Siemens 1993. LNCS, vol. 661, pp. 9-28. Springer, Heidelberg (1993)
3. Chang, C.C., Lin, C.J.: LIBSVM: A library for support vector machines. ACM Transactions on Intelligent Systems and Technology 2, 27:1-27:27 (2011), software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm
4. Craig, W.: Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. J. Symb. Log. 22(3), 269-285 (1957)
5. Ernst, M.D., Perkins, J.H., Guo, P.J., McCamant, S., Pacheco, C., Tschantz, M.S., Xiao, C.: The Daikon system for dynamic detection of likely invariants. Sci. Comput. Program. 69(1-3), 35-45 (2007)
6. 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)
7. Gulavani, B.S., Henzinger, T.A., Kannan, Y., Nori, A.V., Rajamani, S.K.: Synergy: a new algorithm for property checking. In: SIGSOFT FSE, pp. 117-127 (2006)
8. Gulwani, S., Jain, S., Koskinen, E.: Control-flow refinement and progress invariants for bound analysis. In: PLDI, pp. 375-385 (2009)
9. Gulwani, S., Srivastava, S., Venkatesan, R.: Program analysis as constraint solving. In: PLDI, pp. 281-292 (2008)
10. Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning. Springer Series in Statistics. Springer New York Inc. (2001)
11. Henzinger, T.A., Jhala, R., Majumdar, R., McMillan, K.L.: Abstractions from proofs. In: POPL, pp. 232-244 (2004)
12. Ivancic, F., Sankaranarayanan, S.: NECLA Static Analysis Benchmarks, http://www.nec-labs.com/research/system/systems SAV-website/small static bench-v1.1.tar.gz
13. Jhala, R., McMillan, K.L.: A Practical and Complete Approach to Predicate Refinement. In: Hermanns, H. (ed.) TACAS 2006. LNCS, vol. 3920, pp. 459-473. Springer, Heidelberg (2006)
14. Krajícek, J.: Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic. J. Symb. Log. 62(2), 457-486 (1997)
15. Kupferschmid, S., Becker, B.: Craig Interpolation in the Presence of Non-linear Constraints. In: Fahrenberg, U., Tripakis, S. (eds.) FORMATS 2011. LNCS, vol. 6919, pp. 240-255. Springer, Heidelberg (2011)
16. Leroux, J., Rümmer, P.: Craig Interpolation for Presburger Arithmetic in OpenSMT, http://www.philipp.ruemmer.org/interpolating-opensmt. shtml
17. McMillan, K.L.: An interpolating theorem prover. Theor. Comput. Sci. 345(1), 101-121 (2005)
18. Megiddo, N.: On the complexity of polyhedral separability. Discrete & Computational Geometry 3, 325-337 (1988)
19. de Moura, L., Bjørner, N.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008)
20. Müller-Olm, M., Seidl, H.: Computing polynomial program invariants. Inf. Process. Lett. 91(5), 233-244 (2004)
21. Platt, J.C.: Fast training of support vector machines using sequential minimal optimization. In: Advances in Kernel Methods: Support Vector Learning, pp. 185-208. MIT Press (1998)
22. Pudlák, P.: Lower bounds for resolution and cutting plane proofs and monotone computations. J. Symb. Log. 62(3), 981-998 (1997)
23. Rodríguez-Carbonell, E., Kapur, D.: Generating all polynomial invariants in simple loops. J. Symb. Comput. 42(4), 443-476 (2007)
24. Rybalchenko, A., Sofronie-Stokkermans, V.: Constraint Solving for Interpolation. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 346-362. Springer, Heidelberg (2007)
25. Sankaranarayanan, S., Sipma, H., Manna, Z.: Non-linear loop invariant generation using Gröbner bases. In: POPL, pp. 318-329 (2004)
26. Sharma, R., Dillig, I., Dillig, T., Aiken, A.: Simplifying Loop Invariant Generation Using Splitter Predicates. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 703-719. Springer, Heidelberg (2011)