References

Ahmed, B.S. and K.Z. Zamli and C.P. Lim, 2012. Application of particle swarm optimization to uniform and variable strength covering array construction. Applied. Soft Comput. J., 12: 1330-1347.
CrossRef  |  Direct Link  |  

Ahmed, B.S. and K.Z. Zamli, 2011. A variable strength interaction test suites generation strategy using particle swarm optimization. J. Syst. Software, 84: 2171-2185.
CrossRef  |  Direct Link  |  

Ahmed, B.S., M.A. Sahib and M.Y. Potrus, 2014. Generating combinatorial test cases using Simplified Swarm Optimization (SSO) algorithm for automated GUI functional testing. Eng. Sci. Technol. Int. J., 17: 218-226.
Direct Link  |  

Anand, S., E.K. Burke, T.Y. Chen, J. Clark and M.B. Cohen et al., 2013. An orchestrated survey of methodologies for automated software test case generation. J. Syst. Software, 86: 1978-2001.
Direct Link  |  

Baker, R. and I. Habli, 2013. An empirical evaluation of mutation testing for improving the test quality of safety-critical software. IEEE. Trans. Software Eng., 39: 787-805.
Direct Link  |  

Bansal, A., 2014. A comparative study of software testing techniques. Intl. J. Comput. Sci. Mob. Comput., 3: 579-584.
Direct Link  |  

Belli, F., C.J. Budnik, A. Hollmann, T. Tuglular and W.E. Wong, 2016. Model-based mutation testing-approach and case studies. Sci. Comput. Program., 120: 25-48.
Direct Link  |  

Bryce, R.C., S. Sampath, J.B. Pedersen and S. Manchester, 2011. Test suite prioritization by cost-based combinatorial interaction coverage. Intl. J. Syst. Assur. Eng. Manage., 2: 126-134.
Direct Link  |  

Debroy, V. and W.E. Wong, 2014. Combining mutation and fault localization for automated program debugging. J. Syst. Software, 90: 45-60.
Direct Link  |  

Fraser, G. and A. Arcuri, 2015. Achieving scalable mutation-based generation of whole test suites. Empirical Software Eng., 20: 783-812.
Direct Link  |  

Fraser, G. and A. Zeller, 2012. Mutation-driven generation of unit tests and oracles. IEEE. Trans. Software Eng., 38: 278-292.
CrossRef  |  Direct Link  |  

Garvin, B.J., M.B. Cohen and M.B. Dwyer, 2011. Evaluating improvements to a meta-heuristic search for constrained interaction testing. Empirical Software Eng., 16: 61-102.
Direct Link  |  

Habibi, E. and S.H. Mirian-Hosseinabadi, 2015. Event-driven web application testing based on model-based mutation testing. Inf. Software Technol., 67: 159-179.
Direct Link  |  

Hamlet, R.G., 1977. Testing programs with the aid of a compiler. IEEE Trans. Software Eng., SE-3: 279-290.
CrossRef  |  

Jia, Y. and M. Harman, 2009. Higher order mutation testing. Inf. Software Technol., 51: 1379-1393.
Direct Link  |  

Jia, Y. and M. Harman, 2011. An analysis and survey of the development of mutation testing. IEEE. Trans. Software Eng., 37: 649-678.
CrossRef  |  Direct Link  |  

Kennedy, J. and R. Eberhart, 1995. Particle swarm optimization. Proc. IEEE. Intl. Conf. Neural Netw., 1: 1942-1948.
Direct Link  |  

Kuliamin, V.V. and A.A. Petukhov, 2011. A survey of methods for constructing covering arrays. Program. Comput. Software, 37: 121-146.
Direct Link  |  

Mao, C., X. Yu, J. Chen and J. Chen, 2012. Generating test data for structural testing based on ant colony optimization. Proceedings of the 12th International Conference on Quality Software (QSIC’12), August 27-29, 2012, IEEE, Washington, USA., ISBN:978-0-7695-4833-3, pp: 98-101.

Masud, M., A. Nayak, M. Zaman and N. Bansal, 2005. A strategy for mutation testing using genetic algorithms. Proceedings of the Canadian Conference on Electrical and Computer Engineering, May 1-4, 2005, Saskatoon, Sask, pp: 1049-1052.

Mresa, E.S. and L. Bottaci, 1999. Efficiency of mutation operators and selective mutation strategies: An empirical study. Software Test. Verif. Reliab., 9: 205-232.

Nayak, N. and D.P. Mohapatra, 2010. Automatic Test Data Generation for Data Flow Testing using Particle Swarm Optimization. In: Contemporary Computing, Ranka, S. (Ed.). Springer, Berlin, Germany, ISBN:978-3-642-14824-8, pp: 1-12.

Nidhra, S. and J. Dondeti, 2012. Blackbox and whitebox testing techniques: A literature review. Intl. J. Embedded Syst. Appl., 2: 29-50.
CrossRef  |  Direct Link  |  

Nie, C. and H. Leung, 2011. A survey of combinatorial testing. ACM. Comput. Surv., 43: 11-29.
CrossRef  |  Direct Link  |  

Nie, C., H. Wu, X. Niu, F.C. Kuo and H. Leung et al., 2015. Combinatorial testing, random testing and adaptive random testing for detecting interaction triggered failures. Inf. Software Technol., 62: 198-213.
Direct Link  |  

Pachauri, A. and G. Srivastava, 2013. Automated test data generation for branch testing using genetic algorithm: An improved approach using branch ordering, memory and elitism. J. Syst. Software, 86: 1191-1208.
Direct Link  |  

Torres-Jimenez, J. and E. Rodriguez-Tello, 2012. New bounds for binary covering arrays using simulated annealing. Inf. Sci., 185: 137-152.
Direct Link  |  

Usaola, M.P. and P.R. Mateo, 2010. Mutation testing cost reduction techniques: A survey. IEEE. Software, 27: 80-86.
CrossRef  |  Direct Link  |  

Yuan, X., M.B. Cohen and A.M. Memon, 2011. GUI interaction testing: Incorporating event context. IEEE Trans. Software Eng., 37: 559-574.
CrossRef  |