Nonuniform alias analysis of recursive data structures and arrays

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

Volumn 2477, Issue , 2002, Pages 36-51

  Venet, Arnaud ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; DATA STRUCTURES; SEMANTICS;

ABSTRACT INTERPRETATIONS; ALIAS ANALYSIS; NUMERICAL LATTICES; OBJECT CREATION; POSITION DEPENDENTS; PROGRAM SEMANTICS; RECURSIVE DATA STRUCTURES; SEMANTIC MODEL;

STATIC ANALYSIS;

EID: 84958765807     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45789-5_6     Document Type: Conference Paper

References (24)

1. L.O. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen, 1994.
2. F. Bourdoncle. Efficient chaotic iteration strategies with widenings. In Proc. of the International Conference on Formal Methods in Programming and their Applications, volume 735 of LNCS, pages 128-141, 1993.
3. M. Burke, P. R. Carini, J.-D. Choi, and M. Hind. Interprocedural pointer alias analysis. Technical report, IBM Research Report, 1997.
4. P. Cousot. Semantic foundations of program analysis. In S.S. Muchnick and N.D. Jones, editors, Program Flow Analysis:Theory and Applications, chapter 10, pages 303-342. Prentice-Hall, Inc., EnglewoodCliffs, 1981.
5. P. Cousot and R. Cousot. Abstract interpretation: a unifiedlattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth A CM Symposium on Principles of Programming Languages, pages 238-252, 1977.
6. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Proceedings of the Sixth Conference on Principles of Programming Languages POPL’79, pages 269-282. ACM Press, 1979.
7. P. Cousot andR. Cousot. Abstract interpretation frameworks. Journal of logic and computation, 2(4):511-547, August 1992.
8. P. Cousot andN. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Proceedings of the Fifth Conference on Principles of Programming Languages. ACM Press, 1978.
9. A. Deutsch. On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications. In POPL 1990, pages 157-168, 1990.
10. A. Deutsch. A storeless model of aliasing and its abstraction using finite representations of right-regular equivalence relations. In Proceedings of the 1992 International Conference on Computer Languages, pages 2-13. IEEE Computer Society Press, 1992.
11. A. Deutsch. Interprocedural may-alias analysis for pointers: beyond k-limiting. In ACM SIGPLAN’94 Conference on Programming Language Design and Implementation. ACM Press, 1994.
12. R. Ghiya and L. J. Hendren. Is it a tree, a dag, or a cyclic graph? a shape analysis for heap-directed pointers in c. In Porceedings of POPL 1996, pages 1-15, 1996.
13. P. Granger. Static analysis of arithmetical congruences. International Journal of Computer Mathematics, 30:165-190, 1989.
14. P. Granger. Static analysis of linear congruence equalities among variables of a program. In TAPSOFT 91, volume 493. Lecture Notes in Computer Science, 1991.
15. M. Hind and A. Pioli. Evaluating the effectiveness of pointer alias analyses. Science of Computer Programming, 39(1):31-55, 2001.
16. H.B.M Jonkers. Abstract storage structures. In De Bakker andVan Vliet, editors, Algorithmic languages, pages 321-343. IFIP, 1981.
17. M. Karr. Affine relationships among variables of a program. Acta Informatica, pages 133-151, 1976.
18. F. Masdupuy. Using abstract interpretation to detect array data dependencies. In Proceedings ofthe International Symposium on Supercomputing, 1991.
19. A. Mine. A new numerical abstract domain based on difference-bound matrices. In PADO II, volume 2053 of LNCS, pages 155-172. Springer-Verlag, May 2001.
20. PolySpace Technologies. http://www.polyspace.com.
21. Shmuel Sagiv, Thomas W. Reps, and Reinhard Wilhelm. Solving shape-analysis problems in languages with destructive updating. TOPLAS, 20(1):1-50, 1998.
22. B. Steensgaard. Points-to analysis by type inference of programs with structures andunions. In Proceedings of the 1996 International Conference on Compiler Construction, volume 1060 of LNCS, pages 136-150, 1996.
23. A. Venet. Abstract cofibereddomains: Application to the alias analysis of un-typedprograms. In Proceedings ofthe Third International Static Analysis Symposium SAS 96, volume 1145 of Lecture Notes in Computer Science, pages 366-382. Springer-Verlag, 1996.
24. A. Venet. Automatic analysis of pointer aliasing for untypedprograms. Science of Computer Programming, 35(2):223-248, 1999.