Theoretical foundations of dynamic program slicing

Theoretical Computer Science

Volumn 360, Issue 1-3, 2006, Pages 23-41

  Binkley, Dave ^a   Danicic, Sebastian ^b   Gyimóthy, Tibor ^c   Harman, Mark ^d   Kiss, Ákos ^c   Korel, Bogdan ^e  

^a LOYOLA UNIVERSITY MARYLAND   (United States)

^b UNIVERSITY OF LONDON   (United Kingdom)

^c UNIVERSITY OF SZEGED   (Hungary)

^d KING'S COLLEGE LONDON   (United Kingdom)

^e ILLINOIS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Dynamic slicing; Program slicing

Indexed keywords

COMPUTER OPERATING SYSTEMS; COMPUTER SCIENCE;

DYNAMIC SLICING; PROGRAM SLICING; PROJECTION THEORY; SLICING CRITERIA;

COMPUTER PROGRAMMING;

EID: 33746635158     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.01.012     Document Type: Article

References (62)

1. Agrawal H., DeMillo R.A., and Spafford E.H. Debugging with dynamic slicing and backtracking. Software Practice Experience 23 6 (1993) 589-616
2. H. Agrawal, J.R. Horgan, Dynamic program slicing, in: ACM SIGPLAN Conf. on Programming Language Design and Implementation, New York, 1990, pp. 246-256.
3. Beck J., and Eichmann D. Program and interface slicing for reverse engineering. IEEE/ACM 15th Conf. on Software Engineering (ICSE'93) (1993), IEEE Computer Society Press, Los Alamitos, CA, USA 509-518
4. Beszédes A., Gergely T., Szabó Z.M., Csirik J., and Gyimóthy T. Dynamic slicing method for maintenance of large C programs. Proc. Fifth European Conf. on Software Maintenance and Reengineering (CSMR 2001) (2001), IEEE Computer Society, Silver Spring, MA 105-113
5. Bieman J.M., and Ott L.M. Measuring functional cohesion. IEEE Trans. Software Eng. 20 8 (1994) 644-657
6. Binkley D.W. Precise executable interprocedural slices. ACM Lett. Programming Languages Systems 3 1-4 (1993) 31-45
7. D.W. Binkley, The application of program slicing to regression testing, in: M. Harman, K. Gallagher (Eds.), Information and Software Technology Special Issue on Program Slicing, Vol. 40, Elsevier, Amsterdam, 1998, pp. 583-594.
8. Binkley D., Danicic S., Gyimóthy T., Harman M., Kiss A., and Ouarbya L. Formalizing executable dynamic and forward slicing. Fourth Internat. Workshop on Source Code Analysis and Manipulation (SCAM 04) (2004), IEEE Computer Society Press, Los Alamitos, CA, USA, Chicago, IL, USA 43-52
9. Binkley D.W., and Gallagher K.B. Program slicing. In: Zelkowitz M. (Ed). Advances in Computing Vol. 43 (1996), Academic Press, New York 1-50
10. Binkley D.W., and Harman M. A survey of empirical results on program slicing. Adv. Comput. 62 (2004) 105-178
11. Binkley D.W., Horwitz S., and Reps T. Program integration for languages with procedure calls. ACM Trans. Software Eng. Methodology 4 1 (1995) 3-35
12. Canfora G., Cimitile A., and De Lucia A. Conditioned program slicing. In: Harman M., and Gallagher K. (Eds). Information and Software Technology Special Issue on Program Slicing Vol. 40 (1998), Elsevier Science B.V., Amsterdam 595-607
13. Canfora G., Cimitile A., De Lucia A., and Lucca G.A.D. Software salvaging based on conditions. Internat. Conf. on Software Maintenance (ICSM'96) (1994), IEEE Computer Society Press, Los Alamitos, CA, USA, Victoria, Canada 424-433
14. 2: reverse engineering and reuse re-engineering. J. Software Maintenance: Res. Practice 6 2 (1994) 53-72
15. R. Cartwright, M. Felleisen, The semantics of program dependence, in: ACM SIGPLAN Conf. on Programming Language Design and Implementation, 1989, pp. 13-27.
16. A. Cimitile, A. De Lucia, M. Munro, Identifying reusable functions using specification driven program slicing: a case study, in: Proc. IEEE Internat. Conf. on Software Maintenance (ICSM'95), IEEE Computer Society Press, Los Alamitos, CA, USA, Nice, France, 1995, pp. 124-133.
17. Cimitile A., De Lucia A., and Munro M. A specification driven slicing process for identifying reusable functions. Software Maintenance: Res. Practice 8 (1996) 145-178
18. S. Danicic, Dataflow minimal slicing, Ph.D. Thesis, School of Informatics, University of North London, UK, April 1999.
19. S. Danicic, M. Daoudi, C. Fox, M. Harman, R. M. Hierons, J. Howroyd, L. Ouarbya, M. Ward, Consus: a lightweight program conditioner, J. Systems Software (2004), accepted for publication.
20. De Lucia A. Program slicing: methods and applications. First IEEE Internat. Workshop on Source Code Analysis and Manipulation (2001), IEEE Computer Society Press, Los Alamitos, CA, USA, Florence, Italy 142-149
21. De Lucia A., Fasolino A.R., and Munro M. Understanding function behaviors through program slicing. Fourth IEEE Workshop on Program Comprehension (1996), IEEE Computer Society Press, Los Alamitos, CA, USA, Berlin, Germany 9-18
22. Ferrante J., Ottenstein K.J., and Warren J.D. The program dependence graph and its use in optimization. ACM Trans. Programming Languages Systems 9 3 (1987) 319-349
23. C. Fox, S. Danicic, M. Harman, R.M. Hierons, ConSIT: a fully automated conditioned program slicer, Software Practice Experience 43 (2004) 15-46; published online 26th November 2003.
24. Gallagher K.B. Evaluating the surgeon's assistant: results of a pilot study. Proc. Internat. Conf. on Software Maintenance (1992), IEEE Computer Society Press, Los Alamitos, CA, USA 236-244
25. Gallagher K.B., and Lyle J.R. Using program slicing in software maintenance. IEEE Trans. Software Eng. 17 8 (1991) 751-761
26. Giacobazzi R., and Mastroeni I. Non-standard semantics for program slicing. Higher-Order and Symbolic Comput. 16 4 (2003) 297-339 (special issue on Partial Evaluation and Semantics-Based Program Manipulation)
27. R. Gopal, Dynamic program slicing based on dependence graphs, in: IEEE Conf. on Software Maintenance, 1991, pp. 191-200.
28. Grammatech Inc., The codesurfer slicing system, 2002 〈URL www.grammatech.com〉.
29. Gupta R., Harrold M.J., and Soffa M.L. An approach to regression testing using slicing. Proc. IEEE Conf. on Software Maintenance (1992), IEEE Computer Society Press, Los Alamitos, CA, USA, Orlando, FL, USA 299-308
30. Harman M., Binkley D.W., and Danicic S. Amorphous program slicing. J. Systems Software 68 1 (2003) 45-64
31. Harman M., and Danicic S. Using program slicing to simplify testing. Software Testing, Verification Reliability 5 3 (1995) 143-162
32. Harman M., and Danicic S. Amorphous program slicing. Fifth IEEE Internat. Workshop on Program Comprehension (IWPC'97) (1997), IEEE Computer Society Press, Los Alamitos, CA, USA, Dearborn, Michigan, USA 70-79
33. Harman M., and Hierons R.M. An overview of program slicing. Software Focus 2 3 (2001) 85-92
34. Harman M., Hierons R.M., Danicic S., Howroyd J., and Fox C. Pre/post conditioned slicing. IEEE Internat. Conf. on Software Maintenance (ICSM'01) (2001), IEEE Computer Society Press, Los Alamitos, CA, USA, Florence, Italy 138-147
35. Harman M., Hu L., Hierons R.M., Wegener J., Sthamer H., Baresel A., and Roper M. Testability transformation. IEEE Trans. Software Eng. 30 1 (2004) 3-16
36. Harman M., Simpson D., and Danicic S. Slicing programs in the presence of errors. Formal Aspects Comput. 8 4 (1996) 490-497
37. Hierons R.M., Harman M., and Danicic S. Using program slicing to assist in the detection of equivalent mutants. Software Testing, Verification Reliability 9 4 (1999) 233-262
38. Hierons R.M., Harman M., Fox C., Ouarbya L., and Daoudi M. Conditioned slicing supports partition testing. Software Testing, Verification Reliability 12 (2002) 23-28
39. Horwitz S., Prins J., and Reps T. Integrating non-interfering versions of programs. ACM Trans. Programming Languages Systems 11 3 (1989) 345-387
40. S. Horwitz, T. Reps, D.W. Binkley, Interprocedural slicing using dependence graphs, in: ACM SIGPLAN Conf. on Programming Language Design and Implementation, Atlanta, Georgia, 1988, pp. 25-46; Proc. in SIGPLAN Notices, Vol. 23(7), 1988, pp. 35-46.
41. Horwitz S., Reps T., and Binkley D.W. Interprocedural slicing using dependence graphs. ACM Trans. Programming Languages Systems 12 1 (1990) 26-61
42. M. Kamkar, Interprocedural dynamic slicing with applications to debugging and testing, Ph.D. Thesis, Department of Computer Science and Information Science, Linköping University, Sweden, available as Linköping Studies in Science and Technology, Dissertations, Number 297, 1993.
43. M. Kamkar, N. Shahmehri, P. Fritzson, Interprocedural dynamic slicing, in: Proc. Fourth Conf. on Programming Language Implementation and Logic Programming, 1992, pp. 370-384.
44. Knuth D.E., and Floyd R.W. Notes on avoiding "go to" statements. Inform. Process. Lett. 1 1 (1971) 23-31
45. Korel B., and Laski J. Dynamic program slicing. Inform. Process. Lett. 29 3 (1988) 155-163
46. Korel B., and Rilling J. Dynamic program slicing in understanding of program execution. Fifth IEEE Internat. Workshop on Program Comprehension (IWPC'97) (1997), IEEE Computer Society Press, Los Alamitos, CA, USA, Dearborn, MI, USA 80-89
47. Korel B., and Rilling J. Dynamic program slicing methods. In: Harman M., and Gallagher K. (Eds). Information and Software Technology Special Issue on Program Slicing Vol. 40 (1998), Elsevier, Amsterdam 647-659
48. A. Lakhotia, Rule-based approach to computing module cohesion, in: Proc. 15th Conf. on Software Engineering (ICSE-15), 1993, pp. 34-44.
49. Laurence M.R., Danicic S., Harman M., Hierons R., and Howroyd J. Equivalence of conservative, free, linear program schemas is decidable. Theoret. Comput. Sci. 290 (2003) 831-862
50. Lyle J.R., and Weiser M. Automatic program bug location by program slicing. Second Internat. Conf. on Computers and Applications (1987), IEEE Computer Society Press, Los Alamitos, CA, USA, Peking 877-882
51. Ott L.M., and Thuss J.J. Slice based metrics for estimating cohesion. Proc. IEEE-CS Internat. Metrics Symp. (1993), IEEE Computer Society Press, Los Alamitos, CA, USA, Baltimore, MD, USA 71-81
52. Ottenstein K.J., and Ottenstein L.M. The program dependence graph in software development environments. SIGPLAN Notices 19 5 (1984) 177-184
53. Ramshaw L. Eliminating goto's while preserving program structure. J. ACM 35 4 (1988) 893-920
54. Reps T. Program analysis via graph reachability. In: Harman M., and Gallagher K. (Eds). Information and Software Technology Special Issue on Program Slicing Vol. 40 (1998), Elsevier Science B.V., Amsterdam 701-726
55. T. Reps, W. Yang, The semantics of program slicing, Technical Report 777, University of Wisconsin, 1988.
56. Simpson D., Valentine S.H., Mitchell R., Liu L., and Ellis R. Recoup-maintaining Fortran. ACM Fortran Forum 12 3 (1993) 26-32
57. Tip F. A survey of program slicing techniques. J. Programming Languages 3 3 (1995) 121-189
58. G.A. Venkatesh, The semantic approach to program slicing, in: ACM SIGPLAN Conf. on Programming Language Design and Implementation, Toronto, Canada, 1991, pp. 26-28; Proc. SIGPLAN Notices, Vol. 26(6), 1991, pp. 107-119.
59. M. Weiser, Program slices: formal, psychological, and practical investigations of an automatic program abstraction method, Ph.D. Thesis, University of Michigan, Ann Arbor, MI, 1979.
60. Weiser M. Programmers use slicing when debugging. Comm. ACM 25 7 (1982) 446-452
61. Weiser M. Program slicing. IEEE Trans. Software Eng. 10 4 (1984) 352-357
62. M. Weiser, J. R. Lyle, Experiments on slicing-based debugging aids, in: E. Soloway, S. Iyengar (Eds.), Empirical Studies of Programmers, Molex, 1985, pp. 187-197 (Chap. 12).