A relational approach to interprocedural shape analysis

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

Volumn 3148, Issue , 2004, Pages 246-264

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

^a CAMPUS DE BEAULIEU   (France)

^b University of Wisconsin Madison   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

STATIC ANALYSIS;

IMPERATIVE PROGRAMS; INTER-PROCEDURAL; INTERPROCEDURAL DATAFLOW ANALYSIS; RECURSIVE PROCEDURE; SHAPE ANALYSIS;

DATA FLOW ANALYSIS;

EID: 35048813033     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27864-1_19     Document Type: Article

References (20)

1. Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. Trans, on Prog. Lang, and Syst. 24 (2002) 217-298
2. Reps, T., Sagiv, M., Loginov, A.: Finite differencing of logical formulas for static analysis. In: European Symp. on Programming. (2003) 380-398
3. Lev-Ami, T., Sagiv, M.: TVLA: A system for implementing static analyses. In: Static Analysis Symp. (2000) 280-301
4. Cousot, P., Cousot, R.: Static determination of dynamic properties of recursive procedures. In Neuhold, E., ed.: Formal Descriptions of Programming Concepts, (IFIP WG 2.2, St. Andrews, Canada, August 1977). North-Holland (1978) 237-277
5. Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis. In Muchnick, S., Jones, N., eds.: Program Flow Analysis: Theory and Applications. Prentice-Hall, Englewood Cliffs, NJ (1981) 189-234
6. Knoop, J., Steffen, B.: The interprocedural coincidence theorem. In: Comp. Construct. (1992) 125-140
7. Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: Princ. of Prog. Lang., New York, NY, ACM Press (1995) 49-61
8. Sagiv, M., Reps, T., Horwitz, S.: Precise interprocedural dataflow analysis with applications to constant propagation. Theor. Comp. Sci. 167 (1996) 131-170
9. Reps, T., Schwoon, S., Jha, S.: Weighted pushdown systems and their application to interprocedural dataflow analysis. In: Static Analysis Symp. (2003) 189-213
10. Ball, T., Rajamani, S.: Bebop: A path-sensitive interprocedural dataflow engine. In: Prog. Analysis for Softw. Tools and Eng. (2001) 97-103
11. Rinetzky, N., Sagiv, M.: Interprocedural shape analysis for recursive programs. In: Comp. Construct. Volume 2027 of Lee. Notes in Comp. Sci. (2001) 133-149
12. Jones, N., Muchnick, S.: A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In: Princ. of Prog. Lang. (1982) 66-74
13. Deutsch, A.: On determining lifetime and aliasing of dynamically allocated data in higherorder functional specifications. In: Princ. of Prog. Lang. (1990) 157-168
14. Gopan, D., DiMaio, F., N.Dor, Reps, T., Sagiv, M.: Numeric domains with summarized dimensions. In: Tools and Algs. for the Construct, and Anal, of Syst. (2004) 512-529
15. Loginov, A., Reps, T., Sagiv, M.: Abstraction refinement for 3-valued-logic analysis. Tech. Rep. 1504, Comp. Sci. Dept., Univ. of Wisconsin (2004)
16. Yorsh, G., Reps, T., Sagiv, M.: Symbolically computing most-precise abstract operations for shape analysis. In: Tools and Algs. for the Construct, and Anal, of Syst. (2004) 530-545
17. Jeannet, B., Loginov, A., Reps, T., Sagiv, M.: A relational approach to interprocedural shape analysis. Tech. Rep. 1505, Comp. Sci. Dept., Univ. of Wisconsin (2004)
18. Yorsh, G.: Logical characterizations of heap abstractions. Master's thesis, School of Computer Science, Tel Aviv University, Israel (2003)
19. Cousot, P., Halbwachs, N.: Automatic discovery of linear constraints among variables of a program. In: Princ. of Prog. Lang. (1978) 84-96
20. Miné, A.: The octagon abstract domain. In: 8th Working Conf. on Rev. Eng. (2001) 310-322