An algorithm for computing slices for recursive program

Systems and Computers in Japan

Volumn 27, Issue 3, 1996, Pages 46-59

  Ueda, Ryoichi ^a   Lian, Lin ^b   Inoue, Katsuro ^b   Torii, Koji ^c  

^a HITACHI LTD   (Japan)

^b OSAKA UNIVERSITY   (Japan)

^c NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Control dependence graph; Data dependence; Program dependence graph; Reaching definition set; Recursion

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SOFTWARE SELECTION AND EVALUATION; GRAPH THEORY; PROGRAM DEBUGGING;

PROGRAM DEPENDENCE GRAPH; PROGRAM SLICING; RECURSIONS;

ALGORITHMS;

EID: 0030104532     PISSN: 08821666     EISSN: None     Source Type: Journal    
DOI: 10.1002/scj.4690270305     Document Type: Article

References (13)

1. M. Weiser. Program Slicing. Proceedings of the Fifth International Conference on Software Engineering, pp. 439-449 (1981).
2. S. Horwitz, T. Reps and D. Binkley. Interprocedural Slicing Using Dependence Graphs. Proceedings of the SIGPLAN'88 Conference on Programming Language Design and Implementation, pp. 35-46 (1988).
3. S. Horwitz, T. Reps and D. Binkley. Interprocedural Slicing Using Dependence Graphs. ACM Transactionson Programming Languages and Systems, 12, 1, pp. 26-60 (1990).
4. S. Horwitz and T. Reps. The Use of Program Dependence Graphs in Software Engineering. Proceedings of the 14th International Conference on Software Engineering, pp. 392-411 (1992).
5. J. C. Hwang, M. W. Du and C. R. Chou. Finding Program Slices for Recursive Procedures. Proceedings of the IEEE COMPAC'88, pp. 220-227 (1988).
6. K. J. Ottenstein and L. M. Ottenstein. The Program Dependence Graph in a Software Development Environment. Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, ACM SIGPLAN Notices 19(5) pp. 177-184 (1984).
7. T. Shimomura. Program slicing technique and its application to testing, debugging and maintenance. Inf. Proc., 33, 9, pp. 1078-1086 (1992).
8. J. H. Kingston. Algorithms and Data Structures. Design, Correctness, Analysis. Addison-Wesley, 1990.
9. R. Ueda, L. Lian, K. Inoue and K. Torii. Analysis of dependencies in program containing recursions and program slicing based on analysis. Tech. Rep. I.E.I.C.E., Japan, SS93-24 (Sept. 1993).
10. A. V. Aho, S. Sethi and J. D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley (1986).
11. T. Shimomura. Bug localization based on error-cause-chasing methods. Transactions of Information Processing Society of Japan, 34,3, pp. 489-500 (1993).
12. M. J. Harrold and M. L. Soffa. Efficient computation of interprocedural definition-use chains. ACM Transactions on Programming Languages and Systems, 16, 2, 175-204 (1944).
13. H. D. Pande, W. A. Landi and B. G. Ryder. Interprocedural def-use associations for C systems with single level pointers. IEEE Transactions on Software Engineering, 20, 5, pp. 385-403 (1994).