Saurabh Sinha
- 1.A. V. Aho, R. Sethi, and J. D. Ullman. Compilers, Prin., Techniques, and Tools. Addison-Wesley Publishing Company, Reading, MA, 1986. Google Scholar
Digital Library
- 2.D. C. Atkinson and W. G. Griswold. The design of whole-program analysis tools. In Proc. of the 18th Int'l. Conf. on Softw. Eng., pages 16-27, Mar. 1996. Google ScholarDigital Library
- 3.T. Ball and S. Horwitz. Slicing programs with arbitrary control how. In Proc. of 1st Int'l Workshop on Automated and Algorithmic Debugging, volume 749 of Let. Notes in Computer Science, pages 206-222. Springer- Verlag, Nov. 1993. Google ScholarDigital Library
- 4.R.K. Chatterjee, B. G. Ryder, , and W. A. Landi. Complexity of concrete type-inference in the presence of exceptions. In Proc. of Euro. Symp. on Prog., Apr. 1998. Google ScholarDigital Library
- 5.J. Ferrante, K. J. Ottenstein, and J. D. Warren. The program dependence graph and its use in optimization. ACM Trans. on Prog. Lang. and Sys., 9(3):319-349, July 1987. Google ScholarDigital Library
- 6.Programming Languages Research Group. PROLANGS Analysis Framework, 1998.Google Scholar
- 7.D. Grove, G. DeFouw, J. Dean, and C. Chambers. Call graph construction in object-oriented languages. In PTOC. of Object-Oriented Prog. Sys., Lang. and Applications, pages 108-124, Oct. 1997. Google ScholarDigital Library
- 8.M. J. Harrold and Ning Ci. Reuse-driven interprocedural slicing. In PTOC. of the Int 'I Conf. on Softw. Eng., April 1998. Google ScholarDigital Library
- 9.M. J. Harrold and G. Rothermel. Aristotle: A system for research on and development of program-analysisbased tools. Technical Report OSU-CISRC-3/97-TR17, Mar. 1997.Google Scholar
- 10.M. J. Harrold, G. Rothermel, and S. Sinha. Computation of interprocedural control dependence. In PTOC. of the ACM Int'l. Symp. on Softw. Testing and Analysis, March 1998. Google ScholarDigital Library
- 11.S. Horwitz, J. Prins, and T. Reps. Integrating noninterfering versions of programs. ACM Trans. on Prog. Lang. and Sys., 11(3):345-387, July 1989. Google ScholarDigital Library
- 12.S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. ACM Trans. on Prog. Lang. and Sys., 12(1):26-60, Jan. 1990. Google ScholarDigital Library
- 13.W. Landi and B. G. Ryder. A safe approximate algorithm for interprocedural pointer aliasing. In PTOC. of SIGPLAN '92 Conf. on Prog. Lang. Design and Implem., pages 235-248, June 1992. Google ScholarDigital Library
- 14.W. Landi, B. G. Ryder, and S. Zhang. Interprocedural modification side effect analysis with pointer aliasing. In PTOC. of SIGPLAN'92 Conf. on Prog. Lang. Design and Implem., pages 56-67, June 1993. Google ScholarDigital Library
- 15.J G. C. Murphy, D. Notkin, W. G. Griswold, and E. S. Lan. An empirical study of static call graph extractors. ACM Trans. on Softw. Eng. and Meth., 7(2):158-191. Google ScholarDigital Library
- 16.G. Rothermel and M. J. Harrold. A safe, efficient regression test selection technique. ACM !Prans. on Softw. Eng.and Meth., 6(2):173-210, Apr. 1997. Google ScholarDigital Library
- 17.S. Sinha and M. J. Harrold. Analysis of programs that contain exception-handling constructs. In PTOC. of Int '1 Conf. on Softw. Maint., pages 348-357, Nov. 1998. Google ScholarDigital Library
- 18.S. Sinha, M. J. Harrold, and G. Rothermel. Systemdependence-graph-based slicing of programs with arbitrary interprocedural control flow. Technical Report OSU-CISRC-8/98, Aug. 1998.Google Scholar
- 19.M. Weiser. Program slicing. IEEE Trans. on Softw. Eng., 10(4):352-357, July 1984.Google ScholarDigital Library
Index Terms
- System-dependence-graph-based slicing of programs with arbitrary interprocedural control flow
Recommendations
Interprocedural slicing using dependence graphs
The notion of a program slice, originally introduced by Mark Weiser, is useful in program debugging, automatic parallelization, and program integration. A slice of a program is taken with respect to a program point p and a variable x; the slice consists ...
Conditioned Slicing of Interprocedural Programs
Program slicing is a technique to decompose programs depending on control flow and data flow amongst several lines of code in a program. Conditioned slicing is a generalization of static slicing and dynamic slicing. A variable, the desired program point,...
Precise slicing of interprocedural concurrent programs
Program slicing is an effective technique for analyzing concurrent programs. However, when a conventional closure-based slicing algorithmfor sequential programs is applied to a concurrent interprocedural program, the slice is usually imprecise owing to ...
Comments