A scalable nonuniform pointer analysis for embedded programs

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

Volumn 3148, Issue , 2004, Pages 149-164

  Venet, Arnaud ^a  

^a NASA AMES RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DIGITAL STORAGE; FLOW GRAPHS; ITERATIVE METHODS; MULTITASKING; SEMANTICS;

EMBEDDED APPLICATION; EXPERIMENTAL EVIDENCE; FLOW-SENSITIVE ANALYSIS; INTERLEAVINGS; MULTI-THREADED PROGRAMS; NUMERICAL CONSTRAINTS; POINTER ANALYSIS; REAL SIZES;

STATIC ANALYSIS;

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

References (26)

1. L. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen, 1994.
2. B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné, D. Monniaux, and X. Rival. Design and implementation of a special-purpose static program analyzer for safety-critical real-time embedded software, invited chapter. In T. Mogensen, D.A. Schmidt, and I.H. Sudborough, editors, The Essence of Computation: Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones, LNCS 2566, pages 85-108. Springer-Verlag, October 2002.
3. B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné, D. Monniaux, and X. Rival. A static analyzer for large safety-critical software. In Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation (PLDI'03), pages 196-207. ACM Press, June 7-14 2003.
4. Satish Chandra and Thomas W. Reps. Physical type checking for c. In Workshop on Program Analysis For Software Tools and Engineering, pages 66-75, 1999.
5. 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., Englewood Cliffs, 1981.
6. P. Cousot and R. Cousot. Static determination of dynamic properties of programs. In Proceedings of 2nd International Symposium on Programming, pages 106-130, 1976.
7. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th Symposium on Principles of Programming Languages, pages 238-353, 1977.
8. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Conference Record of the Sixth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 269-282. ACM Press, New York, NY, 1979.
9. P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of Logic and Computation, 2(4) :511-547, 1992.
10. P. Cousot and R. Cousot. Formal language, grammar and set-constraint-based program analysis by abstract interpretation. In Proceedings of the Seventh ACM Conference on Functional Programming Languages and Computer Architecture, pages 170-181. ACM Press, New York, NY, 1995.
11. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Conference Record of the Fifth Annual ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, pages 84-97. ACM Press, New York, NY, 1978.
12. Manuvir Das. Unification-based pointer analysis with directional assignments. ACM SIGPLAN Notices, 35(5):35-46, 2000.
13. 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.
14. 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.
15. Manuel Fähndrich, Jeffrey S. Foster, Zhendong Su, and Alexander Aiken. Partial online cycle elimination in inclusion constraint graphs. ACM SIGPLAN Notices, 33(5):85-96, 1998.
16. P. Granger. Static analysis of linear congruence equalities among variables of a program. In TAPSOFT'91, volume 493. Lecture Notes in Computer Science, 1991.
17. Nevin Heintze, Dino Oliva, and Dave MacQueen. The ckit front-end. ckit@research.bell-labs.com.
18. Nevin Heintze and Olivier Tardieu. Ultra-fast aliasing analysis using CLA: A million lines of c code in a second. In SIGPLAN Conference on Programming Language Design and Implementation, pages 254-263, 2001.
19. M. Karr. Affine relationships among variables of a program. Acta Informatica, pages 133-151, 1976.
20. A. Miné. The octagon abstract domain. In AST 2001 at WCRE 2001, IEEE, pages 310-319. IEEE CS Press, October 2001.
21. Bjarne Steensgaard. Points-to analysis by type inference of programs with structures and unions. In Computational Complexity, pages 136-150, 1996.
22. A. Venet. Abstract cofibered domains: Application to the alias analysis of untyped programs. In Proceedings of SAS'96, volume 1145 of Lecture Notes in Computer Science, pages 266-382. Springer Verlag, 1996.
23. A. Venet. Automatic analysis of pointer aliasing for untyped programs. Science of Computer Programming, 35(2):223-248, 1999.
24. A. Venet. Nonuniform alias analysis of recursive data structures and arrays. In Proceedings of the 9th International Symposium on Static Analysis SAS'02, volume 2477 of Lecture Notes in Computer Science, pages 36-51. Springer, 2002.
25. A. Venet and G. Brat. Precise and efficient static array bound checking for large embedded C programs. In Proceedings of the International Conference on Programming Language Design and Implementation, PLDI'04, 2004. To appear.
26. John Whaley and Monica S. Lam. An efficient inclusion-based points-to analysis for strictly-typed languages. In Proceedings of the 9th International Static Analysis Symposium, pages 180-195, September 2002.