Analyzing dependence locality for efficient construction of program dependence graph

Information and Software Technology

Volumn 42, Issue 13, 2000, Pages 935-946

  Ohata, F ^a   Nishimatsu, A ^a   Inoue, K ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PRECISION ENGINEERING; RESPONSE TIME (COMPUTER SYSTEMS); STORAGE ALLOCATION (COMPUTER);

PROGRAM DEPENDENCE GRAPHS (PDG); PROGRAM SLICING;

COMPUTER SYSTEMS PROGRAMMING;

EID: 0034275508     PISSN: 09505849     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0950-5849(00)00127-0     Document Type: Article

References (19)

1. Aho A.V., Sethi S., Ullman J.D. Compilers: Principles, Techniques, and Tools. 1986;Addison-Weseley, Reading, MA.
2. D.C. Atkison, W.G. Griswold, The design of whole-program analysis tools, in: Proceedings of the 18th International Conference on Software Engineering, Berlin, Germany, 1996, pp. 16-27.
3. J. Beck, D. Eichmann, Program and interface slicing for reverse engineering, in: Proceedings of the 15th International Conference on Software Engineering, 1993, pp. 509-518.
4. S. Bates, S. Horwitz, Incremental program testing using program dependence graphs, in: Conference Record of the 20th ACM Symposium on Principles of Programming Languages, 1993.
5. R. Fiutem, P. Tonella, G. Antoniol, E. Merlo, Variable precision reaching definitions analysis for software maintenance, in: Proceedings of the Euromicro Working Conference on Software Maintenance and Reengineering, Berlin, Germany, 1997, pp. 60-67.
6. Gallagher K.B., Lyle J.R. Using program slicing in software maintenance. IEEE Transactions on Software Engineering. 17:(8):1991;751-761.
7. S. Horwitz, T. Reps, The use of program dependence graphs in software engineering, in: Proceedings of the 14th International Conference on Software Engineering, Melbourne, Australia, 1992, pp. 392-411.
8. Horwitz S., Reps T., Binkley D. Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems. 12:(1):1990;26-60.
9. Korel B., Rilling J. Dynamic program slicing methods. Information and Software Technology (Special Issue on Program Slicing). 40:1998;647-659.
10. H. Kudo, Y. Sugiyama, M. Fujii, K. Torii, Quantifying a design process based on experiments, in: Proceedings of the 21st International Conference on System Sciences, Hawaii, 1988, pp. 285-292.
11. K. Nishie, T. Kamiya, S. Kusumoto, K. Inoue, Experimental evaluation of usefulness of debugging support system based on program slicing, in: Proceedings of Software Symposium '97, Japan, 1997, pp. 142-147 (in Japanese).
12. A. Nishimatsu, S. Kusumoto, K. Inoue, An experimental evaluation of program slicing on fault localization process, Technical Report of IEICE, SS98-3, Japan, 1998, pp. 17-24 (in Japanese).
13. A. Nishimatsu, K. Inoue, Proposal of a slicing algorithm and its efficiency and accuracy trade-off, Technical Report of IEICE, SS98-46, Japan, 1999, pp. 9-16 (in Japanese).
14. A. Nishimatsu, M. Jihira, S. Kusumoto, K. Inoue, Call-mark slicing: an efficient and economical way of reducing slice, in: Proceedings of the 21st International Conference on Software Engineering, Los Angeles, CA, USA, 1999, pp. 422-431.
15. S. Sato, H. Iida, K. Inoue, Software debug supporting tool based on program dependence analysis, in: Transaction on IPSJ, Japan, 1996, vol. 37, no. 4, pp. 536-545.
16. T. Takada, S. Sato, K. Inoue, Incremental update method of program dependence graph, in: Technical Report of IEICE, SS96-54, Japan, 1996, pp. 49-56 (in Japanese).
17. R. Ueda, K. Inoue, H. Iida, A practical slice algorithm for recursive programs, in: Proceedings of the International Symposium on Software Engineering for the Next Generation, Nagoya, Japan, 1996, pp. 96-106.
18. M. Weiser, Program slicing, in: Proceedings of the Fifth International Conference on Software Engineering, San Diego, CA, 1981, pp. 439-449.
19. The Wisconsin Program-Slicing Tool 1.0, Reference Manual. Computer Sciences Department, University of Wisconsin-Madison, 1997.