Combining shape analyses by intersecting abstractions

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

Volumn 3855 LNCS, Issue , 2006, Pages 33-48

  Arnold, Gilad ^a   Manevich, Roman ^b   Sagiv, Mooly ^b   Shaham, Ran ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINED MATCHINGS; FORWARD ANALYSIS; HEAP ABSTRACTIONS;

ALGORITHMS; COMPUTATION THEORY; COMPUTER APPLICATIONS; CONSTRAINT THEORY; GRAPH THEORY; JAVA PROGRAMMING LANGUAGE; PROBLEM SOLVING;

ABSTRACTING;

EID: 33745650097     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (11)

1. G. Arnold, R. Manevich, M. Sagiv, and R. Shaham. Intersecting heap abstractions with applications to compile-time memory management. Technical Report TR-2005-04-135520, Tel Aviv University, Apr 2005. Available at http://www.cs.tau.ac.il/~rumster/TR-2005-04-135520.pdf.
2. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In Symp. on Princ. of Prog. Lang., pages 238-252, New York, NY, 1977. ACM Press.
3. B. Jeannet, Alexey L., T. Reps, and M. Sagiv. A relational approach to interprocedural shape analysis. In Proc. Static Analysis Symp. Springer, 2004.
4. V. Kuncak and M. Rinard. Boolean algebra of shape analysis constraints. In 5th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'04), pages 59-72. Springer, January 2004.
5. T. Lev-Ami and M. Sagiv. TVLA: A system for implementing static analyses. In Proc. Static Analysis Symp., pages 280-301, 2000.
6. Z. Manna and A. Pnueli. A hierarchy of temporal properties (invited paper). In Proceedings of the ninth annual ACM symposium on Principles of distributed computing, pages 377-410, 1989.
7. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems, 24(3):217-298, 2002.
8. R. Shaham, E. K. Kolodner, and M. Sagiv. Heap profiling for space-efficient Java. In SIGPLAN Conf. on Prog. Lang. Design and Impl., pages 104-113. ACM Press, June 2001.
9. R. Shaham, E. Yahav, E. K. Kolodner, and M. Sagiv. Establishing local temporal heap safety properties with applications to compile-time memory management. In Proc. of Static Analysis Symposium (SAS'03), volume 2694 of LNCS, pages 483-503. Springer, June 2003.
10. G. Yorsh. Logical characterizations of heap abstractions. Master's thesis, Tel-Aviv University, Tel-Aviv, Israel, 2003. http://www.cs.tau.ac.il/ ~gretay/.
11. G. Yorsh, T. Reps, and M. Sagiv. Symbolically computing most-precise abstract operations for shape analysis. In Tools and Algorithms for the Construction and Analysis of Systems, 10th International Conference (TACAS 2004), pages 530-545. Springer, March 2004.