Pointer-range analysis

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

Volumn 3148, Issue , 2004, Pages 133-148

  Yong, Suan Hsi ^a   Horwitz, Susan ^a  

^a University of Wisconsin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; STATIC ANALYSIS;

COMPILE TIME; CONCISE REPRESENTATIONS; INDEX VALUES; MEMORY LOCATIONS; MULTIPLE ARRAYS; POINTER ARITHMETIC; RANGE ANALYSIS; TARGET LOCATION;

C (PROGRAMMING LANGUAGE);

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

References (27)

1. G. Balakrishnan and T. Reps. Analyzing memory accesses in x86 executables. In International Conference on Compiler Construction, Barcelona, Spain, Mar. 2004.
2. W. Blume and R. Eigenmann. Demand-driven, symbolic range propagation. In 8th International workshop on Languages and Compilers for Parallel Computing, pages 141-160, Columbus OH, Aug. 1995.
3. R. Bodik, R. Gupta, and V. Sarkar. ABCD: Eliminating array bounds checks on demand. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 321-333, Vancouver, BC, June 2000.
4. M. C. Carlisle and A. Rogers. Software caching and computation migration in Olden. Technical Report TR-483-95, Princeton University, 1995.
5. P. Cousot and R. Cousot. Static determination of dynamic properties of programs. In ACM Symposium on Principles of Programming Languages, pages 106-130, Apr. 1976.
6. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In ACM Symposium on Principles of Programming Languages, pages 84-96, Jan. 1978.
7. B. Creusillet and F. Irigoin. Interprocedural array region analyses. International Journal of Parallel Programming, 24(6):513-546, Dec. 1996.
8. M. Das. Unification-based pointer analysis with directional assignments. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 35-46, Vancouver, BC, June 2000.
9. N. Dor, M. Rodeh, and M. Sagiv. Cleanness checking of string manipulations in C programs via integer analysis. In The 8th International Static Analysis Symposium, volume 2126 of Lecture Notes in Computer Science, page 194. Springer, July 2001.
10. M. Emami, R. Ghiya, and L. Hendren. Context-sensitive interprocedural points-to analysis in the presence of function pointers. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 242-256, Orlando, FL, June 1994.
11. J. Gu, Z. Li, and G. Lee. Symbolic array dataflow analysis for array privatization and program parallelization. In ACM/IEEE Conference on Supercomputing, San Diego, CA, Dec. 1995.
12. M. Gupta, S. Mukhopadhyay, and N. Sinha. Automatic parallelization of recursive procedures. In International Conference on Parallel Architectures and Compilation Techniques (PACT), pages 139-148, Newport Beach, CA, Oct. 1999. IEEE Computer Society.
13. W. H. Harrison. Compiler analysis of the value ranges for variables. In IEEE Transactions on Software Engineering, volume SE-3, pages 243-250, May 1977.
14. P. Havlak and K. Kennedy. An implementation of interprocedural bounded regular section analysis. IEEE Transactions of Parallel and Distributed Computing, 2(3):350-360, July 1991.
15. T. Jim, G. Morrisett, D. Grossman, M. Hicks, J. Cheney, and Y. Wang. Cyclone: A safe dialect of C. In USENIX Annual Technical Conference, Monterey, CA, June 2002.
16. W. Landi and B. G. Ryder. A safe approximate algorithm for interprocedural pointer aliasing. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 235-248, San Francisco, CA, June 1992.
17. D. Larochelle and D. Evans. Statically detecting likely buffer overflow vulnerabilities. In USENIX Security Symposium, Washington, D.C., Aug. 2001.
18. F. Martin. Experimental comparison of call string and functional approaches to interprocedural analysis. In 6th Int. Conf. on Compiler Construction, volume 1575 of Lecture Notes in Computer Science, pages 63-75. Springer, Mar. 1999.
19. J. R. C. Patterson. Accurate static branch prediction by value range propagation. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 67-78, La Jolla, CA, June 1995.
20. W. Pugh and D. Wonnacott. Constraint-based array dependence analysis. ACM Transactions on Programming Languages and Systems, 20(3):635-678, May 1998.
21. R. Rugina and M. Rinard. Symbolic bounds analysis of pointers, array indices, and accessed memory regions. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 182-195, Vancouver, BC, June 2000.
22. M. Stephenson, J. Babb, and S. Amarasinghe. Bitwidth analysis with application to silicon compilation. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 108-120, Vancouver, BC, June 2000.
23. Z. Su and D. Wagner. A class of polynomially solvable range constraints for interval analysis without widenings and narrowings. In Tools and Algorithms for the Construction and Analysis of Systems, volume 2988 of Lecture Notes in Computer Science, pages 280-295, Mar. 2004.
24. C. Verbrugge, P. Co, and L. Hendren. Generalized constant propagation: A study in C. In 6th Int. Conf. on Compiler Construction, volume 1060 of Lecture Notes in Computer Science, pages 74-90. Springer, Apr. 1996.
25. D. Wagner, J. Foster, E. Brewer, and A. Aiken. A first step towards automated detection of buffer overrun vulnerabilities. In Symposium on Network and Distributed Systems Security, pages 3-17, San Diego, CA, Feb. 2000.
26. J. Welsh. Economic range checks in Pascal. Software-Practice and Experience, 8:85-97, 1978.
27. R. P. Wilson and M. S. Lam. Efficient context-sensitive pointer analysis for C programs. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 1-12, La Jolla, CA, June 1995.