Thomas Reps
Genevieve Rosay
- 1.Agrawal, H., "On slicing programs with jump statements," Proceedings of the ACM SIGPLAN 94 Conference on Programming Lunguage Design and Implementation, (Orlando, FL, June 22-24, 1994), ACM SIGPLAN Notices 29(6) pp. 302-312 (June 1994). Google Scholar
Digital Library
- 2.Ball, T. and Horwitz, S., "Slicing programs with arbitrary control flow," pp. 206-222 in Proceedings of the First International Workshop on Automated and Algorithmic Debugging, (Linkoping, Sweden, May 1993). Lecture Notes in Computer Science, Vol. 749, Springer-Verlag, New York, NY (1993). Google ScholarDigital Library
- 3.Bannerjee, U., "Speedup of ordinary programs" Ph.D. dissertation and Tech. Rep, R-79-989, Dept. of Computer Science, University of Illinois, Urbana, IL (October 1979). Google ScholarDigital Library
- 4.Bates, S. and Horwitz, S., "Incremental program testing using program dependence graphs," pp. 384-396 in Conference Record of the Twentieth ACM Symposium on Principles of Programming languages, (Charleston, SC, January 10-13, 1993), ACM, New York, NY (1993). Google ScholarDigital Library
- 5.Binkley, D., "Using semantic differencing to reduce the cost of regression testing," Proceedings of the 1992 Conference on Software Maintenance (Orlando, Florida, November 9-12, 1992), pp. 41-50 (1992).Google Scholar
- 6.Chase, D. R., Wegman, M., and Zadeck, F. K., "Analysis of pointers and structures:' Proceedings of the ACM SIGPLAN 90 Conference on Programming Language Design and Implementation, (White Plains, NY, June 20-22, 1990), ACM SIGPLAN Notices 25(6) pp. 296-310 (June 1990). Google ScholarDigital Library
- 7.Choi, J.-D. and Ferrante, J., "Static slicing in the presence of GOTO statements," ACM Trans. Program. Lung. Syst. 16(4) Pp. 1097-1113 (July 1994). Google ScholarDigital Library
- 8.Ferrante, J., Ottenstein, K., and Warren, J., "The program dependence graph and its use in optimization," ACM Trans. Program. Lang. Syst. 9(3) pp. 319-349 (July 1987). Google ScholarDigital Library
- 9.Gallagher, K.B. and Lyle, J.R., "Using program slicing in software maintenance," IEEE Transactions on Software Engineering 17(8) pp. 751-761 (August 199 1). Google ScholarDigital Library
- 10.Goff, G., Kennedy, K., and Tseng, C.-W., "Practical dependence testing," Proceedings of the ACM SIGPLAN 91 Conference on Programming Language Design and Implementation, (Toronto, Ontario, June 26-28, 199 1), ACM SIG- PLAN Notices 26(6) pp. 15-29 (June 1991). Google ScholarDigital Library
- 11.Horwitz, S., Pfeiffer, P., and Reps, T., "Dependence analysis for pointer variables," Proceedings of the ACM SIGPLAN 89 Conference on Programming Language Design and Implementation, (Portland, OR, June 21-23, 1989), ACM SIG- PLAN Notices 24(7) pp. 28-40 (July 1989). Google ScholarDigital Library
- 12.Horwitz, S., Prins, J., and Reps, T., "Integrating noninterfering versions of programs," ACM Trans. Program. Lang. Syst. 11(3) pp. 345-387 (July 1989). Google ScholarDigital Library
- 13.Horwitz, S., Reps, T., and Binkley, D., "InterProcedural slicing using dependence graphs," ACM Trans. Program. Lang. Syst. 12(1) pp. 26-60 (January 1990). Google ScholarDigital Library
- 14.Horwitz, S., "Identifying the semantic and textual differences between two versions of a program," Proceedings of the ACM SIGPLAN 90 Conference on Programming Language Design and Implementation, (White Plains, NY, June 20-22, 1990), ACM SIGPLAN Notices 25(6) pp. 234-245 (June 1990). Google ScholarDigital Library
- 15.Jackson, D. and Rollins, E.J., "A new model of program dependence for reverse engineering," SIGSOFT 94: Proceedings of the Second ACM SIGSOFT Symposium on the Foundations of Software Engineering, (New Orleans, LA, December 7-9, 1994), ACM SIGSOFT Software Engineering Notes 19 pp. 2-10 (December 1994). Google ScholarDigital Library
- 16.Kuck, D. J., Kuhn, R. H., Leasure, B., Padua, D. A., and Wolfe, M., "Dependence graphs and compiler optimization," pp. 207-218 in Conference Record of the Eighth ACM Symposium on Principles of Programming Languages, (Williamsburg, VA, January 26-28, 1981), ACM, New York, NY (1981). Google ScholarDigital Library
- 17.Landi, W. and Ryder, B. G., "Pointer-induced aliasing," A problem classification," pp. 93-103 in Conference Record of the Eighteenth ACM Symposium on Principles of Programming Languages, (Orlando, FL, January 1991), ACM, New York, NY (1991). Google ScholarDigital Library
- 18.Lams, J.R. and Hilfinger, P. N., "Detecting conflicts between structure accesses," Proceedings of the ACM SIGPLAN 88 Conference on Programming Language Design and Implementation, (Atlanta, GA, June 22-24, 1988), ACM SIGPLAN Notices 23(7) pp. 21-34 (July 1988). Google ScholarDigital Library
- 19.Lyle, J. and Weiser, M., "Experiments on slicingbased debugging tools," in Proceedings of the First Conference on Empirical Studies of Programming, (June 1986), Ablex Publishing Co. (1986). Google ScholarDigital Library
- 20.Markosian, L., Newcomb, P., Brand, R., Burson, S., and Kitzmiller, T., "Using an enabling technology," Commun. of the ACM 37(5) pp. 58-70 (May 1994). Google ScholarDigital Library
- 21.Maydan, D. E., Hennessy, J.L., and Lam, M. S., "Efficient and exact data dependence analysis," Proceedings of the ACM SIGPLAN 91 Conference on Programming Language Design and Implementation, (Toronto, Ontario, June 26-28, 199 1), ACM SIGPLAN Notices 26(6) pp. 1-14 (June 1991). Google ScholarDigital Library
- 22.Ning, J.Q., Engberts, A., and Kozaczynski, W., "Automated support for legacy code understanding," Commun. of the ACM 37(5) pp. 50-57 (May 1994). Google ScholarDigital Library
- 23.Ottenstein, K.J. and Ottenstein, L. M., "The program dependence graph in a software development environment," Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, (Pittsburgh, PA, Apr. 23-25, 1984), ACM SIGPLAN Notices 19(5) pp. 177-184 (May 1984). Google ScholarDigital Library
- 24.Pugh, W., "The omega test: a fast and practical integer programming algorithm for dependence analysis," in Supercomputing 1991, (November 1991). Google ScholarDigital Library
- 25.Pugh, W. and Wonnacott, D., 'Eliminating false data dependence using the omega test," Proceedings of the ACM SIG- PLAN 92 Conference on Programming Language Design and Implementation, (San Francisco, CA, June 17-19, 1992), ACM SIGPLAN Notices 27(7) pp. 140-151 (July 1992). Google ScholarDigital Library
- 26.Reps, T., "Demonstration of a prototype tool for program integration," TR-8 19, Computer Sciences Department, University of Wisconsin, Madison, WI (January 1989).Google Scholar
- 27.Reps, T., Sagiv, M., and Horwitz, S., "Interprocedural dataflow analysis via graph reachability," TR 94-14, Datalogisk Institut, University of Copenhagen, Copenhagen, Denmark (April 1994). (Available on the World Wide Web at ftp://ftp.diku. dk/diku/semantics/papers/D-2 15.ps.Z.)Google Scholar
- 28.Reps, T., Horwitz, S., Sagiv, M., and Resay, G., "Speeding up slicing," SIGSOFT 94: Proceedings of the Second ACM SIGSOFT Symposium on the Foundations of Software Engineering, (New Orleans, LA, December 7-9, 1994), ACM SIGSOFT Software Engineering Notes 19(5) pp. 11-20 (December 1994). Google ScholarDigital Library
- 29.Reps, T., Horwitz, S., and Sagiv, M., "Precise interprocedural dataflow analysis via graph reachability," pp. 49-61 in Conference Record of the Twenty-Second ACM Symposium on Principles of Programming Lunguages, (San Francisco, CA, Jan. 23-25, 1995), ACM, New York, NY (1995). Google ScholarDigital Library
- 30.Sharir, M. and Pnueli, A., "Two approaches to interprocedural data flow analysis,' pp. 189-233 in Program Flow Analysis: Theory and Applications, ed. S.S. Muchnick and N.D. Jones,Prentice-Hall, Englewood Cliffs, NJ (1981).Google Scholar
- 31.Weiser, M., "Program slicing," IEEE Transactions on Software Engineering SE-10(4) pp. 352-357 (July 1984).Google ScholarDigital Library
- 32.Wolfe, M. J., "Optimizing supercompilers for supercomputers," Ph.D. dissertation and Tech. Rep. R-82-1105, Dept. of Computer Science, University of Illinois, Urbana, IL (October 1982). Google ScholarDigital Library
Index Terms
- Precise interprocedural chopping
Recommendations
Precise executable interprocedural slices
The notion of a program slice, originally introduced by Mark Weiser, is useful in program debugging, automatic parallelization, program integration, and software maintenance. A slice of a program is taken with respect to a program point p and a variable ...
Interprocedural pointer alias analysis
We present practical approximation methods for computing and representing interprocedural aliases for a program written in a language that includes pointers, reference parameters, and recursion. We present the following contributions: (1) a framework ...
Comments