Interprocedural shape analysis for cutpoint-free programs

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

Volumn 3672 LNCS, Issue , 2005, Pages 284-302

  Rinetzky, Noam ^a   Sagiv, Mooly ^a   Yahav, Eran ^b  

^a TEL AVIV UNIVERSITY   (Israel)

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

Author keywords

[No Author keywords available]

Indexed keywords

CUTPOINT-FREE PROGRAMS-PROGRAMS; QUICKSORT IMPLEMENTATION; SHAPE ANALYSIS;

PARAMETER ESTIMATION; RECURSIVE FUNCTIONS; SENSITIVITY ANALYSIS;

COMPUTER PROGRAMMING;

EID: 33646039398     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11547662_20     Document Type: Conference Paper

References (38)

1. P. S. Almeida. Balloon types: Controlling sharing of state in data types. In European Conference on Object-Oriented Programming (ESOP), 1997.
2. T. Ball and S.K. Rajamani. Bebop: A path-sensitive interprocedural dataflow engine. In Workshop on Program Analysis for Software Tools and Engineering (PASTE), 2001.
3. A. Banerjee and D. A. Naumann. Representation independence, confinement, and access control. In Symp. on Princ. of Prog. Lang. (POPL), 2002.
4. B. Bokowski and J. Vitek. Confined types. In Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA), 1999.
5. C. Boyapati, B. Liskov, and L. Shrira. Ownership types for object encapsulation. In Symp. on Princ. of Prog. Lang. (POPL), 2003.
6. D.R. Chase, M. Wegman, and F. Zadeck. Analysis of pointers and structures. In Conf. on Prog. Lang. Design and Impl. (PLDI), 1990.
7. S. Chong and R. Rugina. Static analysis of accessed regions in recursive data structures. In International Static Analysis Symposium (SAS), 2003.
8. D. Clarke, J. Noble, and J. Potter. Simple ownership types for object containment. In European Conference on Object-Oriented Programming (ESOP), 2001.
9. D. G. Clarke, J. M. Potter, and J. Noble. Ownership types for flexible alias protection. In Conference on Object-Oriented Programming Systems, Languages, and Applications (OOP-SLA), 1998.
10. 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.
11. M. Das, S. Lerner, and M. Seigle. ESP: path-sensitive program verification in polynomial time. In Conf. on Prog. Lang. Design and Impl. (PLDI), 2002.
12. A. Deutsch. Interprocedural may-alias analysis for pointers: Beyond k-limiting. In Conf. on Prog. Lang. Design and Impl. (PLDI), 1994.
13. N. Dor, M. Rodeh, and M. Sagiv. Checking cleanness in linked lists. In International Static Analysis Symposium (SAS), 2000.
14. C. Grothoff, J. Palsberg, and J. Vitek. Encapsulating objects with confined types. In Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA), 2001.
15. B. Hackett and R. Rugina. Region-based shape analysis with tracked locations. In Symp. on Princ. of Prog. Lang. (POPL), 2005.
16. C. A. R. Hoarc. Algorithm 64: Quicksort. Comm. of the ACM (CACM), 4(7):321, 1961.
17. J. Hogg. Islands: Aliasing protection in object-oriented languages. In Conference on Object-Oriented Programming Systems, languages, and Applications (OOPSLA), 1991.
18. S. S. Ishtiaq and P. W. O'Hearn. BI as an assertion language for mutable data structures. In Symp. on Princ. of Prog. Lang. (POPL), 2001.
19. B. Jeannet, A. Loginov, T. Reps, and M. Sagiv. A relational approach to interprocedural shape analysis. In International Static Analysis Symposium (SAS), 2004.
20. J. Knoop and B. Steffen. The interprocedural coincidence theorem. In Int. Conf. on Comp. Construct. (CC), 1992.
21. K. R. M. Leino, A. Poetzsch-Heffter, and Y. Zhou. Using data groups to specify and check side effects. In Conf. on Prog. Lang. Design and Impl. (PLDI), 2002.
22. T. Lev-Ami, T. Reps, M. Sagiv, and R. Wilhelm. Putting static analysis to work for verification: A case study. In Int. Symp. on Software Testing and Analysis (ISSTA), 2000.
23. T. Lev-Ami and M. Sagiv. TVLA: A framework for Kleene based static analysis. In International Static Analysis Symposium (SAS), 2000. Available at http://www.math.lau.ac.il/~tvla.
24. R. Manevich, M. Sagiv, G. Ramalingam, and J. Field. Partially disjunctive heap abstraction. In International Static Analysis Symposium (SAS), 2004.
25. P. Müller and A. Poetzsch-Heffter. Universes: A type system for alias and dependency control. Technical Report 279, Fernuniversität Hagen, 2001.
26. F. Nielson, H. R. Nielson, and C. Hankin. Principles of Program Analysis. Springer, 1999.
27. J. Noble, R. Biddle, E. Tempero, A. Potanin, and D. Clarke. Towards a model of encapsulation. In The First International Workshop on Aliasing, Confinement and Ownership in Object-Oriented Programming (IWACO), 2003.
28. J. Noble, J. Vitek, and J. Potter. Flexible alias protection. In European Conference on Object-Oriented Programming (ESOP), 1998.
29. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Symp. on Princ. of Prog. Lang. (POPL), 1995.
30. T. Reps, M. Sagiv, and A. Loginov. Finite differencing of logical formulas for static analysis. In European Symposium on Programming Languages (ESOP), 2003.
31. J. Reynolds. Separation logic: a logic for shared mutable data structures. In Symp. on Logic in Computer Science (LICS), 2002,
32. N. Rinetzky, J. Bauer, T. Reps, M. Sagiv, and R. Wilhelm. A semantics for procedure local heaps and its abstractions. Tech. Rep. 1, AVACS, September 2004. Available at "http://www.avacs.org".
33. N. Rinetzky, J. Bauer, T. Reps, M. Sagiv, and R. Wilhelm. A semantics for procedure local heaps and its abstractions. In Symp. on Princ. of Prog. Lang. (POPL), 2005.
34. N. Rinetzky and M. Sagiv. Interprocedural shape analysis for recursive programs. In Int. Conf. on Comp. Construct. (CC), 2001.
35. N. Rinetzky, M. Sagiv, and E. Yahav. Interprocedural shape analysis for cutpoint-free programs. Tech. Rep. 104/05, Tel Aviv Uni., April 2005. Available al "http://www.math.tau.ac.il/~maon".
36. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. Trans. on Prog. Lang. and Syst. (TOPLAS), 24(3):217-298, 2002.
37. R. Shaham, E. Yahav, E.K. Kolodner, and M. Sagiv. Establishing local temporal heap safety properties with applications to compile-time memory management. In International Static Analysis Symposium (SAS), 2003.
38. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow 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.