Computing procedure summaries for interprocedural analysis

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

Volumn 4421 LNCS, Issue , 2007, Pages 253-267

  Gulwani, Sumit ^a   Tiwari, Ashish ^b  

^a MICROSOFT RESEARCH   (United States)

^b SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATION THEORY; CONTEXT FREE GRAMMARS; DIGITAL ARITHMETIC; PROBLEM SOLVING;

COMPLEXITY MATCHING; INTERPROCEDURAL ANALYSIS; LINEAR ARITHMETIC PROGRAMS; PROCEDURE SUMMARIES;

COMPUTER PROGRAMMING;

EID: 37149050700     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71316-6_18     Document Type: Conference Paper

References (20)

1. B. Alpern, M. N. Wegman, and F. K. Zadeck. Detecting equality of variables in programs. In 15th Annual ACM Symposium on POPL, pages 1-11, 1988.
2. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th Annual ACM Symposium on POPL, pages 234-252, 1977.
3. K. Gargi. A sparse algorithm for predicated global value numbering. In PLDI, volume 37, 5, pages 45-56. ACM Press, June 17-19 2002.
4. S. Gulwani and G. C. Necula. A polynomial-time algorithm for global value numbering. In Static Analysis Symposium, volume 3148 of LNCS, pages 212-227, 2004.
5. S. Gulwani and A. Tiwari. Assertion checking over combined abstraction of linear arithmetic & uninterpreted functions. In ESOP, volume 3924 of LNCS, Mar. 2006.
6. S. Gulwani and A. Tiwari. Assertion checking unified. In Proc. VMCAI, LNCS 4349. Springer, 2007. See also Microsoft Research Tech. Report MSR-TR-2006-98.
7. G. A. Kildall. A unified approach to global program optimization. In 1st ACM Symposium on POPL, pages 194-206, Oct. 1973.
8. M. Müller-Olm, M. Petter, and H. Seidl. Interprocedurally analyzing polynomial identities. In STACS, volume 3884 of LNCS, pages 50-67. Springer, 2006.
9. M. Müller-Olm, O. Rüthing, and H. Seidl. Checking Herbrand equalities and beyond. In VMCAI, volume 3385 of LNCS, pages 79-96. Springer, Jan. 2005.
10. M. Müller-Olm and H. Seidl. A note on Karr's algorithm. In 31st International Colloquium on Automata, Languages and Programming, pages 1016-1028, 2004.
11. M. Müller-Olm and H. Seidl. Precise interprocedural analysis through linear algebra. In 31st ACM Symposium on POPL, pages 330-341, Jan. 2004.
12. M. Müller-Olm, H. Seidl, and B. Steffen. Interprocedural Herbrand equalities. In ESOP, volume 3444 of LNCS, pages 31-45. Springer, 2005.
13. W. Plandowski. Testing equivalence of morphisms on context-free languages. In Algorithms - ESA '94, volume 855 of LNCS, pages 460-470. Springer, 1994.
14. T. Reps. On the sequential nature of interprocedural program-analysis problems, Acta Informatica, 33(8):739-757, Nov. 1996.
15. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In 22nd ACM Symposium on POPL, pages 49-61, 1995.
16. O. Rüthing, J. Knoop, and B. Steffen. Detecting equalities of variables: Combining efficiency with precision. In SAS, volume 1694 of LNCS, pages 232-247, 1999.
17. M. Sagiv, T. Reps, and S. Horwitz. Precise interprocedural dataflow analysis with applications to constant propagation. TCS, 167(1-2):131-170, 30 Oct. 1996.
18. S. Sankaranarayanan, H. Sipma, and Z. Manna. Non-linear loop invariant generation using grbner bases. In POPL, pages 318-329, 2004.
19. M. Schmidt-Schauß. Polynomial equality testing for terms with shared substructures. Technical Report 21, Institut für Informatik, November 2005.
20. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In Program Flow Analysis: Theory and Applications. Prentice-Hall, 1981.