A Schema for Interprocedural Modification Side-Effect Analysis with Pointer Aliasing

ACM Transactions on Programming Languages and Systems

Volumn 23, Issue 2, 2001, Pages 105-186

  Ryder, Barbara G ^b   Landi, William A ^a   Stocks, Philip A ^b   Zhang, Sean ^b   Altucher, Rita ^a  

^a SIEMENS CORPORATE RESEARCH   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

D.3.4 Programming Languages : Processors Compilers; F.3.2 Logics and Meanings of Programs : Semantics of Programming Languages Program analysis; Optimization

Indexed keywords

PARAMETERIZATIONS;

ALGORITHMS; CONTEXT FREE LANGUAGES; CONTEXT SENSITIVE LANGUAGES; DATA FLOW ANALYSIS; INFORMATION ANALYSIS; LOGIC PROGRAMMING; OPTIMIZATION; PROGRAM COMPILERS; SEMANTICS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0002174919     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/383043.381532     Document Type: Article

References (120)

1. AHO, A. V., SETHI, R., AND ULLMAN, J. D. 1986. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, MA.
2. ALLEN, F. E. 1974. Interprocedural data flow analysis. In Proceedings of 1974 IFIP Congress, Amsterdam, Holland, pp. 398-402. Institute of Electrical and Electronics Engineers, Inc., North Holland Publishing Company.
3. ANDERSEN, L. O. 1994. Program analysis and specialization for the C programming language. Ph.D. Thesis, DIKU, University of Copenhagen. Also available as DIKU report 94/19.
4. ATKINSON, D. AND GRISWOLD, W. 1996. The design of whole-program analysis tools. In Proceedings of the 18th International Conference on Software Engineering, pp. 16-27.
5. ATKINSON, D. AND GRISWOLD, W. 1998. Effective whole-program analysis in the presence of pointers. In Proceedings of the ACM SIGSOFT '98 Symposium on the Foundations of Software Engineering, pp. 46-55.
6. BANERJEE, U. 1988. Dependence Analysis for Supercomputing. Kluwer Academic Publishers, Norwell, MA.
7. BANNING, J. 1979. An efficient way to find the side effects of procedure calls and the aliases of variables. In Conference Record of the Sixth Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages. pp. 29-41.
8. BARTH, J. M. 1978. A practical interprocedural data flow analysis algorithm. Communications of the ACM 21, 9, 724-736.
9. BATES, S. AND HORWITZ, S. 1993. Incremental program testing using dependence graphs. In Conference Record of the Twentieth Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, pp. 384-396.
10. BURKE, M. 1990. An interval-based approach to exhaustive and incremental interprocedural data flow analysis. ACM Transactions on Programming Languages and Systems, 12, 3, 341-395.
11. BURKE, M. AND RYDER, B. G. 1990. A critical analysis of incremental iterative data flow analysis algorithms. IEEE Transactions on Software Engineering, 16, 7.
12. BURKE, M., CARINI, P., CHOI, J.-D., AND HIND, M. 1994. Flow-insensitive interprocedural alias analysis in the presence of pointers. In Proceedings of the Seventh International Workshop on Languages and Compilers for Parallel Computing, pp. 234-250. Springer-Verlag.
13. BURKE, M., CARINI, P., CHOI, J.-D., AND HIND, M. 1997. Interprocedural pointer alias analysis. Research Report RC 21055, IBM T. J. Watson Research Center.
14. CARROLL, M. D. 1988. A new pointer-removing program transformation. Unpublished manuscript.
15. CARROLL, M. D. AND RYDER, B. G. 1988. Incremental data flow analysis via dominator and attribute updates. In Conference Record of the Fifteenth Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, pp. 274-284.
16. CHASE, D. R., WEGMAN, M., AND ZADECK, F. K. 1990. Analysis of pointers and structures. In Proceedings of the SIGPLAN '90 Conference on Programming Language Design and Implementation, pp. 296-310. SIGPLAN Notices, Vol. 25, No. 6.
17. CHATTERJEE, R. 1999. Modular data-flow analysis of statically typed object-oriented programming languages. Ph.D. Thesis, Department of Computer Science, Rutgers University.
18. CHATTERJEE, R. AND RYDER, B. G. 1999. Data-flow-based testing of object-oriented libraries. Department of Computer Science Technical Report DCS-TR-382, Rutgers University.
19. CHATTERJEE, R., RYDER, B. G., AND LANDI, W. A. 1999. Relevant context inference. In Conference Record of the Twenty-Sixth Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages.
20. CHOI, J.-D., BURKE, M., AND CARINI, P. 1993. Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. In Conference Record of the Twentieth Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, pp. 232-245.
21. COOPER, K. 1985. Analyzing aliases of reference formal parameters. In Conference Record of the Twelfth Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, pp. 281-290.
22. COOPER, B. G. 1989. Ambitious data flow analysis of procedural programs. Master's Thesis, University of Minnesota.
23. COOPER, K. AND KENNEDY, K. 1984. Efficient computation of flow insensitive interprocedural summary information. In Proceedings of the ACM SIGPLAN Symposium on Compiler Construction, pp. 247-258. SIGPLAN Notices, Vol. 19, No. 6.
24. COOPER, K. AND KENNEDY, K. 1987. Complexity of interprocedural side-effect analysis. Computer Science Department Technical Report TR87-61, Rice University.
25. COOPER, K. AND KENNEDY, K. 1988. Interprocedural side-effect analysis in linear time. In Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, pp. 57-66.
26. COUTANT, D. S. 1986. Retargetable high-level alias analysis. In Conference Record of the Thirteenth Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, pp. 110-118.
27. DAS, M. 2000. Unification-based pointer analysis with directional assignments. In Proceedings of the ACM SIGPLAN '00 Conference on Programming Language Design and Implementation, pp. 35-46.
28. DEUTSCH, A. 1990. On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications. In Conference Record of the Seventeenth Annual ACM SIGACT/ SIGPLAN Symposium on Principles of Programming Languages, pp. 157-168.
29. DEUTSCH, A. 1992. A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations. In Proceedings of the IEEE 1992 Conference on Computer Languages, pp. 2-13.
30. DEUTSCH, A. 1994. Interprocedural may alias for pointers: Beyond k-limiting. In Proceedings of the SIGPLAN '94 Conference on Programming Language Design and Implementation, pp. 230-241.
31. DUESTERWALD, E., GUPTA, R., AND SOFFA, M. L. 1995. Demand-driven computation of interprocedural data flow. In Conference Record of the Twenty-Second Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages.
32. DUESTERWALD, E., GUPTA, R., AND SOFFA, M. L. 1996. A demand-driven analyzer for data flow testing at the integration level. In Proceedings of the International Conference on Software Engineering (ICSE'96).
33. EMAMI, M. 1993. A practical interprocedural alias analysis for an optimizing/parallelizing C compiler. Master's Thesis, McGill University, Montreal, Canada.
34. EMAMI, M., GHIYA, R., AND HENDREN, L. J. 1994. Context-sensitive interprocedural points-to analysis in the presence of function pointers. In Proceedings of the SIGPLAN '94 Conference on Programming Language Design and Implementation, pp. 242-257. Published as SIGPLAN Notices, 29 (6).
35. FAHNDRICH, M., REHOF, J., AND DAS, M. 2000. Scalable context-sensitive flow analysis using instantiation constraints. Proceedings of the ACM SIGPLAN '00 Conference on Programming Language Design and Implementation, pp. 253-263.
36. FRANKEL, P. AND IAKOUNENKO, O. 1998. Further empirical studies of test effectiveness. In ACM SIGSOFT '98 Sixth International Symposium on the Foundations of Software Engineering, pp. 153-162.
37. FRANKEL, P. AND WEISS, S. 1993. An experimental comparison of the effectiveness of branch testing with data-flow testing. IEEE Transactions on Software Engineering 19, 8, 774-787.
38. FOSTER, J., FAHNDRICH, M., AND AIKEN, A. 2000. Polymorphic versus monomorphic flow-insensitive points-to analysis for C. In Proceedings of International Symposium on Static Analysis (SAS '00).
39. GALLAGHER, K. AND LYLE, J. 1991. Using program slices in software maintenance. IEEE Transactions on Software Engineering 17, 8, 751-761.
40. GHIYA, R. AND HENDREN, L. 1996a. Connection analysis: A practical interprocedural heap analysis for C. International Journal of Parallel Programming.
41. GHIYA, R. AND HENDREN, L. 1996b. Is it a tree, a dag or a cyclic graph? A shape analysis for heap-directed pointers in C. In Conference Record of the Twenty-Third Annual ACM SIGACT/ SIGPLAN Symposium on Principles of Programming Languages, pp. 1-15.
42. GHIYA, R. AND HENDREN, L. 1998. Putting pointer analysis to work. In Conference Record of the Twenty-Fifth Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, pp. 121-133.
43. GUARNA, C. A. 1988. A technique for analyzing pointer and structure references in parallel restructuring compilers. In Proceedings of the International Conference on Parallel Processing, pp. 212-220.
44. GUPTA, R. AND SOFFA, M. L. 1996. Hybrid slicing: An approach for refining static slices using dynamic information. In Proceedings of Third ACM SIGSOFT Symposium on Foundations of Software Engineering, pp. 29-40.
45. HARRISON, W. L., III AND AMMARGUELLAT, Z. 1990. Parcel and Miprac: Parallelizers for symbolic and numeric programs. In Proceedings of International Workshop on Compilers for Parallel Computers, pp. 329-346. Ecole des Mines de Paris - CAI, UPMC - Laboratoire MASI, Paris, France.
46. HARROLD, M. J. AND CI, N. 1998. Reuse-driven interprocedural slicing. In Proceedings of the Twentieth International Conference on Software Engineering, pp. 74-83.
47. HARROLD, M. J. AND SOFFA, M. L. 1991. Selecting and using data for integration testing. IEEE Software 8, 2, 58-65.
48. HARROLD, M. J. AND SOFFA, M. L. 1994. Efficient computation of interprocedural definition-use chains. ACM Transactions on Programming Languages and Systems 16, 2, 175-204.
49. HASTI, R. AND HORWITZ, S. 1998. Using static single assignment form to improve flow-insensitive pointer analysis. In Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation, pp. 97-105.
50. HENDREN, L. AND NICOLAU, A. 1990. Parallelizing programs with recursive data structures. IEEE Transaction on Parallel and Distributed Systems.
51. HENDREN, L., HUMMEL, J., AND NICOLAU, A. 1992. Abstractions for recursive pointer data structures: Improving analysis and transformations of imperative languages. In Proceedings of the SIGPLAN '92 Conference on Programming Language Design and Implementation, pp. 249-260. SIGPLAN Notices, Vol. 27, No. 6.
52. HIND, M. AND PIOLI, A. 1998. Assessing the effects of flow sensitivity on pointer alias analysis. In Proceedings of International Static Analysis Symposiusm (SAS'98), pp. 57-81. Springer-Verlag.
53. HIND, M. AND PIOLI, A. 2000. Evaluating the effectiveness of pointer alias analyses. In Proceedings of ACM SIGSOFT International Symposium on Software Testing and Analysis. Also available as IBM Research Center Technical Report RC21510.
54. HIND, M., BURKE, N, CARINI, P., AND CHOI, J.-D. 1999. Interprocedural pointer alias analysis. ACM Transactions on Programming Languages and Systems 21, 4, 848-894.
55. HORWITZ, S., PFEIFFER, P., AND REPS, T. 1989. Dependence analysis for pointer variables. In Proceedings of the ACM SIGPLAN Symposium on Compiler Construction, pp. 28-40.
56. HORWITZ, S., REPS, T., AND BINKLEY, D. 1990. Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems 12, 1.
57. HORWITZ, S., REPS, T., AND SAGIV, M. 1995. Demand interprocedural dataflow analysis. In Proceedings of the Third ACM SIGSOFT Symposium on the Foundations of Software Engineering, pp. 104-115.
58. HUTCHINS, M., FOSTER, H., GORADIA, T., AND OSTRAND, T. 1994. Experiments on the effectiveness of dataflow-and controlflow-based test adequacy criteria. In Proceedings of the Sixteenth International Conference on Software Engineering, pp. 191-200.
59. JONES, N. D. AND MUCHNICK, S. 1982a. Flow analysis and optimization of LISP-like structures. In Program Flow Analysis: Theory and Applications. S. Muchnick and N. Jones, Ed. Prentice Hall, Englewood, Cliff., NJ, pp. 102-131.
60. JONES, N. D. AND MUCHNICK, S. S. 1982b. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Conference Record of the Ninth Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, pp. 66-74.
61. KAM, J. B. AND ULLMAN, J. D. 1977. Monotone data flow analysis frameworks. Acta Informatica 7, pp. 305-317.
62. KILDALL, G. 1973. A unified approach to global program optimization. In Conference Record of the ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, pp. 194-206.
63. LANDI, W. 1992a. Interprocedural aliasing in the presence of pointers. Ph.D. Thesis, Rutgers University. LCSR-TR-174.
64. LANDI, W. 1992b. Undecidability of static analysis. ACM Letters on Programming Languages and Systems 1, (4):323-337.
65. LANDI, W. AND RYDER, B. G. 1991. Pointer-induced aliasing: A problem classification. In Conference Record of the Eighteenth Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, pp. 93-103.
66. LANDI, W. AND RYDER, B. G. 1992. A safe approximation algorithm for interprocedural pointer aliasing. In Proceedings of the SIGPLAN '92 Conference on Programming Language Design and Implementation, pp. 235-248.
67. LANDI, W. AND RYDER, B. G. AND ZHANG, S. 1993. Interprocedural modification side effect analysis with pointer aliasing. In Proceedings of the SIGPLAN '93 Conference on Programming Language Design and Implementation, pp. 56-67.
68. LARSEN, L. AND HARROLD, M. J. 1996. Slicing object-oriented software. In Proceedings of the Eighteenth International Conference on Software Engineering, pp. 495-505.
69. LARUS, J. R. AND HILFINGER, P. N. 1988. Detecting conflicts between structure accesses. In Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, pp. 1-34. SIGPLAN NOTICES, Vol. 23, No. 7.
70. LIANG, D. AND HARROLD, M. J. 1999. Efficient points-to analysis for whole-program analysis. In Proceedings of the Seventh Annual ACM SIGSOFT Symposium on the Foundations of Software Engineering, LNCS, Vol. 1687, pp. 199-215.
71. MARLOWE, T. J. AND RYDER, B. G. 1990a. An efficient hybrid algorithm for incremental data flow analysis. In Conference Record of the Seventeenth Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, pp. 184-196.
72. MARLOWE, T. J. AND RYDER, B. G. 1990b. Properties of data flow frameworks: A unified model. Acta Informatica 28, 121-163.
73. MARLOWE, T. J. AND RYDER, B. G. 1991. Hybrid incremental alias algorithms. In Proceedings of the Twenty-Fourth Hawaii International Conference on System Sciences, Vol. II, Software.
74. MARLOWE, T. J., LANDI, W. A., RYDER, B. G., CHOI, J., BURKE, M., AND CARINI, P. 1993. Pointer-induced aliasing: A clarification. ACM SIGPLAN Notices 28, 9, 67-70.
75. NEIRYNCK, A., PANANGADEN, P., AND DEMERS, A. 1987. Computation of aliases and support sets. In Conference Record of the Fourteenth Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, 274-283.
76. OSTRAND, T. J. 1990. Data-flow testing with pointers and function calls. In Proceedings of the Pacific Northwest Software Quality Conference.
77. OTTENSTEIN, K. J. AND OTTENSTEIN, L. M. 1984. The program dependence graph in a software development environment. In Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, pp. 177-184.
78. PANDE, H. D., LANDI, W., AND RYDER, B. G. 1994. Interprocedural def-use associations for C systems with single level pointers. IEEE Transactions on Software Engineering 20, 5, 385-403.
79. PIOLI, A. 1999. Conditional pointer aliasing and constant propagation. Master's Thesis, SUNY at New Paltz. Available at http://www.mcs.newpaltz/tr as Technical Report 99-102.
80. POLLOCK, L. AND SOFFA, M. 1989. An incremental version of iterative data flow analysis. IEEE Transactions on Software Engineering 15, 12.
81. POLYCHRONOPOLOUS, C. D. 1988. Parallel Programming and Compilers. Kluwer Academic Publishers.
82. RAMALINGAM, G. 1994. The undecidability of aliasing. ACM Transactions on Programming Languages and Systems 16, 5, 1467-1471.
83. REPS, T. AND ROSAY, G. 1995. Precise interprocedural chopping. In Proceedings of the Third ACM SIGSOFT Symposium on Foundations of Software Engineeering, pp. 41-52.
84. REPS, T., HORWITZ, S. AND SAGIV, M. 1995. Precise interprocedural dataflow analysis via graph reachability. In Conference Record of the Twenty-Second Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, pp. 49-61.
85. ROUNTEV, A. AND CHANDRA, S. 2000. Off-line variable substitution for scaling points-to analysis. In Proceedings of the ACM SIGPLAN '00 Conference on Programming Language Design and Implementation, pp. 47-56.
86. ROUNTEV, A., MILANOVA, A., AND RYDER, B. G. 2000. Points-to analysis for Java using annotated inclusion constraints. To appear in Proceedings of OOPSLA'Ol: Conference on Object-Oriented Programming Systems, Languages and Applications. Also available as Rutgers University Department of Computer Science Technical Report DCS-TR-428.
87. ROUNTEV, A., RYDER, B. G., AND LANDI, W. A. 1999. Data-flow analysis of program fragments. In Proceedings of Sixth ACM SIGSOFT Symposium on Foundations of Software Engineering, LNCS 1687, pp. 235-252.
88. RUGGIERI, C. AND MURTAGH, T. 1988. Lifetime analysis of dynamically allocated objects. In Conference Record of the Fifteenth Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, pp. 285-293.
89. RUGINA, R. AND RINARD, M. 1999. Pointer analysis for multithreaded programs. In Proceedings of the ACM SIGPLAN '99 Conference on Programming Language Design and Implementation, pp. 77-90.
90. RYDER, B. G. 1983. Incremental data flow analysis. In Conference Record of the Tenth Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, pp. 167-176.
91. RYDER, B. G. AND PAULL, M. C. 1988. Incremental data flow analysis algorithms. ACM Transactions on Programming Languages and Systems 10, 1, 1-50.
92. RUF, E. 1995. Context-insensitive alias analysis reconsidered. In Proceedings of the SIGPLAN '95 Conference on Programming Language Design and Implementation, pp. 13-22.
93. RUF, E. 1997. Partitioning data flow analysis using types. In Conference Record of the Twenty-Fourth Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, pp. 15-26.
94. SAGIV, S., FRANCEZ, N., RODEH, M., AND WILHELM, R. 1990. A logic-based approach to data flow analysis. In Proceedings of the Second International Workshop in Programming Language Implementation and Logic Programming, pp. 277-292. Volume 456 of Lecture Notes in Computer Science.
95. SAGIV, M., REPS, T., AND WILHELM, R. 1998. Solving shape-analysis problems in languages with destructive updating. ACM Transactions on Programming Languages and Systems 20, 1, 1-50.
96. SHAPIRO, M. AND HORWITZ, S. 1997a. The effects of the precision of pointer analysis. In Proceedings of the Fourth International Symposium on Static Analysis (SAS'97), pp. 16-34.
97. SHAPIRO, M. AND HORWITZ, S. 1997b. Fast and accurate flow-insensitive points-to analysis. In Conference Record of the Twenty-Fourth Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, pp. 1-14.
98. SHARIR, M. AND PNUELI, A. 1981. Two approaches to interprocedural data flow analysis. In Program Flow Analysis: Theory and Applications, S. Muchnick and N. Jones, Ed., Prentice Hall, Englewood, Cliff., pp. 189-234.
99. SHIVERS, O. 1988. Control flow analysis in scheme. In Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, pp. 164-174.
100. SINHA, S., HARROLD, M. J., AND ROTHERMEL, G. 1999. System-dependence-graph-based slicing of programs with arbitrary interprocedural control flow. In Proceedings of the Twenty-First International Conference on Software Engineering, pp. 432-441.
101. SPILLMAN, T. 1971. Exposing side effects in a PL-I optimizing compiler. In Proceedings of IFIPS Conference, pp. TA-3-56-TA-3-62.
102. STEENSGAARD, B. 1996a. Points-to analysis by type inference of programs with structures and unions. In Proceedings of the Sixth International Conference on Compiler Construction, pp. 136-150. Also available as LNCS 1060.
103. STEENSGAARD, B. 1996b. Points-to analysis in almost linear time. In Conference Record of the Twenty-Third Annual ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, pp. 32-41.
104. TIP, F. 1996. A survey of program slicing techniques. Journal of Programming Languages 3, 3, pp. 121-189.
105. ++. In Proceedings of OOPSLA'96: Conference on Object-Oriented Programming Systems, Languages and Applications, pp. 179-197.
106. ++ pointers and polymorphism analysis and its application to slicing. In Proceedings of the Nineteenth International Conference on Software Engineering (ICSE97), pp. 433-443.
107. VENKATESH, G. A. 1991. The semantic approach to program slicing. In Proceedings of the SIGPLAN '91 Conference on Programming Language Design and Implementation, pp. 107-119.
108. WEIHL, W. E. 1980. Interprocedural data flow analysis in the presence of pointers, procedure variables and label variables. Master's Thesis, M.I.T.
109. WEISER, M. 1984. Program slicing. IEEE Transactions on Software Engineering SE-10, 4, 352-357.
110. WEYUKER, E. 1994. More experience with data flow testing. IEEE Transactions on Software Engineering 19, 9, 912-919.
111. WILSON, R. AND LAM, M. 1995. Efficient context-sensitive pointer analysis for C programs. In Proceedings of the SIGPLAN '95 Conference on Programming Language Design and Implementation, pp. 1-12. Also available as SIGPLAN Notices, Vol. 30, No. 6.
112. WILSON, R. AND LAM, M. 1995. Efficient context-sensitive pointer analysis for C programs. In Proceedings of the SIGPLAN '95 Conference on Programming Language Design and Implementation, pp. 1-12. Also available as SIGPLAN Notices, Vol. 30, No. 6.
113. WOLFE, M. 1989. Optimizing Supercompilers for Supercomputers. The MIT Press, Cambridge, MA.
114. YONG, S. H., HORWITZ, S., AND REPS, T. 1999. Pointer analysis for programs with structures and casting. In Proceedings of the ACM SIGPLAN '99 Conference on Programming Language Design and Implementation, pp. 91-103.
115. YUR, J., RYDER, B. G., AND LANDI, W. 1999. An incremental flow-and context-sensitive pointer aliasing analysis. In Proceedings of the Twenty-First International Conference on Software Engineering, pp. 442-451.
116. YUR, J., RYDER, B. G., LANDI, W., AND STOCKS, P. 1997. Incremental analysis of side effects for C software systems. In Proceedings of the Nineteenth International Conference on Software Engineering, pp. 422-432.
117. ZHANG, S. 1995. Program decomposition. Student poster presentation at PLDI'95.
118. ZHANG, S. 1998. Practical pointer aliasing analyses for C. Ph.D. Thesis, Rugters University. Also available as Dept. of Computer Science Technical Report DCS-TR-367.
119. ZHANG, S., RYDER, B. G., AND LANDI, W. 1996. Program decomposition for pointer aliasing: A step towards practical analyses. In Proceedings of the Fourth Annual ACM SIGSOFT Symposium on the Foundations of Software Engineering, pp. 81-92.
120. ZHANG, S., RYDER, B. G., AND LANDI, W. A. 1998. Experiments with combined analysis for pointer aliasing. In Proceedings of ACM SIGPLAN Workshop on Program Analysis and Software Tools for Engineering, pp. 11-18.