A relational approach to interprocedural shape analysis

ACM Transactions on Programming Languages and Systems

Volumn 32, Issue 2, 2010, Pages

  Jeannet, Bertrand ^a   Loginov, Alexey ^b   Reps, Thomas ^b   Sagiv, Mooly ^c  

^a INRIA   (France)

^b GRAMMATECH INC   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

3 valued logic; Abstract interpretation; Context sensitive analysis; Destructive updating; Interprocedural dataflow analysis; Pointer analysis; Shape analysis; Static analysis

Indexed keywords

3-VALUED LOGIC; ABSTRACT INTERPRETATIONS; CONTEXT-SENSITIVE ANALYSIS; INTERPROCEDURAL DATAFLOW ANALYSIS; POINTER ANALYSIS; SHAPE ANALYSIS;

ABSTRACTING; BINARY TREES; PROGRAM INTERPRETERS; STATIC ANALYSIS;

DATA FLOW ANALYSIS;

EID: 76749153897     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1667048.1667050     Document Type: Article

References (38)

1. ARNOLD, G. 2006. Specialized 3-valued logic shape analysis using structure-based refinement and loose embedding. In Proceedings of the Static Analysis Symposium (SAS'06). Lecture Notes in Computer Science, vol.4134, Springer.
2. ARNOLD,G.,MANEVICH, R., SAGIV, M., AND SHAHAM,R. 2006. Combining shape analyses by intersecting abstractions. In Proceedings of the International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'06). Lecture Notes in Computer Science, vol.3855, Springer.
3. BALL, T. AND RAJAMANI, S. 2001. Bebop: A path-sensitive interprocedural dataflow engine. Prog. Anal. Softw. Tools Engin, 97-103.
4. BERDINE, J., CALCAGNO, C., AND O'HEARN, P.W. 2005. Smallfoot: Modular automatic assertion checking with separation logic. In Proceedings of the Symposium on Formal Methods for Components and Objects (FMCO'05). Lecture Notes in Computer Science, vol.4111, Springer, 115-137.
5. BOGUDLOV, I., LEV-AMI, T., REPS, T., AND SAGIV, M. 2007a. Revamping TVLA: Making parametric shape analysis competitive. Tech. rep. TR-2007-01-01, Tel-Aviv University, Tel-Aviv, Israel.
6. BOGUDLOV, I., LEV-AMI, T., REPS, T., AND SAGIV, M. 2007b. Revamping TVLA: Making parametric shape analysis competitive (tool paper). In Proceedings of the International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol.4590, Springer.
7. BOUAJJANI, A., ESPARZA, J., AND MALER, O. 1997. Reachability analysis of pushdown automata: Application to model checking. In Proceedings of the International Conference on Concurrency Theory (CONCUR'97). Lecture Notes in Computer Science, vol.1243, Springer, 135-150.
8. BOUAJJANI, A., ESPARZA, J., AND TOUILI, T. 2003. A generic approach to the static analysis of concurrent programs with procedures. In Principles of Programming Languange, ACM Press, New York, 62-73.
9. CLARKE, JR., E., GRUMBERG, O., AND PELED, D. 1999. Model Checking. The MIT Press.
10. COUSOT, P. AND COUSOT, R. 1977. Static determination of dynamic properties of recursive procedures. In Formal Descriptions of Programming Concepts, E. Neuhold, Ed. North-Holland, 237-277.
11. COUSOT, P. AND HALBWACHS, N. 1978. Automatic discovery of linear constraints among variables of a program. In Principles of Programming Language, ACM Press, New York, 84-96.
12. FINKEL, A., B. WILLEMS, AND WOLPER, P. 1997. A direct symbolic approach to model checking pushdown systems. Electron. Notes Theor. Comput. Sci. 9.
13. GOPAN, D., DIMAIO, F., N.DOR, REPS, T., AND SAGIV, M. 2004. Numeric domains with summarized dimensions. In Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, vol.2988, Springer, 512-529.
14. GOTSMAN, A., BERDINE, J., AND COOK, B. 2006. Interprocedural shape analysis with separated heap abstractions. In Proceedings of the Static Analysis Symposium (SAS'06). Lecture Notes in Computer Science, vol.4134, Springer, 240-260.
15. GRIES, D. 1981. The Science of Programming. Springer.
16. JEANNET, B., LOGINOV, A., REPS, T., AND SAGIV, M. 2004. A relational approach to interprocedural shape analysis. In Proceedings of the Static Analysis Symposium (SAS'04). Lecture Notes in Computer Science, vol.3148, Springer.
17. JEANNET, B. AND SERWE, W. 2004. Abstracting call-stacks for interprocedural verification of imperative programs. In Proceedings of theWorkshop on Algebraic Methodology and Software Technology (AMAST'04). Lecture Notes in Computer Science, vol.3116, Springer.
18. KNOOP, J. AND STEFFEN, B. 1992. The interprocedural coincidence theorem. In Computing Construction. Lecture Notes in Computer Science, vol.641, Springer, 125-140.
19. LAHIRI, S. K. AND QADEER, S. 2008. Back to the future: Revisiting precise program verification using smt solvers. In Principles of Programming Language. ACM Press, New York.
20. LEV-AMI, T., REPS, T., SAGIV, M., AND WILHELM, R. 2000. Putting static analysis to work for verification: A case study. In Proceedings of the International Symposium on Software Testing and Analysis. 26-38.
21. LEV-AMI, T. AND SAGIV, M. 2000. TVLA: A system for implementing static analyses. In Proceedings of the Static Analysis Symposium (SAS'00). Lecture Notes in Computer Science, vol.1824, Springer, 280-301.
22. LOGINOV, A. 2006. Refinement-based program verification via three-valued-logic analysis. Ph.D. thesis, Tech. rep. 1574. Computer Science Department, University of Wisconsin, Madison, WI.
23. LOGINOV, A., REPS, T., AND SAGIV, M. 2005. Abstraction refinement via inductive learning. In Proceedings of the International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol.3576, Springer
24. MANNA, Z. AND PNUELI, A. 1995. Temporal Verification of Reactive Systems: Safety, Springer.
25. MARRON, M., HERMENEGILDO, M. V.,KAPUR, D., AND STEFANOVIC, D. 2008. Efficient context-sensitive shape analysis with graph based heap models. In Computer Construction. Lecture Notes in Computer Science, vol.4959, Springer, 245-259.
26. MIŃE, A. 2006. The octagon abstract domain. Higher-Order Symb. Comput. 19, 1, 31-100.
27. MøLLER, A. AND SCHWARTZBACH, M. I. 2001. The pointer assertion logic engine. In Programming Language Design and Implementation. 221-231.
28. REPS, T., HORWITZ, S., AND SAGIV, M. 1995. Precise interprocedural dataflow analysis via graph reachability. In Principles of Programming Language. ACM Press, New York, 49-61.
29. REPS, T., SAGIV, M., AND LOGINOV, A. 2003. Finite differencing of logical formulas for static analysis. In Proceedings of the European Symposium on Programming. Lecture Notes in Computer Science, vol.2618, 380-398.
30. REPS, T., SCHWOON, S., JHA, S., AND MELSKI, D. 2005. Weighted pushdown systems and their application to interprocedural dataflow analysis. Sci. Comput. Program. 58, 1-2, 206-263.
31. RINETZKY,N., BAUER, J., REPS, T., SAGIV, M., ANDWILHELM, R. 2005a. A semantics for procedure local heaps and its abstraction. In Proceedings of the 32nd ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages (POPL'05).
32. RINETZKY, N. AND SAGIV,M. 2001. Interprocedural shape analysis for recursive programs. In Computer Construction. Lecture Notes in Computer Science, vol.2027, Springer, 133-149.
33. RINETZKY, N., SAGIV, M., AND YAHAV, E. 2005b. Interprocedural shape analysis for cutpoint-free programs. In Proceedings of the Static Analysis Symposium (SAS'05). Lecture Notes in Computer Science, vol.3672, Springer.
34. SAGIV, M., REPS, T., AND HORWITZ, S. 1996. Precise interprocedural dataflow analysis with applications to constant propagation. Theor. Comput. Sci. 167, 131-170.
35. SAGIV, M., REPS, T., AND WILHELM, R. 2002. Parametric shape analysis via 3-valued logic. ACM Trans. Program. Lang. Syst. 24, 3, 217-298.
36. SCHWOON, S. 2002. Model-checking pushdown systems. Ph.D. thesis, Technical University of Munich, Munich, Germany.
37. SHARIR, M. AND PNUELI, A. 1981. Two approaches to interprocedural data flow analysis. In Program Flow Analysis: Theory and Applications, S. Muchnick and N. Jones, Eds. Prentice-Hall, Englewood Cliffs, NJ. Chapter 7, 189-234.
38. YORSH, G., REPS, T., AND SAGIV,M. 2004. Symbolically computing most-precise abstract operations for shape analysis. In Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, vol.2988, Springer, 530-545.