Logical interpretation: Static program analysis using theorem proving

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

Volumn 4603 LNAI, Issue , 2007, Pages 147-166

  Tiwari, Ashish ^a   Gulwani, Sumit ^b  

^a SRI INTERNATIONAL   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; PROBABILITY; THEOREM PROVING;

AUTOMATED DEDUCTION TECHNOLOGY; LOGICAL LATTICES; STATIC PROGRAM ANALYSIS;

FORMAL LOGIC;

EID: 35148858884     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73595-3_11     Document Type: Conference Paper

References (25)

1. Alpern, B., Wegman, M.N., Zadeck, F.K.: Detecting equality of variables in programs. In: 15th Annual ACM Symposium on POPL, pp. 1-11 (1988)
2. Baader, F., Snyder, W.: Unification theory. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning (chapter 8), vol. I, pp. 445-532. Elsevier, Amsterdam (2001)
3. Cousot, P.: Forward relational infinitary static analysis, Lecture Notes (2005) Available at http://web.mit.edu/afs/athena.mit.edu/course/16/16.399/www
4. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: 4th Annual ACM Symposium on POPL, pp. 234-252 (1977)
5. Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: 6th ACM Symp. on POPL, pp. 269-282 (1979)
6. Flanagan, C., Rustan, K., Leino, M., Lillibridge, M., Nelson, G., Saxe, J.B., Stata, R.: Extended static checking for Java. In: PLDI, pp. 234-245 (2002)
7. 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)
8. Gulwani, S., Tiwari, A.: Assertion checking over combined abstraction of linear arithmetic and uninterpreted functions. In: Sestoft, P. (ed.) ESOP 2006 and ETAPS 2006. LNCS, vol. 3924, Springer, Heidelberg (2006)
9. Gulwani, S., Tiwari, A.: Combining abstract interpreters. In: PLDI (June 2006)
10. Gulwani, S., Tiwari, A.: Assertion checking unified. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, Springer, Heidelberg (2007) (to appear)
11. Gulwani, S., Tiwari, A.: Computing procedure summaries for interprocedural analysis. In: Proc. European Symp. on Programming, ESOP 2007. LNCS, Springer, Heidelberg (2007) (to appear)
12. Gulwani, S., Tiwari, A.: Static analysis of heap manipulating low-level software. In: CAV. LNCS, vol. 4590, Springer, Heidelberg (2007)
13. Gulwani, S., Tiwari, A., Necula, G.C.: Join algorithms for the theory of uninterpreted symbols. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 311-323. Springer, Heidelberg (2004)
14. Karr, M.: Affine relationships among variables of a program. Acta Informatica 6, 133-151 (1976)
15. Mine, A.: The octagon abstract domain. Higher Order Symbol. Comput. 19(1), 31-100 (2006)
16. Müller-Olm, M., Rüthing, O., Seidl, H.: Checking Herbrand equalities and beyond. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 79-96. Springer, Heidelberg (2005)
17. Müller-Olm, M., Seidl, H.: A note on Karr's algorithm. In: 31st International Colloquium on Automata, Languages and Programming, pp. 1016-1028 (2004)
18. Müller-Olm, M., Seidl, H.: Precise interprocedural analysis through linear algebra. In: 31st ACM Symposium on POPL, pp. 330-341 (January 2004)
19. Nelson, G., Oppen, D.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems 1(2), 245-257 (1979)
20. Plandowski, W.: Testing equivalence of morphisms on context-free languages. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 460-470. Springer, Heidelberg (1994)
21. Reps, T.: On the sequential nature of interprocedural program-analysis problems. Acta Informatica 33(8), 739-757 (1996)
22. Rodriguez-Carbonell, E., Kapur, D.: An abstract interpretation approach for automatic generation of polynomial invariants. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol. 3148, Springer, Heidelberg (2004)
23. Rüthing, O., Knoop, J., Steffen, B.: Detecting equalities of variables: Combining efficiency with precision. In: Cortesi, A., Filé, G. (eds.) SAS 1999. LNCS, vol. 1694, pp. 232-247. Springer, Heidelberg (1999)
24. Shankar, N.: Little engines of proof. In: Eriksson, L.-H., Lindsay, P.A. (eds.) FME 2002. LNCS, vol. 2391, pp. 1-20. Springer, Heidelberg (2002)
25. Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis. In: Program Flow Analysis: Theory and Applications, pp. 189-233. Prentice-Hall, Englewood Cliffs (1981)