An empirical study of static program slice size

ACM Transactions on Software Engineering and Methodology

Volumn 16, Issue 2, 2007, Pages

  Binkley, David ^a   Gold, Nicolas ^b   Harman, Mark ^b  

^a LOYOLA UNIVERSITY MARYLAND   (United States)

^b KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Program slicing; Slice size

Indexed keywords

PROGRAM SLICING; SLICE GRANULARITY; SLICE SIZE;

CODES (SYMBOLS); COMPUTER PROGRAMMING; DATA REDUCTION; DATA STRUCTURES; LEARNING ALGORITHMS;

COMPUTER SOFTWARE;

EID: 34247854816     PISSN: 1049331X     EISSN: 15577392     Source Type: Journal    
DOI: 10.1145/1217295.1217297     Document Type: Article

References (87)

1. AGRAWAL, G., AND GUO, L. 2001. Evaluating explicitly context-sensitive program slicing. In Proceedings of the ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (Snowbird, UT, Jun. 18-19). ACM Press, New York. 6-12.
2. AGRAWAL, H., DEMILLO, R. A., AND SPAFFORD, E. H. 1993. Debugging with dynamic slicing and backtracking. Softw. Pract. Exper. 23, 6 (Jun.), 589-616.
3. ANDERSEN, L. O. 1994. Program analysis and specialization for the C programming language. Ph.D. thesis, DIKU Rep. 94/19, University of Copenhagen, May.
4. ANDERSEN, 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 (Nov.). IEEE Computer Society Press, Los Alimitos, CA. 79-89.
5. ATKINSON, D. C. AND GRISWOLD, W. G. 2001. Implementation techniques for efficient data-flow analysis of large programs. In IEEE International Conference on Software Maintenance (Nov.). IEEE Computer Society Press, Los Alamitos, CA. 52-61.
6. ATKINSON, D. C. AND GRISWOLD, W. G. 1998. Effective whole-program analysis in the presence of pointers. In Proceedings of the ACM SIGSOFT 6th International Symposium on the Foundations of Software Engineering (New York, Nov. 3-5). Softw. Eng. Not. 23, 6, 46-55.
7. BECK, J. AND EICHMANN, D. 1993. Program and interface slicing for reverse engineering. In IEEE /ACM 16th Conference on Software Engineering. IEEE Computer Society Press, Los Alamitos, CA. 509-518.
8. BEIZER, B. 1990. Software Testing Techniques. Van Nostrand Reinhold, New York.
9. BENT, L., ATKINSON, D., AND GRISWOLD, W. 2000. A qualitative study of two whole-program slicers for C. Tech. Rep. CS20000643, University of California at San Diego. A preliminary version appeared at the 2000 ACM SIGSOFT International Symposium on the Foundations of Software Engineering.
10. BESZEDES, A. AND GYIMOTHY, T. 2002. Union slices for the approximation of the precise slice. In Proceedings of the IEEE International Conference on Software Maintenance (Oct.). IEEE Computer Society Press, Los Alamitos, CA. 12-20.
11. BIEMAN, J. M. AND OTT, L. M. 1994. Measuring functional cohesion. IEEE Trans. Softw. Eng. 20, 8 (Aug.), 644-657.
12. BINKLEY, D. W. 1998. The application of program slicing to regression testing. Inf. Softw. Technol. 40, 11-12, 583-594.
13. BINKLEY, D. W. 1997. Semantics guided regression test cost reduction. IEEE Trans. Softw. Eng. 23, 8 (Aug.), 498-516.
14. BINKLEY, D. W. AND HARMAN, M. 2005. Locating dependence clusters and dependence pollution. In Proceedings of the 21st IEEE International Conference on Software Maintenance. IEEE Computer Society Press, Los Alamitos, CA. 177-186.
15. BINKLEY, D. W. AND GALLAGHER, K. B. 1996. Program slicing. In Advances in Computing, vol. 43, M. Zelkowitz, Ed. Academic Press. 1-50.
16. BINKLEY, D. W. AND HARMAN, M. 2004. A survey of empirical results on program slicing. Adv. Comput. 62, 105-178.
17. 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 (Sept.). IEEE Computer Society Press, Los Alamitos, CA. 44-53.
18. 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 (Sept.). IEEE Computer Society Press, Los Alamitos, CA. 203-212.
19. BINKLEY, D. W., HORWITZ, S., AND REPS, T. 1995. Program integration for languages with procedure calls. ACM Trans. Softw. Eng. Methodol. 4, 1, 3-35.
20. BURKE, M., CARINI, P., CHOI, J.-D., AND HIND, M. 1995. Flow-Insensitive interprocedural alias analysis in the presence of pointers. In Proceedings of the 7th International Workshop on Languages and Compilers for Parallel Computing. Lecture Notes in Computer Science, vol. 892. Springer Verlag.
21. CALLAHAN, D. 1988. The program summary graph and flow-sensitive interprocedural data flow analysis. ACM SIGPLAN Not. 23, 7 (Jul.), 47-56.
22. CANPORA, G., CIMITILE, A., DE LUCIA, A., AND LUCCA, G. A. D. 1994a. Software salvaging based on conditions. In Proceedings of the International Conference on Software Maintenance (Sept.). IEEE Computer Society Press, Los Alamitos, CA. 424-433.
23. CANFORA, G., CIMITILE, A., AND MUNRO, M. 1994b. RE : Reverse engineering and reuse re-engineering. J. Softw. Maintenance: Res. Pract. 6, 2, 53-72.
24. CHOI, J.-D., BURKE, M., AND CARINI, P. 1993. Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. In Conference Record of the 20th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Charleston, SC, Jan. 10-13). ACM Press, New York. 232-245.
25. CIMITILE, A., DE LUCIA, A., AND MUNRO, M. 1996. A specification driven slicing process for identifying reusable functions. Softw, Maintenance: Res. Pract. 8, 145-178.
26. 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. IEEE Computer Society Press, Los Alamitos, CA. 124-133.
27. CIMITILE, A., DE LUCIA, A., AND MUNRO, M. 1996. Qualifying reusable functions using symbolic execution. In Proceedings of the 2nd Working Conference on Reverse Engineering. IEEE Computer Society Press, Los Alamitos, CA. 178-187.
28. CLARKE, L. A. 1976. A system to generate test data and symbolically execute programs. IEEE Trans. Softw. Eng. 2, 3 (Sept.), 215-222.
29. DE LUCIA, A. 2001. Program slicing: Methods and applications. In Proceedings of the 1st IEEE International Workshop on Source Code Analysis and Manipulation. IEEE Computer Society Press, Los Alamitos, CA. 142-149.
30. DE LUCIA, A., FASOLINO, A. R., AND MUNRO, M. 1996. Understanding function behaviours through program slicing. In Proceedings of the 4th IEEE Workshop on Program Comprehension. IEEE Computer Society Press, Los Alamitos, CA. 9-18.
31. EMAMI, M., GHIYA, R., AND HENDREN, L. J. 1994. Context-Sensitive interprocedural points-to analysis in the presence of function pointers. ACM SIGPLAN Not. 29, 6 (Jun.), 242-256.
32. FERGUSON, R. AND KOREL, B. 1996. The chaining approach for software test data generation. ACM Trans. Softw. Eng. Methodol. 5, 1 (Jan.), 63-86.
33. FOSTER, J. S., FAHNDRICH, M., AND AIKEN, A. 2000. Polymorphic versus monomorphic flow-insensitive points-to analysis for C. In Static Analysis Symposium. 175-198.
34. FAHNDRICH, M., FOSTER, J. S., SU, Z., AND AIKEN, A. 1998. Partial online cycle elimination in inclusion constraint graphs. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (Jun.). ACM Press, New York. 85-96.
35. GALLAGHER, K. B. 1992. Evaluating the surgeon's assistant: Results of a pilot study. In Proceedings of the International Conference on Software Maintenance. IEEE Computer Society Press, Los Alamitos, CA. 236-244.
36. GALLAGHER, K. B. AND LYLE, J. R. 1991. Using program slicing in software maintenance. IEEE Trans. Softw. Eng. 17, 8 (Aug.), 751-761.
37. GRAMMATECH INC. 2002. The codesurfer slicing system, http://www.grammatech.com/products/codesurfer/ReleaseNotes.html.
38. GUPTA, R., HARROLD, M. J., AND SOFFA, M. L. 1992. An approach to regression testing using slicing. In Proceedings of the IEEE Conference on Software Maintenance. IEEE Computer Society Press, Los Alamitos, CA. 299-308.
39. HAMMER, C. AND SNELTING, G. 2004. An improved sliver for Java. In Proceedings of the ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering. ACM Press, New York. 17-22.
40. HARMAN, M. AND DANICIC, S. 1995. Using program slicing to simplify testing. Softw. Test. Verif. Reliability 5, 3 (Sept.), 143-162.
41. HARMAN, M. AND HIERONS, R. M. 2001. An overview of program slicing. Softw. Focus 2, 3, 85-92.
42. HARMAN, M., HIERONS, R. M., DANICIC, S., HOWROYD, J., AND FOX, C. 2001. Pre/Post conditioned slicing. In Proceedings of the IEEE International Conference on Software Maintenance (Nov.). IEEE Computer Society Press, Los Alamitos, CA. 138-147.
43. HARMAN, M., OKUNLAWON, M., SIVAGURUNATHAN, B., AND DANICIC, S. 1997. Slice-Based meaurement of coupling. In Proceedings of the 19th Workshop on Process Modelling and Empirical Studies of Software Evolution (Boston, MA, May), R. Harrison, Ed.
44. HARROLD, M. J. AND CI, N. 1998. Reuse-Driven interprocedural slicing. In Proceedings of the 20th International Conference on Software Engineering (Apr.). IEEE Computer Society Press, Los Alamitos, CA. 74-83.
45. 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 Conference on Programming Language Design and Implementation (New York, Jun. 20-22), C. Norris and J. J. B. Fenwick, Eds. ACM SIGPLAN Not. 36, 5, 254-263.
46. HIERONS, R. M., HARMAN, M., AND DANICIC, S. 1999. Using program slicing to assist in the detection of equivalent mutants. Softw. Test. Verif. Reliability 9, 4, 233-262.
47. HIERONS, R. M., HARMAN, M., FOX, C., OUARBYA, L., AND DAOUDI, M. 2002. Conditioned slicing supports partition testing. Softw. Test. Verif. Reliability 12, (Mar.), 23-28.
48. HORWITZ, S., PRINS, J., AND REPS, T. 1989. Integrating non-interfering versions of programs. ACM Trans. Program. Lang. Syst. 11, 3 (Jul.), 345-387.
49. 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, Jun.). ACM SIGPLAN Not. 23, 7, 35-46.
50. JAYARAMAN, G., RANGANATH, V. P., AND HATCLIFF, J. 2005. Kaveri: Delivering the Indus Java program to Eclipse. In Fundamental Approaches to Software Engineering. Lecture Notes in Computer Science, vol. 3442. Springer Verlag. 269-273.
51. JONES, C. 1991. Applied Software Measurement: Assuring Productivity and Quality. McGraw-Hill, New York.
52. KAMKAR, M. 1993. Interprocedural dynamic slicing with applications to debugging and testing. Ph.D. thesis, Department of Computer Science and Information Science, Linkoping University, Sweden. Available as Linkoping Studies in Science and Technology, Dissertations, no. 297.
53. KOREL, B. AND LASKI, J. 1988. Dynamic program slicing. Inf. Proc. Lett. 29, 3 (Oct.), 155-163.
54. KRINKE, J. 2002. Evaluating context-sensitive slicing and chopping. In Proceedings of the IEEE International Conference on Software Maintenance. IEEE Computer Society Press, Los Alamitos, CA. 22-31.
55. LAKHOTIA, A. 1993. Rule-Based approach to computing module cohesion. In Proceedings of the 15th Conference on Software Engineering, 34-44.
56. LANDI, W. AND RYDER, B. G. 1992. A safe approximate algorithm for interprocedural pointer aliasing. In SIGPLAN Conference on Programming Language Design and Implementation, SIGPLAN Not. 27, 7.
57. LIANG, D. AND HARROLD, M. J. 1999a. Efficient points-to analysis for whole-program analysis. In Proceedings of the 7th European Software Engineering Conference, held jointly with the 7th ACM SIGSOFT International Symposium on Foundations of Software Engineering, O. Nierstrasz and M. Lemoine, Eds. Lecture Notes in Computer Science, vol. 1687. Springer Verlag. 199-215.
58. LIANG, D. AND HARROLD, M. J. 1999b. Reuse-Driven interprocedural slicing in the presence of pointers and recursion. In Proceedings of the IEEE International Conference on Software Maintenance. IEEE Computer Society Press, Los Alamitos, CA. 410-430.
59. LIAO, S.-W., DIWAN, A., BOSCH, JR., R. P., OHULOUM, A., AND LAM, M. S. 1999. SUIF explorer: An interactive and interprocedural parallelizer. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, A. A. Chien and M. Snir, Eds. ACM SIGPLAN Not. 34, 8, 37-48.
60. 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. 383-389.
61. LYLE, J. R., WALLACE, D. R., GRAHAM, J. R., GALLAGHER, K. B., POOLE, J. P., AND BINKLEY, D. W. 1995. Unravel: A CASE tool to assist evaluation of high integrity software, volume 1: Requirements and design. Tech. Rep. NISTIR 5691, US Department of Commerce, Technology Administration, National Institute of Standards and Technology, Computer Systems Laboratory, Gaithersburg, MD 20899.
62. LYLE, J. R. AND WEISER, M., 1987. Automatic program bug location by program slicing. In Proceedings of the 2nd International Conference on Computers and Applications. IEEE Computer Society Press, Los Alamitos, CA. 877-882.
63. 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. IEEE Computer Society Press, Los Alamitos, CA. 256-266.
64. 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, W. G. Griswold, Ed. ACM Press, New York. 71-80.
65. ORSO, A. SINHA, S., AND HARROLD, M. J. 2001a. Effects of pointers on data dependences. In Proceedings of the 9th IEEE International Workshop on Program Comprehension (May). IEEE Computer Society Press, Los Alamitos, CA. 39-49.
66. ORSO, A. SINHA, S., AND HARROLD, M. J. 2001b. Incremental slicing based on data-dependences types. In Proceedings of the IEEE International Conference on Software Maintenance (Nov.). IEEE Computer Society Press, Los Alamitos, CA. 158-167.
67. OTT, L. M. AND THUSS, J. J. 1993. Slice based metrics for estimating cohesion. In Proceedings of the IEEE-CS International Metrics Symposium. IEEE Computer Society Press, Los Alamitos, CA. 71-81.
68. 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 (May). 198-204.
69. REPS, T. 1998. Program analysis via graph reachability. Inf. Softw. Technal. 40, 11-12, 701-726.
70. REPS., T., HORWITZ, S., SAGIV, M., AND ROSAY, G. 1994. Speedingup slicing. In the ACM Conference on Foundations of Software Engineering (Dec.). ACM SIGSOFT Softw. Eng. Not. 19, 5 (Dec.), 11-20.
71. RUF, E. 1995. Context-Insensitive alias analysis reconsidered. ACM SIGPLAN Not. 30, 6 (Jun.), 13-22.
72. SHAPIRO, M. AND HORWITZ, S. 1997. Fast and accurate flow-insensitive points-to analysis. In Conference Record of the 24th ACM SIGPLAN-SIGACT Symposium, on Principles of Programming Languages (Paris, Jan. 15-17). ACM Press, New York. 1-14.
73. SIMPSON, D., VALENTINE, S. H., MITCHELL, R., LIU, L., AND ELLIS, R. 1993. Recoup-Maintaing Fortran. ACM Fortran Forum 12, 3 (Sept.), 26-32.
74. SINHA, S., HARHOLD, M. J., AND ROTHERMEL, G. 1999. System-Dependence-Graph-Based slicing of programs with arbitrary interprocedural control-flow. In Proceedings of the 21st International Conference on Software Engineering (May). ACM Press, New York. 432-441.
75. STEENSGAARD, B. 1996. Points-To analysis in almost linear time. In Conference Record of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (St. Petersburg, FL, Jan.). ACM Press, New York. 32-41.
76. TIP, F. 1995. A survey of program slicing techniques. J. Program. Lang. 3, 3 (Sept.), 121-189.
77. VENKATESH, G. A. 1995. Experimental results from dynamic slicing of C programs. ACM Trans. Program. Lang. Syst. 17, 2 (Mar.), 197-216.
78. WEGENER, J., BARESEL, A., AND STHAMER, H. 2001. Evolutionary test envirmonment for automatic structural testing. Inf. Softw. Technol. 43, 14, 841-854.
79. WEISER, M. 1984. Program slicing. IEEE Trans. Sofw. Eng. 10, 4, 352-357.
80. WEISER, M. 1979. Program slices: Formal, psychological, and practical investigations of an automatic program abstraction method. Ph.D. thesis, University of Michigan, Ann Arbor, MI.
81. WEISER, M. AND LYLE, J. R. 1985. Experiments on slicing-based debugging aids. In Empirical Studies of Programmers, Soloway and Iyengar, Eds. Molex. 187-197.
82. WEYUKER, E. J. 1977. Program schemas with semantic restrictions. Ph.D. thesis, Rutgers University, New Brunswick, NJ, June.
83. WHEELER, D. A. 2005. SLOC Count User's Guide, http://www.dwheeler.com/sloccount/sloccount.html.
84. WILSON, R. P. AND LAM, M. S. 1995. Efficient context-sensitive pointer analysis for C programs. ACM SIGPLAN Not. 30, 6 (Jun.), 1-12.
85. YONG, S. H., HORWITZ, S., AND REPS, T. 1999. Pointer analysis for programs with structures and casting. ACM SIGPLAN Not. 34, 5 (May), 91-103.
86. ZHANG, S., RYDER, B. G., AND LANDI, W. 1996. Program decomposition for pointer aliasing: A step toward practical analyses. In Proceedings of the 4th ACM SIGSOFT Symposium on the Foundations of Software Engineering (New York, Oct. 16-18). ACM Softw. Eng. Not. 21, 6, 81-92.
87. ZHANG, X., GUPTA, R., AND ZHANG, Y. 2003. Precise dynamic slicing algorithms. In Proceedings of the 25th IEEE International Conference on Software Engineering, IEEE Computer Society Press, Los Alamitos, CA. 319-329.