Username   Password       Forgot your password?  Forgot your username? 

 

Combinatorial Test Case Prioritization based on Incremental Combinatorial Coverage Strength

Volume 14, Number 6, June 2018, pp. 1283-1290
DOI: 10.23940/ijpe.18.06.p19.12831290

Ziyuan Wang and Feiyan She

School of Computer Science and Technology, Nanjing University of Posts and Telecommunications, Nanjing, 210023, China

(Submitted on March 16, 2018; Revised on April 26, 2018; Accepted on May 27, 2018)

Abstract:

A combinatorial test case prioritization technique based on incremental combinatorial coverage strength is proposed in this paper. Such an efficient technique prioritizes test cases in an existing high-strength combinatorial test suite, to form an ordered test case sequence. The output prioritized combinatorial test suite could cover combinations of parametric values, where their strengths are mixed from 2 or more, quicker than non-prioritized combinatorial test suite. Theoretical analysis shows that the proposed technique consumes less cost than existing combinatorial test case prioritization technique for the same type of scenarios. Experimental results also show that compared to initial combinatorial test suites without prioritization, prioritized combinatorial test suites yield a higher speed of covering combinations of parametric values. Compared to combinatorial test suites generated by an existing incremental adaptive combinatorial testing strategy, prioritized combinatorial test suites 1) require less test cases to achieve final combinatorial coverage, and 2) yield a higher speed of covering high-strength combinations of parametric values.

 

References: 24

        1. R. C. Bryce, C. J. Colbourn, “Test Prioritization for Pairwise Interaction Coverage,” In Proceedings of 1st International Workshop on Advances in Model-Based Testing, pp. 1-7, St Louis, Missouri, USA, May 15-21, 2005.
        2. R. C. Bryce, C. J. Colbourn. A Density-Based Greedy Algorithm for Higher Strength Covering Arrays. Software Testing, Verification and Reliability, 2009, 19(1): 37-53.
        3. R. C. Bryce, A. M. Memon. “Test Suite Prioritization by Interaction Coverage”. In Proceedings of Workshop on Domain-Specific Approaches to Software Test Automation (DoSTA2007), Dubrovnik, Croatia, September 4, 2007.
        4. R. C. Bryce, S. Sampath, A. M. Memon. “Developing a Single Model and Test Prioritization Strategies for Event-Driven Software”. IEEE Transactions on Software Engineering, 2011, 37(1): 48-64.
        5. Xiang Chen, Qing Gu, Xin Zhang, Daoxu Chen. Building Prioritized Pairwise Interaction Test Suites with Ant Colony. In Proceedings of the 9th International Conference on Quality Software (QSIC2009), August 24-25, 2009: 347-352.
        6. C. J. Colbourn, S, S. Martirosyan, T. V. Trung, R. A. Walker II. Roux-Type Constructions for Covering Arrays of Strengths Three and Four. Designs, Codes and Cryptography, 2006, 41(1): 33-57.
        7. S. Elbaum, A. Malishevsky, G. Rothermel, “Prioritizing Test Cases for Regression Testing,” in Proceedings of International Symposium on Software Testing and Analysis (ISSTA2000): 102-112.
        8. S. Elbaum, A. Malishevsky, G. Rothermel. Incorporating Varying Test Costs and Fault Severities into Test Case Prioritization. In Proceedings of the 23rd International Conference on Software Engineering (ICSE2001): 329-338.
        9. S. Fouche, M. B. Cohen, A. Poter, “Towards Incremental Adaptive Covering Arrays,” in Proceedings of 6th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on The Foundations of Software Engineering (ESEC/FSE2007), pp. 557-560, Dubrovnik, Croatia, September 3-7, 2007.
        10. R. Huang, J. Chen, Z. Li, R. Wang, Y Lu. Adaptive random prioritization for interaction test suites. In: Proceedings of the 29th Symposium on Applied Computing (SAC’14): 1058–1063.
        11. R. Huang, J. Chen, D. Towey, A. T. S. Chan, Y. Lu. “Aggregate-strength interaction test suite prioritization”. Journal of Systems & Software, 2015, 99(C):36-51.
        12. Rubing Huang, Xiaodong Xie, Dave Towey, Tsong Yueh Chen, Yansheng Lu, Jinfu Chen. “Prioritization of Combinatorial Test Cases by Incremental Interaction Coverage”. International Journal of Software Engineering and Knowledge Engineering, 2013.
        13. D. Jeffrey, N. Gupta. Test Case Prioritization Using Relevant Slices. In Proceedings of the 29th International Computer Software and Applications Conference (COMPSAC2006), Chicago, USA. pp. 411-420.
        14. Y. Lei, R. Kacker, D. R. Kuhn, V. Okun, J. Lawrence. IPOG IPOG-D: Efficient Test Generation for Multi-Way Combinatorial Testing. Software Testing, Verification and Reliability, 2008, 18(3): 125-148.
        15. R. Mandl. Orthogonal Latin Squares: An Application of Experimental Design to Compiler Testing. In Communications of the ACM, 1985, 28(10): 1054-1058.
        16. Changhai Nie, Hareton Leung. “A survey of combinatorial testing”. ACM Computing Surveys (CSUR), 2011, 43(2):1-29.x
        17. G. Rothermel, R. H. Untch, C. Y. Chu, M. J. Harrold, “Prioritizing Test Cases for Regression Testing,” IEEE Transactions on Software Engineering, 2001, 27(10): 929-948.
        18. A. Srivastava, J. Thiagrajan. Effectively Prioritizing Tests in Development Environment. In Proceedings of the ACM International Symposium on Software Testing and Analysis (ISSTA2002), Roma, Italy. pp. 97-106.
        19. K. R. Walcott, M. L. Soffa, G. M. Kapfhammer, R. S. Roos. Time-Aware Test Suite Prioritization. In Proceedings of the ACM International Symposium on Software Testing and Analysis (ISSTA2006), Portland, Maine, USA. pp. 1-12.
        20. Zi-Yuan Wang. “Test Case Generation and Prioritization for Combinatorial Testing”. A Dissertation for Ph.D., Southeast University, 2009.
        21. Ziyuan Wang, Baowen Xu, Changhai Nie. “Greedy Heuristic Algorithms to Generate Variable Strength Combinatorial Test Suite”. In Proceedings of the 8th International Conference on Quality Software (QSIC2008), Oxford, UK, August 12-13, 2008: 155-160.
        22. Z. Wang, L. Chen, B. Xu, and Y. Huang. “Cost-Cognizant Combinatorial Test Case Prioritization”. International Journal of Software Engineering and Knowledge Engineering, 2011, 21(06):829-854.
        23. W. E. Wong, J. R. Horgan, S. London, H. Agrawal. A Study of Effective Regression Testing in Practice. In Proceedings of the 8th IEEE International Symposium on Software Reliability Engineering (ISSRE1997): 264-274.
        24. X. Zhang, B. Qu, “An Improved Metric for Test Case Prioritization,” In Proceedings of Web Information Systems and Applications Conference (WISA2011): 125-130.

               

              Please note : You will need Adobe Acrobat viewer to view the full articles.Get Free Adobe Reader

              Attachments:
              Download this file (IJPE-2018-06-19.pdf)IJPE-2018-06-19.pdf[Combinatorial Test Case Prioritization based on Incremental Combinatorial Coverage Strength]511 Kb
               
              This site uses encryption for transmitting your passwords. ratmilwebsolutions.com