Empirical study of optimization techniques for massive slicing

ACM Transactions on Programming Languages and Systems

Volumn 30, Issue 1, 2007, Pages

  Binkley, David ^a   Harman, Mark ^b   Krinke, Jens ^c  

^a LOYOLA UNIVERSITY MARYLAND   (United States)

^b KING'S COLLEGE LONDON   (United Kingdom)

^c UNIVERSITY OF HAGEN   (Germany)

Author keywords

Empirical study; Internal representation; Performance enhancement; Slicing

Indexed keywords

INTERNAL REPRESENTATION; MASSIVE SLICING; PERFORMANCE ENHANCEMENT; SYSTEM DEPENDENCE GRAPH (SDG); TOPOLOGICAL SORTING;

COST EFFECTIVENESS; DATA MINING; OPTIMIZATION;

GRAPH THEORY;

EID: 37149037750     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1290520.1290523     Document Type: Article

References (64)

1. AGRAWAL, H. AND HORGAN, J. R. 1990. Dynamic program slicing. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (White Plains, NY). ACM, New York, 246-256.
2. ANDERSON, P., BINKLEY, D., ROSAY, G., AND TEITELBAUM, T. 2001. Flow insensitive points-to sets. In Proceedings of the 1st IEEE Workshop on Source Code Analysis and Manipulation (Florence, Italy). IEEE Computer Society Press, Los Alamitos, CA, 79-89.
3. BALMAS, F. 2002. Using dependence graphs as a support to document programs. In Proceedings of the 2st IEEE International Workshop on Source Code Analysis and Manipulation (Montreal, Que, Canada). IEEE Computer Society Press, Los Alamitos, CA, 145-154.
4. BESZÉDES, A. AND GYIMÓTHY, T. 2002. Union slices for the approximation of the precise slice. In Proceedings of the IEEE International Conference on Software Maintenance (Montreal, Que, Canada). IEEE Computer Society Press, Los Alamitos, CA, 12-20.
5. BIEMAN, J. M. AND OTT, L. M. 1994. Measuring functional cohesion. IEEE Trans. Softw. Engin. 20, 8 (Aug.), 644-657.
6. BINKLEY, D. AND HARMAN, M. 2005a. Forward slices are smaller than backward slices. In Proceedings of the 5th IEEE International Workshop on Source Code Analysis and Manipulation (Budapest, Hungary, Sept. 30-Oct. 1). IEEE Computer Society Press, Los Alamitos, CA, 15-24.
7. BINKLEY, D. AND HARMAN, M. 2005b. Locating dependence clusters and dependence pollution. In Proceedings of the 21st IEEE International Conference on Software Maintenance (Budapest, Hungary, Sept. 30-Oct. 1). IEEE Computer Society Press, Los Alamitos, CA, 177-186.
8. BINKLEY, D. W. 1998. The application of program slicing to regression testing. Inf. Softw. Technol. Special Issue on Program Slicing 40, 11 and 12, 583-594.
9. BINKLEY, D. W. AND GALLAGHER, K. B. 1996. Program slicing. In Adv. Comput. 43 Academic Press, Orlando, FL, 1-50.
10. BINKLEY, D. W. AND HARMAN, M. 2003a. A large-scale empirical study of forward and backward static slice size and context sensitivity. In Proceedings of the IEEE International Conference on Software Maintenance (Amsterdam, The Netherlands). IEEE Computer Society Press, Los Alamitos, CA, 44-53.
11. BINKLEY, D. W. AND HARMAN, M. 2003b. Results from a large-scale study of performance optimization techniques for source code analyses based on graph reachability algorithms. In Proceedings of the IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2003) (Amsterdam, The Netherlands). IEEE Computer Society Press, Los Alamitos, CA, 203-212.
12. BINKLEY, D. W. AND HARMAN, M. 2004. Analysis and visualization of predicate dependence on formal parameters and global variables. IEEE Trans. Softw. Engineering 30, 11, 715-735.
13. BINKLEY, D. W., HARMAN, M., RASZEWSKI, L. R., AND SMITH, C. 2000. An empirical study of amorphous slicing as a program comprehension support tool. In Proceedings of the 8th IEEE International Workshop on Program Comprehension (Limerick, Ireland). IEEE Computer Society Press, Los Alamitos, CA, 161-170.
14. BINKLEY, D. W., HORWITZ, S., AND REPS, T. 1995. Program integration for languages with procedure calls. ACM Trans. Softw. Engin. Meth. 4, 1, 3-35.
15. BLACK, S. E. 2001. Computing ripple effect for software maintenance. J. Softw. Maint. Evol.: Res. Pract. 13, 263-279.
16. CANFORA, G., CIMITILE, A., DE LUCIA, A., AND LUCCA, G. A. D. 1994a. Software salvaging based on conditions. In International Conference on Software Maintenance (Victoria, BC, Canada). IEEE Computer Society Press, Los Alamitos, CA, 424-433.
17. 2: Reverse engineering and reuse reengineering. J. Softw. Mainten.: Res. Pract. 6, 2, 53-72.
18. CHILIMBI, T., DAVIDSON, B., LARUS, J., AND HILL, M. 1999. Cache-conscious structure definition. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (Atlanta, GA). ACM, New York, 13-24.
19. CIMITILE, A., DE LUCIA, A., AND MUNRO, M. 1995a. Identifying reusable functions using specification driven program slicing: A case study. In Proceedings of the IEEE International Conference on Software Maintenance (Nice, France). IEEE Computer Society Press, Los Alamitos, CA, 124-133.
20. CIMITILE, A., DE LUCIA, A., AND MUNRO, M. 1995b. Qualifying reusable functions using symbolic execution. In Proceedings of the 2nd Working Conference on Reverse Engineering (Toronto, Ont., Canada). IEEE Computer Society Press, Los Alamitos, CA, 178-187.
21. DANICIC, S., DE LUCIA, A., AND HARMAN, M. 2004. Building executable union slices using conditioned slicing. In Proceedings of the 12th International Workshop on Program Comprehension (Bari, Italy). IEEE Computer Society Press, Los Alamitos, CA, 89-97.
22. EISENBARTH, T., KOSCHKE, R., AND VOGEL, G. 2002. Static trace extraction. In Proceedings of the IEEE Working Conference on Reverse Engineering (Richmond, VA). IEEE Computer Society Press, Los Alamitos, CA, 128-137.
23. FÄHNDRICH, M., FOSTER, J. S., SU, Z., AND AIKEN, A. 1998. Partial online cycle elimination in inclusion constraint graphs. In Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation (Montréal, Que., Canada). ACM, New York, 85-96.
24. FERRANTE, J., OTTENSTEIN, K. J., AND WARREN, J. D. 1987. The program dependence graph and its use in optimization. ACM Trans. Prog. Lang. Syst. 9, 3 (July), 319-349.
25. FISCHER, C. N. AND LEBLANC, R. J. 1988. Crafting a Compiler. Benjamin/Cummings Series in Computer Science. Benjamin/Cummings Publishing Company, Menlo Park, CA.
26. FOX, C., HARMAN, M., HIERONS, R. M., AND DANICIC, S. 2001. Backward conditioning: a new program specialisation technique and its application to program comprehension. In Proceedings of the 9th IEEE International Workshop on Program Comprenhesion (Toronto, Ont., Canada). IEEE Computer Society Press, Los Alamitos, CA, 89-97.
27. GALLAGHER, K. B. AND LYLE, J. R. 1991. Using program slicing in software maintenance. IEEE Trans. Softw. Engin. 17, 8 (Aug.), 751-761.
28. HARMAN, M. AND DANICIC, S. 1995. Using program slicing to simplify testing. Softw. Test. Verif. Reliab. 5, 3 (Sept.), 143-162.
29. HARMAN, M. AND HIERONS, R. M. 2001. An overview of program slicing. Softw. Focus 2, 3, 85-92.
30. HARMAN, M., HIERONS, R. M., DANICIC, S., HOWROYD, J., LAURENCE, M., AND FOX, C. 2001. Node coarsening calculi for program slicing. In Proceedings of the 8th Working Conference on Reverse Engineering (Stuttgart, Germany). IEEE Computer Society Press, Los Alamitos, CA, 25-34.
31. HEINTZE, N. AND TARDIEU, O. 2001. Ultra-fast aliasing analysis using CLA: A million lines of C code in a second. In Proceedings of the ACM SIGPLAN '01 Conference on Programming Language Design and Implementation, C. Norris and J. J. B. Fenwick, Eds. ACM SIGPLAN Notices, vol. 36.5. ACM, New York, 254-263.
32. HIERONS, R. M., HARMAN, M., AND DANICIC, S. 1999. Using program slicing to assist in the detection of equivalent mutants. Softw. Test. Verif Reliab. 9, 4, 233-262.
33. HIERONS, R. M., HARMAN, M., FOX, C., OUARBYA, L., AND DAOUDI, M. 2002. Conditioned slicing supports partition testing. Softw. Test., Verif. Reliab. 12, 23-28.
34. HORWITZ, S., PFEIFFER, P., AND REPS, T. 1989a. Dependence analysis for pointer variables. In Proceedings of the ACM SIGPLAN 89 Conference on Programming Language Design and Implementation (Portland, OR). ACM SIGPLAN Notices, ACM, New York, 28-40.
35. HORWITZ, S., RRINS, J., AND REPS, T. 1989b. Integrating non-interfering versions of programs. ACM Trans. Prog. Lang. Syst. 11, 3 (July), 345-387.
36. HORWITZ, S., REPS, T., AND BINKLEY, D. W. 1988. Interprocedural slicing using dependence graphs. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (Atlanta, GA). ACM, New York, 25-46. (Proceedings in SIGPLAN Notices, 23(7), 35-46, 1988.)
37. HORWITZ, S., REPS, T., AND BINKLEY, D. W. 1990. Interprocedural slicing using dependence graphs. ACM Trans. Progr. Lang. Syst. 12, 1, 26-61.
38. JACKSON, D. AND ROLLINS, E. J. 1994. Chopping: A generalisation of slicing. Tech. Rep. CMU-CS-94-169, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA. July.
39. KOSCHKE, R. 1999. An incremental semi-automatic method for component recovery. In Proceedings: Sixth Working Conference on Reverse Engineering (Atlanta, GA). IEEE Computer Society Press, Los Alamitos, CA, 256-269.
40. KRINKE, J. 2002. Evaluating context-sensitive slicing and chopping. In IEEE International Conference on Software Maintenance (Montreal, Que., Canada). IEEE Computer Society Press, Los Alamitos, CA, 22-31.
41. KRINKE, J. 2003. Advanced slicing of sequential and concurrent programs. Ph.D. dissertation, Universität Passau.
42. LEE, Y. AND RYDER, B. G. 1994. Effectively exploiting parallelism in data flow analysis. J. Super-comput. 8, 3 (Nov.), 233-262.
43. LIANG, D. AND HARROLD, M. J. 1999. Efficient points-to analysis for whole-program analysis. In ESEC/FSE '99, O. Nierstrasz and M. Lemoine, Eds. Lecture Notes in Computer Science, vol. 1687. Springer-Verlag / ACM Press, New York, 199-215.
44. LONGWORTH, H. D., OTT, L. M., AND SMITH, M. R. 1986. The relationship between program complexity and slice complexity during debugging tasks. In Proceedings of the Computer Software and Applications Conference (COMPSAC'86). 383-389.
45. MEYERS, T. AND BINKLEY, D. W. 2004. Slice-based cohesion metrics and software intervention. In Proceedings of the 11th IEEE Working Conference on Reverse Engineering (Delft University of Technology, the Netherlands). IEEE Computer Society Press, Los Alamitos, CA, 256-266.
46. MOCK, M., ATKINSON, D. C., CHAMBERS, C., AND EGGERS, S. J. 2002. Improving program slicing with dynamic points-to data. In Proceedings of the 10th ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE-02), W. G. Griswold, Ed. ACM, New York, 71-80.
47. MÜLLER, H. A. AND KLASHINSKY, K. 1988. Rigi - A system for programming-in-the-large. In Proceedings of the 10th International Conference on Software Engineering (Singapore. Apr. 11-15). IEEE Computer Society Press, Los Alamitos, CA, 80-86.
48. OTT, L. M. 1992. Using slice profiles and metrics during software maintenance. In Proceedings of the 10th Annual Software Reliability Symposium. 16-23.
49. OTT, L. M. AND BIEMAN, J. M. 1992. Effects of software changes on module cohesion. In Proceedings of the IEEE Conference on Software Maintenance. IEEE Computer Society Press, Los Alamitos, CA, 345-353.
50. OTT, L. M. AND THUSS, J. J. 1989. The relationship between slices and module cohesion. In Proceedings of the 11th ACM Conference on Software Engineering. ACM, New York, 198-204.
51. OTT, L. M. AND THUSS, J. J. 1993. Slice based metrics for estimating cohesion. In Proceedings of the IEEE-CS International Metrics Symposium (Baltimore, MA). IEEE Computer Society Press, Los Alamitos, CA, 71-81.
52. OTTENSTEIN, K. J. AND OTTENSTEIN, L. M. 1984. The program dependence graph in software development environments. Proceedings of the ACM SIGSOFTISIGPLAN Software Engineering Symposium on Practical Software Development Environmt, SIGPLAN Notices 19, 5, 177-184.
53. PODGURSKI, A. AND CLARKE, L. 1990. A formal model of program dependences and its implications for software testing, debugging, and maintenance. IEEE Trans. Softw. Engin. 16, 9, 965-79.
54. REPS, T. 1998. Program analysis via graph reachability. Inf. Softw. Tech. Special Issue on Program Slicing 40, 11 and 12, 701-726.
55. REPS, T., HORWITZ, S., SAGIV, M., AND ROSAY, G. 1994. Speeding up slicing. In Proceedings of the ACM Foundations of Software Engineering (New Orleans, LA). ACM SIGSOFT Software Engineering Notes 19, 5 (December 1994), 11-20.
56. RILLING, J., SEFFAH, A., AND LUKAS, J. 2001. MOOSE - A software comprehension framework. In Proceedings of the 5th World Multi-Conference on Systemics, Cybernetics and Informatics (Orlando, FL). 312-318.
57. ROUNTEV, A. AND CHANDRA, S. 2000. Off-line variable substitution for scaling points-to analysis. In Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation. ACM Sigplan Notices, vol. 35.5. ACM, New York, 47-56.
58. SNELTING, G., ROBSCHINK, T., AND KRINKE, J. 2006. Efficient path conditions in dependence graphs for software safety analysis. ACM Trans. Softw. Engin. Methodol. 15, 4, 410-457.
59. TIP, F. 1995. A survey of program slicing techniques. J. Prog. Lang. 3, 3 (Sept.), 121-189.
60. WEISER, M. 1979. Program slices: Formal, psychological, and practical investigations of an automatic program abstraction method. Ph.D. dissertation, University of Michigan, Ann Arbor, MI.
61. WEISER, M. 1981. Program slicing. In Proceedings of the 5th International Conference on Software Engineering (San Diego, CA). 439-449.
62. WEISER, M. 1982. Programmers use slices when debugging. Commun. ACM 25, 7 (July), 446-452.
63. WEISER, M. 1984. Program slicing. IEEE Trans. Softw. Engin. 10, 4, 352-357.
64. ZHAO, J. 2002. Slicing aspect-oriented software. In Proceedings of the 10th IEEE International Workshop on Program Comprehension (Paris, France). IEEE Computer Society Press, Los Alamitos, CA, 351-260.