Amorphous program slicing

Journal of Systems and Software

Volumn 68, Issue 1, 2003, Pages 45-64

  Harman, Mark ^a   Binkley, David ^b   Danicic, Sebastian ^c  

^a BRUNEL UNIVERSITY   (United Kingdom)

^b LOYOLA UNIVERSITY MARYLAND   (United States)

^c UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Program comprehension; Program dependence graph; Program slicing; Program transformation

Indexed keywords

ALGORITHMS; SEMANTICS; SOFTWARE ENGINEERING;

PROGRAM SLICING;

COMPUTER PROGRAMMING;

EID: 0041828583     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0164-1212(02)00135-8     Document Type: Article

References (70)

1. Agrawal, H., 1994. On slicing programs with jump statements. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, Orlando, Florida. Proceedings in SIGPLAN Notices, 29(6), June 1994, pp. 302-312.
2. Ahn, J., Han, T., 1999. Static slicing of a first-order functional language based on operational semantics. Technical Report CS-TR-99-144, KAIST: Korean Advanced Institute of Science and Technology.
3. Andersen, L.O., 1994. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen. (DIKU report 94/19).
4. Ashcroft E.A., Manna Z. The translation of. goto programs into while programs Freiman C.V., Griffith J.E., Rosenfeld J.L. Proceedings of IFIP Congress. vol. 1:1972;250-255 North-Holland, Amsterdam.
5. Ball T., Horwitz S. Slicing programs with arbitrary control-flow. Fritzson P. First Conference on Automated Algorithmic Debugging, Linköping, Sweden. 1993;206-222 Springer, Berlin. Also available as Uniersity of Wisconsin-Madison, technical report (in extended form), TR-1128, December, 1992.
6. Beck J., Eichmann D. Program and interface slicing for reverse engineering. IEEE/ACM 15th Conference on Software Engineering (ICSE'93). 1993;509-518 IEEE Computer Society Press, Los Alamitos, CA, USA.
7. Bieman J.M., Ott L.M. Measuring functional cohesion. IEEE Transactions on Software Engineering. 20(8):1994;644-657.
8. Binkley D.W. Precise executable interprocedural slices. ACM Letters on Programming Languages and Systems. 2(1-4):1993;31-45.
9. Binkley D.W. Interprocedural constant propagation using dependence graphs and a data-flow model. Fritzson P. Proceedings of the International Conference on Compiler Construction, Edinburgh, Scotland, Lecture Notes in Computer Science. vol. 786:1994;374-388 Springer-Verlag, Berlin.
10. Binkley D.W. Semantics guided regression test cost reduction. IEEE Transactions on Software Engineering. 23(8):1997;498-516.
11. Binkley D.W. The application of program slicing to regression testing. Harman M., Gallagher K. Information and Software Technology Special Issue on Program Slicing. vol. 40:1998;583-594 Elsevier, Amsterdam.
12. Binkley D.W. Computing amorphous program slices using dependence graphs and a data-flow model. ACM Symposium on Applied Computing. 1999;519-525 The Menger/ACM Press, San Antonio, TX, USA/New York, NY, USA.
13. Binkley D.W., Gallagher K.B. Program slicing. Zelkowitz M. Advances of Computing. vol. 43:1996;1-50 Academic Press, New York.
14. Binkley D.W., Horwitz S., Reps T. Program integration for languages with procedure calls. ACM Transactions on Software Engineering and Methodology. 4(1):1995;3-35.
15. Binkley D.W., Harman M., Raszewski L.R., Smith C. An empirical study of amorphous slicing as a program comprehension support tool. 8th IEEE International Workshop on Program Comprehension, IWPC 2000, Limerick, Ireland. 2000;161-170 IEEE Computer Society Press, Los Alamitos, CA, USA.
16. Canfora G., Cimitile A., De Lucia A. Conditioned program slicing. Harman M., Gallagher K. Information and Software Technology Special Issue on Program Slicing. vol. 40:1998;595-607 Elsevier Science, Amsterdam.
17. Cartwright, R., Felleisen, M., 1989. The semantics of program dependence. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 13-27.
18. Choi J., Ferrante J. Static slicing in the presence of goto statements. ACM Transactions on Programming Languages and Systems. 16(4):1994;1097-1113.
19. Cimitile A., De Lucia A., Munro M. A specification driven slicing process for identifying reusable functions. Software maintenance: Research and Practice. 8:1996;145-178.
20. Corbett J.C., Dwyer M.B., Hatcliff J., Laubach S., Pasareanu C.S., Robby, Zheng H. Bandera: Extracting finite-state models from java source code. Suresh K. 22nd International Conference on Software Engineering (ICSE'2000). 2000;439-448 IEEE Computer Society Press, Los Alamitos, CA, USA.
21. Das, M., 1998. Partial evaluation using dependence graphs. PhD thesis, University of Wisconsin, Madison.
22. De Lucia A., Fasolino A.R., Munro M. Understanding function behaviours through program slicing. 4th IEEE Workshop on Program Comprehension, Berlin, Germany. 1996;9-18 IEEE Computer Society Press, Los Alamitos, California, USA.
23. Ernst, M.D., 1994. Practical fine-grained static slicing of optimised code. Technical Report MSR-TR-94-14, Microsoft research, Redmond, WA.
24. Ferrante J., Ottenstein K.J., Warren J.D. The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems. 9(3):1987;319-349.
25. Field J., Ramalingam C. Identifying procedural structure in cobol programs. ACM SIGPLAN-SIGSOFT Workshop on Proceedings of the Program Analysis for Software Tools and Engineering. vol. 24.5 of Software Engineering Notes (SEN):1999;1-10 ACM Press, New York.
26. Fischer, C.N., LeBlanc, R.J., 1988. Crafting a Compiler. Benjamin/Cummings Series in Computer Science. Benjamin/Cummings Publishing Company, Menlo Park, CA.
27. Gallagher K.B., Lyle J.R. Using program slicing in software maintenance. IEEE Transactions on Software Engineering. 17(8):1991;751-761.
28. Gerber R., Hong S. Slicing real-time programs for enhanced schedulability. ACM Transactions on Programming Languages and Systems. 19(3):1997;525-555.
29. Gouranton, V., 1998. Deriving analysers by folding/unfolding of natural semantics and a case study: Slicing. Technical Report RR-3413, Inria, Institut National de Recherche en Informatique et en Automatique.
30. Gupta R., Harrold M.J., Soffa M.L. An approach to regression testing using slicing. Suresh K. Proceedings of the IEEE Conference on Software Maintenance, Orlando, Florida, USA. 1992;299-308 IEEE Computer Society Press, Los Alamitos, CA, USA.
31. Gyimóthy, T., Paakki, J., 1995. Static slicing of logic programs. In: Ducassé, M., (Ed.), AADEBUG, 2nd International Workshop on Automated and Algorithmic Debugging, Saint Malo, France. IRISA-CNRS, pp. 87-103.
32. Harman M., Danicic S. Projecting functional models of imperative programs. ACM SIGPLan Notices. 28(11):1993;42-52.
33. Harman M., Danicic S. Using program slicing to simplify testing. Software Testing, Verification and Reliability. 5(3):1995;143-162.
34. Harman M., Danicic S. Amorphous program slicing. 5th IEEE International Workshop on Program Comprehension (IWPC'97), Dearborn, Michigan, USA. 1997;70-79 IEEE Computer Society Press, Los Alamitos.
35. Harman M., Hierons R.M. An overview of program slicing. Software Focus. 2(3):2001;85-92.
36. Harman M., Fox C., Hierons R.M., Binkley D.W., Danicic S. Program simplification as a means of approximating undecidable propositions. 7th IEEE International Workshop on Program Comprehension. 1999;208-217 IEEE Computer Society Press, Los Alamitos.
37. Harman M., Hu L., Zhang X., Munro M. An amorphous slicing system which combines slicing and transformation. Suresh K. 1st Workshop on Analysis, Slicing, and Transformation, AST 2001, Stuttgart. 2001;271-280 IEEE Computer Society Press, Los Alamitos, CA, USA.
38. Harman M., Hu L., Zhang X., Munro M. Side-effect removal transformation. Suresh K. 9th IEEE, International Workshop on Program Comprehension. 2001;310-319 IEEE Computer Society Press, Los Alamitos, CA, USA.
39. Hierons R.M., Harman M., Danicic S. Using program slicing to assist in the detection of equivalent mutants. Software Testing, Verification and Reliability. 9(4):1999;233-262.
40. Hierons R.M., Harman M., Fox C., Ouarbya L., Daoudi M. Conditioned slicing supports partition testing. Software Testing, Verification and Reliability. 12:2002;23-28.
41. Horwitz S., Prins J., Reps T. Integrating non-interfering versions of programs. ACM Transactions on Programming Languages and Systems. 11(3):1989;345-387.
42. Horwitz S., Reps T., Binkley D.W. Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems. 12(1):1990;26-61.
43. 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. Available as Linköping Studies in Science and Technology, Dissertations, no. 297.
44. Korel B., Laski J. Dynamic program slicing. Information Processing Letters. 29(3):1988;155-163.
45. Krinke J., Snelting G. Validation of measurement software as an application of slicing and constraint solving. Harman M., Gallagher K. Information and Software Technology Special Issue on Program Slicing. vol. 40:1998;661-675 Elsevier, Amsterdam.
46. Lakhotia, A., 1993. Rule-based approach to computing module cohesion. In: Proceedings of the 15th Conference on Software Engineering (ICSE-15), pp. 34-44.
47. Lakhotia A., Deprez J.-C. Restructuring programs by tucking statements into functions. Harman M., Gallagher K. Information and Software Technology Special Issue on Program Slicing. vol. 40:1998;677-689 Elsevier, Amsterdam.
48. Liao S.-W., Diwan A., Bosch R.P. Jr., Ohuloum A., Lam M.S. SUIF explorer: An interactive and interprocedural parallelizer. Chien A.A., Snir M. Proceedings of the 1999 ACM Sigplan Symposium on Principles and Practise of Parallel Programming (PPoPP'99). vol. 34.8 of ACM Sigplan Notices:1999;37-48 ACM Press, New York.
49. Liu, L., Ellis, R., 1993. An approach to eliminating COMMON blocks and deriving ADTs from Fortran programs. Technical report, University of Westminster, UK.
50. Lucia A. Program slicing: Methods and applications. 1st IEEE International Workshop on Source Code Analysis and Manipulation. 2001;142-149 IEEE Computer Society Press, Los Alamitos, CA, USA.
51. Lyle, J.R., Binkley, D.W., 1993. Program slicing in the presence of pointers. In: Foundations of Software Engineering, Orlando, FL, USA, pp. 255-260.
52. Lyle J.R., Weiser M. Automatic program bug location by program slicing. International Conference on Computers and Applications, Peking. 1987;877-882 IEEE Computer Society Press, Los Alamitos, CA, USA.
53. Nilsson H., Fritzson P. Lazy algorithmic debugging: Ideas for practical implementation. Fritzson P.A. Automated and Algorithmic Debugging. vol. 749 of Lecture Notes in Computer Science:1993;117-134 Springer-Verlag, Berlin.
54. Norris C., Pollock L.L. The design and implementation of RAP: A PDG-based register allocator. Software Practice and Experience. 28(4):1998;401-424.
55. Ott L.M., Thuss J.J. Slice based metrics for estimating cohesion. Proceedings of the IEEE-CS International Metrics Symposium, Baltimore, Maryland, USA. 1993;71-81 IEEE Computer Society Press, Los Alamitos, CA, USA.
56. Ottenstein K.J., Ottenstein L.M. The program dependence graph in software development environments. SIGPLAN Notices. 19(5):1984;177-184.
57. Peterson W.W., Kasami T., Tokura N. On the capabilities of while, repeat, and exit statements. Communications of the ACM. 16(8):1973;503-512.
58. Schoenig, S., Ducassé, M., 1996. A hybrid backward slicing algorithm producing executable slices for prolog. In: Proceedings of the 7th Workshop on Logic Programming Environments, Portland, USA, pp. 41-48.
59. Shahmehri, N., 1991. Generalized algorithmic debugging. PhD Thesis, Department of Computer Science and Information Science, Linköping University, Sweden. Available as Linköping Studies in Science and Technology, Dissertations, no. 260.
60. Simpson D., Valentine S.H., Mitchell R., Liu L., Ellis R. Recoup - maintaining Fortran. ACM Fortran forum. 12(3):1993;26-32.
61. Sivagurunathan, Y., Harman, M., Danicic, S., 1997. Slicing I/O and the implicit state. In: Kamkar, M., (Ed.), 3rd International Workshop on Automated Debugging (AADEBUG'97), vol. 2 of Linköping Electronic Articles in Computer and Information Science, Linköping, Sweden. pp. 59-65. Available from 〈http://www.ep.liu.se/ea/cis/1997/009/06/〉
62. Steensgaard, B., 1996. Points-to analysis in almost linear time. In: ACM, editor, Conference record of POPL '96, 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages: papers presented at the Symposium: St. Petersburg Beach, Florida, 21-24 January 1996, New York, NY, USA. ACM Press, pp. 32-41.
63. Tip, F., 1995a. Generation of Program Analysis Tools. PhD thesis, Centrum voor Wiskunde en Informatica, Amsterdam.
64. Tip F. A survey of program slicing techniques. Journal of Programming Languages. 3(3):1995;121-189.
65. Venkatesh, G.A., 1991. The semantic approach to program slicing. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 26-28, Toronto, Canada. Proceedings in SIGPLAN Notices, vol. 26(6), 1991, pp.107-119.
66. Ward M. Reverse engineering through formal transformation. The Computer Journal. 37(5):1994;795-813.
67. Ward, M., 2002. Program slicing via FermaT transformations. In: 26th IEEE Annual Computer Software and Applications Conference (COMPSAC 2002), Oxford, UK. IEEE Computer Society Press, Los Alamitos, California, USA, pp. 357-362.
68. Weiser, M., 1979. Program slices: Formal, psychological, and practical investigations of an automatic program abstraction method. PhD thesis, University of Michigan, Ann Arbor, MI.
69. Weiser M. Programmers use slicing when debugging. Communications of the ACM. 25(7):1982;446-452.
70. Weiser M. Program slicing. IEEE Transactions on Software Engineering. 10(4):1984;352-357.