Precise and compact modular procedure summaries for heap manipulating programs

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2011, Pages 567-577

  Dillig, Isil ^a   Dillig, Thomas ^a   Aiken, Alex ^a   Sagiv, Mooly ^b  

^a Stanford University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

pointer analysis; summary based analysis

Indexed keywords

COMPUTER SOFTWARE;

ANALYSIS ALGORITHMS; BOTTOM UP; C PROGRAMS; HEAP-MANIPULATING PROGRAMS; MODULAR PROCEDURES; POINTER ANALYSIS; PROGRAM VERIFICATION; SUMMARY-BASED ANALYSE;

C++ (PROGRAMMING LANGUAGE);

EID: 79959888753     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993498.1993565     Document Type: Conference Paper

References (18)

1. Aiken, A., Bugrara, S., Dillig, I., Dillig, T., Hackett, B., Hawkins, P.: An overview of the saturn project. In: PASTE, ACM (2007) 43-48
2. Bush,W., Pincus, J., Sielaff, D.: A static analyzer for finding dynamic programming errors. Software: Practice and Experience 30(7) (2000) 775-802
3. Reps, T.W., Sagiv, S., Wilhelm, R.: Static program analysis via 3- valued logic. In: CAV. Volume 3114., Springer (2004) 15-30
4. Dillig, I., Dillig, T., Aiken, A.: Fluid updates: Beyond strong vs. weak updates. In: ESOP. (2010)
5. Landi, W., Ryder, B.G.: A safe approximate algorithm for interprocedural aliasing. SIGPLAN Not. 27(7) (1992) 235-248 (Pubitemid 23626349)
6. Wilson, R.P., Lam, M.S.: Efficient context-sensitive pointer analysis for c programs. In: PLDI. (1995)
7. Chatterjee, R., Ryder, B., Landi, W.: Relevant context inference. In: POPL, ACM (1999) 133-146
8. Dillig, I., Dillig, T., Aiken, A.: Sound, complete and scalable path-sensitive analysis. In: PLDI, ACM (2008) 270-280
9. Whaley, J., Rinard, M.: Compositional pointer and escape analysis for Java programs. In: OOPSLA, ACM (1999) 187-206 (Pubitemid 32213984)
10. Salcinau, A.: Pointer Analysis for Java Programs: Novel Techniques and Applications. PhD thesis, MIT (2006)
11. Calcagno, C., Distefano, D., O'Hearn, P., Yang, H.: Compositional shape analysis by means of bi-abduction. POPL (2009) 289-300
12. Gulavani, B., Chakraborty, S., Ramalingam, G., Nori, A.: Bottom-up shape analysis. SAS (2009) 188-204
13. Cousot, P., Cousot, R.: Modular static program analysis. In: CC. (2002) 159-178
14. Gulwani, S., Tiwari, A.: Computing procedure summaries for interprocedural analysis. ESOP (2007) 253-267 (Pubitemid 350259496)
15. Pnueli, M.: Two approaches to interprocedural data flow analysis. Program Flow Analysis: Theory and Applications (1981) 189-234
16. Yorsh, G., Yahav, E., Chandra, S.: Generating precise and concise procedure summaries. POPL 43(1) (2008) 221-234
17. Reps, T.W., Horwitz, S., Sagiv, S.: Precise interprocedural dataflow analysis via graph reachability. In: POPL. (1995) 49-61
18. Sagiv, S., Reps, T.W., Horwitz, S.: Precise interprocedural dataflow analysis with applications to constant propagation. Theor. Comput. Sci. 167(1&2) (1996) 131-170