Precise and efficient static array bound checking for large embedded C programs

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn 1, Issue , 2004, Pages 231-242

  Venet, Arnaud ^a   Brat, Guillaume ^a  

^a NASA AMES RESEARCH CENTER   (United States)

Author keywords

Abstract interpretation; Array bound checking; Difference bound matrices; Pointer analysis; Program verification

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTER AIDED LOGIC DESIGN; COMPUTER PROGRAMMING; COMPUTER SOFTWARE; FLIGHT DYNAMICS; MATRIX ALGEBRA; MICROPROCESSOR CHIPS; NUMERICAL ANALYSIS; PROGRAM PROCESSORS; SEMANTICS;

ABSTRACT INTERPRETATION; ARRAY-BOUND CHECKING; DIFFERENCE-BOUND MATRICES; POINTER ANALYSIS; PROGRAM VERIFICATION;

EMBEDDED SYSTEMS;

EID: 8344266081     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/996841.996869     Document Type: Conference Paper

References (29)

1. A. Aiken and M. Fähndrich. Program analysis using mixed term and set constraints. In Proceedings of 4th International Static Analyses Symposium (SAS'97), 1997.
2. L. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen, 1994.
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, San Diego, California, USA, June 7-14 2003. ACM Press.
4. F. Bourdoncle. Efficient chaotic iteration strategies with widenings. In Proceedings of the International Conference on Formal Methods in Programming and their Applications, volume 735 of Lecture Notes in Computer Science, pages 128-141. Springer Verlag, 1993.
5. G. Brat and R. Klemm. Static analysis of the mars exploration rover flight software. In Proceedings of the First International Space Mission Challenges for Information Technology, pages 321-326, 2003.
6. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. The MIT Press, 1990.
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, San Antonio, Texas, 1979. ACM Press, New York, NY.
9. P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. Journal of Logic Programming, 13(2-3):103-179, 1992.
10. P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of Logic and Computation, 2(4): 511-547, 1992.
11. P. Cousot and R. Cousot. Modular static program analysis, invited paper. In R. Horspool, editor, Proceedings of the Eleventh International Conference on Compiler Construction (CC 2002), pages 159-178, Grenoble, France, April 6-14 2002. LNCS 2304, Springer, Berlin.
12. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Conference Record of the Fifth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 84-97, Tucson, Arizona, 1978. ACM Press, New York, NY.
13. M. Das. Unification-based pointer analysis with directional assignments. In Proceedings of the ACM SIGPLAN '00 conference on Programming language design and implementation, pages 35-46. ACM Press, 2000.
14. M. Das, B. Liblit, M. Fähndrich, and J. Rehof. Estimating the impact of scalable pointer analysis on optimization. In Proceedings of 8th International Static Analyses Symposium (SAS'01), pages 260-278, 2001.
15. Edison Design Group, http://www.edg.com.
16. A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam. Pvm 3 User's Guide And Reference Manual. MIT Press, 1994.
17. Green Hills Software, http://www.ghs.com.
18. N. Heintze and O. 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. A. Milanova, A. Rountev, and B. G. Ryder. Precise and efficient call graph construction for c programs with function pointers. Journal of Automated Software Engineering, 2004.
20. A. Miné. A new numerical abstract domain based on difference-bound matrices. In Proceedings of the 2nd Symposium PADO'2001, volume LNCS 2053, pages 155-172, 2001.
21. A. Miné. The octagon abstract domain. In AST 2001 in WORE 2001, IEEE, pages 310-319. IEEE CS Press, October 2001.
22. PolySpace Technologies, http://www.polyspace.com.
23. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis using 3-valued logic. In Proceedings of Symposium on Principles of Programming Languages, 1999.
24. B. Steensgaard. Points-to analysis in almost linear time. In Proceedings of the ACM Conference on Principles of Progamming Languages, 1996.
25. The PostgreSQL Global Development Group. http://www.postgresql.org.
26. A. Venet. A scalable nonuniform pointer analysis for embedded programs. Submitted to publication.
27. 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.
28. A. Venet. Automatic analysis of pointer aliasing for untyped programs. Science of Computer Programming, 35(2):223-248, 1999.
29. 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.