Generating precise and concise procedure summaries

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2008, Pages 221-234

  Yorsh, Greta ^a   Yahav, Eran ^b   Chandra, Satish ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

aliasing; composition; dataflow analysis; micro transformers; relational analysis; summarization; symbolic summary; typestate verification

Indexed keywords

ALIASING; MICRO-TRANSFORMERS; RELATIONAL ANALYSIS; SUMMARIZATION; SYMBOLIC SUMMARY; TYPESTATE VERIFICATION;

CHEMICAL ANALYSIS; COMPUTER PROGRAMMING LANGUAGES; DATA FLOW ANALYSIS;

ABSTRACTING;

EID: 84865654562     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1328438.1328467     Document Type: Conference Paper

References (32)

1. T. Ball, T. D. Millstein, and S. K. Rajamani. Polymorphic predicate abstraction. ACM Trans. Program. Lang. Syst., 27(2):314-343, 2005.
2. R. Chatterjee, B. G. Ryder, and W. A. Landi. Relevant context inference. In POPL, pages 133-146, 1999.
3. B.-C. Cheng and W.-M. W. Hwu. Modular interprocedural pointer analysis using access paths: design, implementation, and evaluation. In PLDI, pages 57-69, 2000.
4. P. Cousot and R. Cousot. Modular static program analysis. In CC, pages 159-178, 2002. ISBN 3-540-43369-4.
5. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In POPL, 1977.
6. P. Cousot and R. Cousot. Static determination of dynamic properties of recursive procedures. In E.J. Neuhold, editor, Formal Descriptions of Programming Concepts, (IFIP WG 2.2, St. Andrews, Canada, August 1977), pages 237-277. North-Holland, 1978.
7. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In POPL, pages 269-282, 1979.
8. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In POPL, pages 84-96, 1978.
9. M. Das, S. Lerner, and M. Seigle. ESP: Path-sensitive program verification in polynomial time. In PLDI, pages 57-68, 2002.
10. R. DeLine and M. Fähndrich. Adoption and focus: Practical linear types for imperative programming. In PDLI, pages 13-24, June 2002.
11. R. DeLine and M. Fähndrich. Typestates for objects. In ECOOP, pages 465-490, 2004.
12. N. Dor, S. Adams, M. Das, and Z. Yang. Software validation via scalable path-sensitive value flow analysis. In ISSTA, 2004. URL http://doi.acm.org/10. 1145/1007515.
13. J. Field, D. Goyal, G. Ramalingam, and E. Yahav. Typestate verification: Abstraction techniques and complexity results. In SAS, pages 439-462, 2003.
14. S. Fink, E. Yahav, N. Dor, G. Ramalingam, and E. Geay. Effective typestate verification in the presence of aliasing. In ISSTA, pages 133-144, 2006.
15. J. S. Foster, T. Terauchi, and A. Aiken. Flow-sensitive type qualifiers. In PLDI, pages 1-12, 2002.
16. Ganymed SSH-2 for Java. Ganymed SSH-2 for java. http://www.ganymed.ethz. ch/ssh2/.
17. S. Gulwani and A. Tiwari. Computing procedure summaries for interprocedural analysis. In ESOP, pages 253-267, 2007.
18. R. Jhala and R. Majumdar. Interprocedural analysis of asynchronous programs. In POPL, pages 339-350, 2007.
19. M. Müller-Olm and H. Seidl. Precise interprocedural analysis through linear algebra. In POPL, pages 330-341, 2004.
20. G. Nelson and D. C. Oppen. Fast decision procedures based on congruence closure. J. ACM, 27(2):356-364, 1980.
21. S. Qadeer and D. Wu. Kiss: keep it simple and sequential. In PLDI, pages 14-24, 2004.
22. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In POPL, pages 49-61, 1995.
23. T. Reps, S. Schwoon, S. Jha, and D. Melski. Weighted pushdown systems and their application to interprocedural dataflow analysis. Sci. Comput. Program., 58(1-2):206-263, 2005.
24. N. Rinetzky, M. Sagiv, and E. Yahav. Interprocedural shape analysis for cutpoint-free programs. In Proc. Static Analysis Symp., 2005.
25. M. Sagiv, T. Reps, and S. Horwitz. Precise interprocedural dataflow analysis with applications to constant propagation. Theor. Comput. Sci., 167(1-2): 131-170, 1996a. ISSN 0304-3975. doi: http://dx.doi.org/10.1016/0304- 3975(96)00072-2.
26. M. Sagiv, T. W. Reps, and S. Horwitz. Precise interprocedural dataflow analysis with applications to constant propagation. Theor. Comput. Sci., 167(1&2):131-170, 1996b.
27. A. Salcianu. Pointer Analysis for Java Programs: Novel Techniques and Applications. PhD thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA, 2006.
28. M. Sharir and A. Pnueli. Two approaches to interprocedural data ow analysis. In S.S. Muchnick and N.D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 7, pages 189-234. Prentice-Hall, Englewood Cliffs, NJ, 1981.
29. R. E. Strom and S. Yemini. Typestate: A programming language concept for enhancing software reliability. IEEE Trans. Software Eng., 12(1): 157-171, 1986.
30. The Ashes suite. The ashes suite. http://www.sable.mcgill.ca/ashes/.
31. J. Whaley and M. Rinard. Compositional pointer and escape analysis for java programs. In OOPSLA, pages 187-206, 1999.
32. Y. Xie and A. Aiken. Scalable error detection using boolean satisfiability. In POPL, pages 351-363, 2005.