Using Program Slicing Technique to Reduce the Cost of Software Testing

Systems of computers and their application in the lives of modern human beings are vastly expanding. In any kind of computer application, failure in computer systems can lead to a range of financial and mortal losses. Indeed, the major origin of software failure can be located in designing or implementing software. With regard to these statistics, 30% of the software projects have been prosperous and successful. The proposed method is intended to reduce the cost and time of testing and it focuses on enhancing the efficiency of software testing methods. In this paper, we investigated the effect of slicing techniques on the reduction rate of testing cost and time. The results of experiments show that we can cover a large number of program instructions, branches and paths by a small number of test cases in the sliced program.

[1]  Joseph Robert Horgan,et al.  Effect of Test Set Minimization on Fault Detection Effectiveness , 1995, 1995 17th International Conference on Software Engineering.

[2]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[3]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[4]  Aniello Cimitile,et al.  Conditioned program slicing , 1998, Inf. Softw. Technol..

[5]  Roger S. Pressman,et al.  Software Engineering: A Practitioner's Approach , 1982 .

[6]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[7]  David W. Binkley,et al.  Interprocedural slicing using dependence graphs , 1990, TOPL.

[8]  Antonia Bertolino,et al.  How Many Paths are Needed for Branch Testing? , 1996, J. Syst. Softw..

[9]  Elaine J. Weyuker,et al.  Selecting Software Test Data Using Data Flow Information , 1985, IEEE Transactions on Software Engineering.

[10]  Tom Adams.  Total Variance Approach to Software Reliability-Estimation , 1996, IEEE Trans. Software Eng..

[11]  Boris Beizer,et al.  Software Testing Techniques , 1983 .

[12]  Antonia Bertolino,et al.  Reducing and estimating the cost of test coverage criteria , 1996, Proceedings of IEEE 18th International Conference on Software Engineering.

[13]  G. A. Venkatesh,et al.  The semantic approach to program slicing , 1991, PLDI '91.

[14]  Hoang Pham,et al.  System Software Reliability (Springer Series in Reliability Engineering) , 2007 .

[15]  Bogdan Korel,et al.  Dynamic program slicing methods , 1998, Inf. Softw. Technol..

[16]  Bojan Cukic,et al.  Error propagation in the reliability analysis of component based systems , 2005, 16th IEEE International Symposium on Software Reliability Engineering (ISSRE'05).

[17]  W. Eric Wong,et al.  Effect of test set minimization on fault detection effectiveness , 1998 .

[18]  Manuel Oriol,et al.  Is coverage a good measure of testing effectiveness?: An assessment using branch coverage and Random testing , 2010 .

[19]  A. Jefferson Offutt,et al.  Introduction to Software Testing , 2008 .

[20]  Elaine J. Weyuker,et al.  An Applicable Family of Data Flow Testing Criteria , 1988, IEEE Trans. Software Eng..

[21]  Gregg Rothermel,et al.  An empirical study of the effects of minimization on the fault detection capabilities of test suites , 1998, Proceedings. International Conference on Software Maintenance (Cat. No. 98CB36272).

[22]  Hoang Pham,et al.  System Software Reliability , 1999 .

[23]  Audris Mockus,et al.  Test coverage and post-verification defects: A multiple case study , 2009, 2009 3rd International Symposium on Empirical Software Engineering and Measurement.