ICTSS 2015: Testing Software and Systems pp 249-256 | Cite as
Genetic Algorithm Application for Enhancing State-Sensitivity Partitioning
Abstract
Software testing is the most crucial phase in software development life cycle which intends to find faults as much as possible. Test case generation leads the research in software testing. So, many techniques were proposed for the sake of automating the test case generation process. State sensitivity partitioning is a technique that partitions the entire states of a module. The generated test cases are composed of sequences of events. However, there is an infinite set of sequences with no upper bound on the length of a sequence. Thus, a lengthy test sequence might be encountered with redundant data states, which will increase the size of test suite and, consequently, the process of testing will be ineffective. Therefore, there is a need to optimize those test cases generated by SSP. GA has been identified as the most common potential technique among several optimization techniques. Thus, GA is investigated to integrate it with the existing SSP. This paper addresses the issue on deriving the fitness function for optimizing the sequence of events produced by SSP.
Keywords
Genetic Algorithm (GA) State-Sensitivity partitioning (SSP) Test case Sequence of events Data stateReferences
- 1.Pressman, R.S.: Software Engineering: A Practitioner’s Approach. McGraw-Hill Higher Education, New York (2010)Google Scholar
- 2.Baharom, S., Shukur, Z.: Module documentation based testing using Grey-Box approach. In: ITSim 2008. International Symposium on Information Technology, 2008 (2008)Google Scholar
- 3.Baharom, S., Shukur, Z.: State-Sensitivity Partitioning technique for module documentation-based testing. In: Business Transformation through Innovation and Knowledge Management an Academic Perspective. Istanbul, Turkey (2010)Google Scholar
- 4.Baharom, S., Shukur, Z.: An experimental assessment of module documentation-based testing. Inf. Softw. Technol. 53(7), 747–760 (2011)CrossRefGoogle Scholar
- 5.Alsmadi, I., et al.: Effective generation of test cases using genetic algorithms and optimization theory. J. Commun. Comput. 7(11), 72–82 (2010)Google Scholar
- 6.Kulkarni, N.J., et al.: Test case optimization using artificial bee colony algorithm. In: Abraham, A., Mauri, J.L., Buford, J.F., Suzuki, J., Thampi, S.M. (eds.) Advances in Computing and Communications. Communications in Computer and Information Science, vol. 192, pp. 570–579. Springer, Heidelberg (2011)CrossRefGoogle Scholar
- 7.Ali, S., et al.: A systematic review of the application and empirical investigation of search-based test case generation. IEEE Trans. Softw. Eng. 36(6), 742–762 (2010)CrossRefGoogle Scholar
- 8.Harman, M., McMinn, P., de Souza, J.T., Yoo, S.: Search based software engineering: techniques, taxonomy, tutorial. In: Meyer, B., Nordio, M. (eds.) Empirical Software Engineering and Verification. LNCS, vol. 7007, pp. 1–59. Springer, Heidelberg (2012)CrossRefGoogle Scholar
- 9.Gannon, J.D., Purtilo, J., Zelkowitz, M.V.: Software Specification: A Comparison of Formal Methods. Ablex Publishing Company, Norwood (1994)Google Scholar
- 10.Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. University of Michigan, Ann Arbor (1975)Google Scholar
- 11.Li, Z., Harman, M., Hierons, R.M.: Search algorithms for regression test case prioritization. IEEE Trans. Softw. Eng. 33(4), 225–237 (2007)CrossRefGoogle Scholar
- 12.McMinn, P.: Search-based software test data generation: a survey. Softw. Test. Verification Reliab. 14(2), 105–156 (2004)CrossRefGoogle Scholar
- 13.Conrad, A.P., Roos, R.S., Kapfhammer, G.M.: Empirically studying the role of selection operators duringsearch-based test suite prioritization. ACM (2010)Google Scholar