Static program slicing algorithms are minimal for free liberal program schemas

Computer Journal

Volumn 48, Issue 6, 2005, Pages 737-748

  Danicic, Sebastian ^a   Fox, Chris ^b   Harman, Mark ^c   Hierons, Rob ^d   Howroyd, John ^e   Laurence, Michael R ^f  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF ESSEX   (United Kingdom)

^c KING'S COLLEGE LONDON   (United Kingdom)

^d BRUNEL UNIVERSITY   (United Kingdom)

^e UK PLC   (United Kingdom)

^f UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DATA FLOW ANALYSIS; REVERSE ENGINEERING; SEMANTICS; SET THEORY; THEOREM PROVING;

DATAFLOW MINIMAL SLICING; PROGRAM SLICING; STATIC SLICING ALGORITHMS;

PROGRAM DEBUGGING;

EID: 27844576695     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxh121     Document Type: Article

References (73)

1. Weiser, M. (1979) Program Slices: Formal, Psychological, and Practical Investigations of an Automatic Program Abstraction Method. PhD Thesis, University of Michigan, Ann Arbor, MI.
2. 2: reverse engineering and reuse re-engineering. J. Softw. Maint. Res. Pr., 6(2), 53-72.
3. Simpson, D., Valentine, S. H., Mitchell, R., Liu, L. and Ellis, R. (1993) Recoup - maintaining fortran. ACM Fortran forum, 12(3), 26-32.
4. De Lucia, A., Fasolino, A. R. and Munro, M. (1996) Understanding function behaviours through program slicing. In Proc. Proc. Proc. 4th IEEE Workshop on Program Comprehension, Berlin, Germany, March 29-31, pp. 9-18. IEEE Computer Society Press, Los Alamitos, CA.
5. Harman, M., Hierons, R. M., Danicic, S., Howroyd, J. and Fox, C. (2001) Pre/post conditioned slicing. In Proc. IEEE Int. Conf. Software Maintenance (ICSM'01), Florence, Italy, November 7-9, pp. 138-147. IEEE Computer Society Press, Los Alamitos, CA.
6. Canfora, G., Cimitile, A., De Lucia, A. and Di Lucca, G. A. (1994) Software salvaging based on conditions. In International Conference on Software Maintenance (ICSM'94), Victoria, Canada, September 19-23, pp. 424-433. IEEE Computer Society Press, Los Alamitos, CA.
7. Cimitile, A., De Lucia, A. and Munro, M. (1996) A specification driven slicing process for identifying reusable functions. Softw. Maint. Res. Pr., 8, 145-178.
8. Gallagher, K. B. (1992) Evaluating the surgeon's assistant: results of a pilot study. In Proc. Int. Conf. Software Maintenance, Orlando, FL, November 9-12, pp. 236-244. IEEE Computer Society Press, Los Alamitos, CA.
9. Gallagher, K. B. and Lyle, J. R. (1991) Using program slicing in software maintenance. IEEE Trans. Softw. Eng., 17(8), 751-761.
10. Agrawal, H., DeMillo, R. A. and Spafford, E. H. (1993) Debugging with dynamic slicing and backtracking. Software Pract. Exper., 23(6), 589-616.
11. Kamkar, M. (1993) Interprocedural Dynamic Slicing with Applications to Debugging and Testing. PhD Thesis, Department of Computer Science and Information Science, Linköping University, Sweden.
12. Lyle, J. R. and Weiser, M. (1987) Automatic program bug location by program slicing. In Proc. 2nd Int. Conf. Computers and Applications, Peking, June, pp. 877-882. IEEE Computer Society Press, Los Alamitos, CA.
13. Weiser,M. and Lyle, J. R. (1985) Experiments on slicing-based debugging aids. Empirical studies of programmers, Soloway and Iyengar (eds). pp. 187-197. Molex.
14. Binkley, D. W. (1998) The application of program slicing to regression testing. In Harman, M. and Gallagher, K. (eds) Inform. Software Tech., 40, 583-594.
15. Gupta, R., Harrold, M. J. and Soffa,M. L. (1992) An approach to regression testing using slicing. In Proc. IEEE Conf. Software Maintenance, Orlando, FL, November 9-12, pp. 299-308. IEEE Computer Society Press, Los Alamitos, CA.
16. Harman, M. and Danicic, S. (1995) Using program slicing to simplify testing. Softw. Test. Verif. Rel., 5(3), 143-162.
17. Hierons, R. M., Harman, M. and Danicic, S. (1999) Using program slicing to assist in the detection of equivalent mutants. Softw. Test. Verif. Rel., 9(4), 233-262.
18. Hierons, R. M., Harman, M., Fox, C., Ouarbya, L. and Daoudi, M. (2002) Conditioned slicing supports partition testing. Softw. Test. Verif. Rel., 12, 23-28.
19. Beck, J. and Eichmann, D. (1993) Program and interface slicing for reverse engineering. In Proc. IEEE/ACM 15th Conf. Software Engineering (ICSE'93), Baltimore, MD, May 17-21, pp. 509-518. IEEE Computer Society Press, Los Alamitos, CA.
20. Cimitile, A., De Lucia, A. and Munro, M. (1995) Identifying reusable functions using specification driven program slicing: a case study. In Proc. IEEE Int. Conf. Software Maintenance (ICSM'95), Nice, France, October 16-20, pp. 124-133. IEEE Computer Society Press, Los Alamitos, CA.
21. Binkley, D. W., Horwitz, S. and Reps, T. (1995) Program integration for languages with procedure calls. ACM Trans. Softw. Eng. Meth., 4(1), 3-35.
22. Horwitz, S., Prins, J. and Reps, T. (1989) Integrating non-interfering versions of programs. ACM Trans. Progr. Lang. Sys., 11(3), 345-387.
23. Bieman, J. M. and Ott, L. M. (1994) Measuring functional cohesion. IEEE Trans. Softw. Eng., 20(8), 644-657.
24. Lakhotia, A. (1993) Rule-based approach to computing module cohesion. In Proc. 15th Conf. Software Engineering (ICSE-15), Baltimore, MD, May 17-21, pp. 34-44.
25. Ott, L. M. and Thuss, J. J. (1993) Slice based metrics for estimating cohesion. In Proc. IEEE-CS Int. Metrics Symp., Baltimore, MD, May 21-22, pp. 71-81. IEEE Computer Society Press, Los Alamitos, CA.
26. Binkley, D. W. and Gallagher, K. B. (1996) Program slicing. In Zelkowitz, M. (ed.) Advances in Computing Vol. 43, pp. 1-50. Academic Press.
27. Binkley, D. W. and Harman, M. (2004) A survey of empirical results on program slicing. Adv. Comput., 62, 105-178.
28. De Lucia, A. Program slicing: methods and applications. In Proc. 1st IEEE Int. Workshop on Source Code Analysis and Manipulation, Florence, Italy, November 10, pp. 142-149. IEEE Computer Society Press, Los Alamitos, CA.
29. Harman, M. and Hierons, R. M. (2001) An overview of program slicing. Softw. Focus, 2(3), 85-92.
30. Tip, F. (1995) A survey of program slicing techniques. J. Progr. Lang., 3(3), 121-189.
31. Luckham, D. C., Park, D. M. R. and Paterson, M. S. (1970) On formalised computer programs. J. Comput. Sys. Sci., 4, 220-249.
32. Laurence, M. R., Danicic, S., Harman, M., Hierons, R. and Howroyd, J. (2003) Equivalence of conservative, free, linear program schemas is decidable. Theor. Comput. Sci., 290, 831-862.
33. Weiser, M. (1984) Program slicing. IEEE Trans. Softw. Eng., 10(4), 352-357.
34. Horwitz, S., Reps, T. and Binkley, D. W. (1990) Interprocedural slicing using dependence graphs. ACM Trans. Progr. Lang. Sys., 12(1), 26-61.
35. Harman, M. and Danicic, S. (1997) Amorphous program slicing. In Proc. 5th IEEE Int. Workshop on Program Comprenhesion (IWPC'97), Dearborn, MI, May 28-30, pp. 70-79. IEEE Computer Society Press, Los Alamitos, CA.
36. Field, J., Ramalingam, G. and Tip, F. (1995) Parametric program slicing. In Proc. 22nd ACM Symp. Principles of Programming Languages, San Francisco, CA, January 22-25, pp. 379-392. ACM Press, New York, NY, USA.
37. Snelting, G. (1996) Combining slicing and constraint solving for validation of measurement software. In Static Analysis Symposium (SAS'96), Aachen, Germany, September 24-26, LNCS 1145, 332-348.
38. Manna, Z. (1974) Mathematical Theory of Computation. McGraw-Hill.
39. Greibach, S. (1975) Theory of program structures: schemes, semantics, verification. LNCS 36, Springer-Verlag Inc., New York, NY.
40. Paterson, M. S. (1967) Equivalence Problems in a Model of Computation. PhD Thesis, University of Cambridge, UK.
41. Hecht, M. S. (1977) Flow Analysis of Computer Programs. Elsevier.
42. Ferrante, J., Ottenstein, K. J. and Warren, J. D. (1987) The program dependence graph and its use in optimization. ACM Trans. Progr. Lang. Sys., 9(3), 319-349.
43. Danicic, S., Harman, M. and Sivagurunathan, Y. (1995) A parallel algorithm for static program slicing. Inform. Process. Lett., 56(6), 307-313.
44. Horwitz, S., Reps, T. and Binkley, D. W. (1988) Interprocedural slicing using dependence graphs. In ACM SIGPLAN Conf. Programming Language Design and Implementation, Atlanta, GA, June 20-24, pp. 25-46.
45. Venkatesh, G. A. (1991) The semantic approach to program slicing. In Proc. ACM SIGPLAN Conf. Programming Language Design and Implementation, Toronto, Canada, June 26-28, pp. 26-28.
46. Agrawal, H. and Horgan, J. R. (1990) Dynamic program slicing. In Proc. ACM SIGPLAN Conf. Programming Language Design and Implementation, White Plains, NY, June 20-22, pp. 246-256. ACM Press, New York, NY, USA.
47. Gopal, R. (1991) Dynamic program slicing based on dependence graphs. In Proc. IEEE Conf. Software Maintenance, Sorrento, Italy, October 15-17, pages 191-200.
48. Kamkar, M., Shahmehri, N. and Fritzson, P. (1992) Interprocedural dynamic slicing. In Proc. 4th Conf. Programming Language Implementation and Logic Programming, Leuven, Belgium, August 26-28, pp. 370-384.
49. Korel, B. and Laski, J. (1988) Dynamic program slicing. Inform. Process. Lett., 29(3), 155-163.
50. Harman, M. and Danicic, S. (1998) A new algorithm for slicing unstructured programs. J. Softw. Maint. Evol., 10(6), 415-441.
51. Ball, T. and Horwitz, S. (1993) Slicing programs with arbitrary control-flow. In Fritzson, P. (ed.) 1st Conf.Automated Algorithmic Debugging, Linköping, Sweden, May 3-5, pp. 206-222. Springer. Also available as University of Wisconsin-Madison, Technical report (in extended form), (1992) TR-1128.
52. Choi, J.-D. and Ferrante, J. (1994) Static slicing in the presence of goto statements. ACM Trans. Progr. Lang. Sys., 16(4), 1097-1113.
53. Agrawal, H. (1994) On slicing programs with jump statements. In Proc. ACM SIGPLAN Conf. Programming Language Design and Implementation, Orlando, FL, June 20-24, pp. 302-312.
54. Cheng, J. (1993) Slicing concurrent programs - a graph-theoretical approach. In Fritzson, P. (ed.) 1st Automatic Algorithmic Debugging Conf. (AADEGUB'93), Linköping, Sweden, May 3-5, pp. 223-240. Springer.
55. Zhao, J., Cheng, J. and Ushijima, K. (1996) Static slicing of concurrent object-oriented programs. In Proc. 20th IEEE Annual Int. Computer Software and Applications Conf.(COMPSAC'96), Seoul, Korea, August 19-23, pp. 312-320. IEEE Computer Society Press, Los Alamitos, CA.
56. Kamkar, M. (1998) Application of program slicing in algorithmic debugging. In Harman, M. and Gallagher, K. (eds), Inform. Softw. Tech., 40, 637-645.
57. Korel, B. (1995) Computation of dynamic slices for programs with arbitrary control flow. In Ducassé, M. (ed.) 2nd Int. Workshop on Automated Algorithmic Debugging (AADEBUG'95), Saint-Malo, France, May 22-24.
58. Korel, B. and Rilling, J. (1998) Dynamic program slicing methods. In Harman, M. and Gallagher, K. (eds) Inform. Softw. Tech., 40, 647-659.
59. Danicic, S., Fox, C., Harman, M. and Hierons, R. M. (2000) ConSIT: a conditioned program slicer. In Proc. IEEE Int. Conf. Software Maintenance (ICSM'00), San Jose, CA, October 11-14, pp. 216-226. IEEE Computer Society Press, Los Alamitos, CA.
60. Canfora, G., Cimitile, A. and De Lucia, A. (1998) Conditioned program slicing. In Harman, M. and Gallagher, K. (eds) Inform. Softw. Tech., 40, pp. 595-607.
61. Ouarbya, L., Danicic, S., Daoudi, D. M., Harman, M. and Fox, C. (2002) A denotational interprocedural program slicer. In Proc. IEEE Working Conf. Reverse Engineering (WCRE 2002), Richmond, VA, October 29-November 1, pp. 181-189. IEEE Computer Society Press, Los Alamitos, CA.
62. Krinke, J. and Snelting, G. (1988) Validation of measurement software as an application of slicing and constraint solving. In Harman, M. and Gallagher, K. (eds) Inform. Softw. Tech., 40, 661-675.
63. Horwitz, S., Prins, J. and Reps, T. (1988) On the adequacy of program dependence graphs for representing programs. In Proc. Conf. Principles of Programming Languages, POPL '88, San Diego, CA, January 13-15, pp. 146-157. ACM Press.
64. Reps, T. and Yang, W. (1988) The Semantics of Program Slicing. Technical Report 777, University of Wisconsin, USA.
65. Cartwright, R. and Felleisen, M. (1989) The semantics of program dependence. In Proc. ACM SIGPLAN Conf. Programming Language Design and Implementation, Portland, OR, June 21-23, pp. 13-27. ACM Press, NewYork, NY, USA.
66. Ottenstein, K. J. and Ottenstein, L. M. (1984) The program dependence graph in software development environments. ACM SIGPLAN Notices, 19(5), 177-184.
67. Harman, M., Simpson, D. and Danicic, S. (1996) Slicing programs in the presence of errors. Formal Aspects of Computing, 8(4), 490-497.
68. Hausler, P. A. (1989) Denotational program slicing. In Proc. 22nd Annual Hawaii Int. Conf. System Sciences, Kailua-Kona, Hawaii, January 3-6, Volume II, pp. 486-495. ACM Press, New York, NY, USA.
69. Woodward, M. R. and Allen, S. P. (1998) Slicing algebraic specifications. Inform. Softw. Tech., 40(2), 105-118.
70. Laurence, M. R. (2004) Equivalence of Linear, Free, Liberal Program Schemas is Decidable in Polynomial Time. PhD Thesis, Goldsmiths College, University of London.
71. Laurence, M., Danicic, S., Harman, M., Hierons, R. M. and Howroyd, J. (2004) Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time. Theor. Comput. Sci., submitted for publication.
72. Giacobazzi, R. and Mastroeni, I. (2003) Non-standard semantics for program slicing. Higher-Order and Symbolic Computation, 16(4), 297-339.
73. Ouarbya, L. (2005) A Lazy Semantics for Program Slicing. PhD Thesis, Department of Computing, Goldsmiths College, University of London.