Quantum algorithm for solving the test suite minimization problem

References

• Ahmed, B. S. (2016). Test case minimization approach using fault detection and combinatorial optimization techniques for configuration-aware structural testing. International Journal of Engineering Science and Technology, 19(2), 737–16.
   Web of Science ®Google Scholar
• Alian, M., Suleiman, D., & Shaeout, A. (2016). Test case reduction techniques - Survey. (IJACSA) International Journal of Advanced Computer Science and Applications, 7(5), 264–275.
   Web of Science ®Google Scholar
• Arima, K., Shigei, N., & Miyajima, H., A proposal of a quantum search algorithm, Fourth International Conference on Computer Sciences and Convergence Information Technology, Korea. https://doi.org/10.1109/ICCIT.2009.126, (2009).
   Google Scholar
• Banerjee, A., & Pathak, A. (2009). An algorithm for minimization of quantum cost, Applied Mathematics & Information Sciences. arXiv: 0910.2129v2, 6(1).
   Google Scholar
• Biron, D., Biham, O., Biham, E., Grassl, M., & Lidar, D. A. (1998). Generalized grover search algorithm for arbitrary initial amplitude distribution. Lecture Notes In Computer Science, 1509, 140–147.
   Google Scholar
• Harman, M., McMinn, P., de Souza, J. T., & Yoo, S., Search based software engineering: Techniques, taxonomy, tutorial, LASER Summer School 2008–2010, LNCS 700, Springer, pp. 1–59 (2012).
   Google Scholar
• Hussein, H., Younes, A., & AbdelMoez, W. (2020). Quantum- inspired genetic algorithm for solving the test suite minimization problem. WSEAS TRANSACTIONS on COMPUTERS, 19, E-ISSN: 2224-2872. https://doi.org/10.37394/23205.2020.19.20.
   Google Scholar
• Menon, P. S., & Ritwik, M., A comprehensive but not complicated survey on quantum computing, International Conference on Future Information Engineering, China, pp. 144–152 (2014).
   Google Scholar
• Mohapatra, S. K., & Prasad, S. (2015). Test case reduction using ant colony optimization for object oriented program. International Journal of Electrical and Computer Engineering (IJECE), 5(6), 1424–1432. https://doi.org/10.11591/ijece.v5i6.pp1424-1432
   Google Scholar
• Orsan Ozener, O., & Sozer, H. (2020). An effective formulation of the multi-criteria test suite minimization problem. Journal of Systems and Software, 168. ISSN: 0164-1212. https://doi.org/10.1016/j.jss.2020.110632
   Google Scholar
• Panda, S., & Mohapatra, D. P. (2017). Regression test suite minimization using integer linear programming model. Software: Practice & Experience, 1539–1560.
   Web of Science ®Google Scholar
• Rothermel, G., Harrold, M. J., Ostrin, J., & Hong, C.(1998). An empirical study of the effects of minimization on the fault detection capabilities of test suites, International Conference on Software Maintenance, Luxembourg. https://doi.org/10.1109/icsm.1998.738487 .
   Google Scholar
• Srivastava, P. R., & Kim, T. (2009). Application of genetic algorithms to software testing. International Journal of Software Engineering and Its Applications, 3(4).
   Google Scholar
• Subashini, B., & JeyaMala, D., Reduction of test cases using clustering technique. International journal of innovative research in science, engineering and technology, vol. 3, Special Issue 3, International Conference on Innovations in Engineering and Technology (ICIET’14), Malaysia, pp. 1992–1995 (2014).
   Google Scholar
• Wang, R., Qu, B., & Lu, Y. (2015). Empirical study of the effects of different profiles on regression test case reduction. IET Software, 9(2), 29–38. https://doi.org/10.1049/iet-sen.2014.0008
   Web of Science ®Google Scholar
• Xue, Y., & Li, Y. (2020). Multi-objective integer programming approaches for solving the multi-criteria test-suite minimization problem: Towards sound and complete solutions of a particular search-based software-engineering problem. ACM Transactions on Software Engineering and Methodology, 29(3), 1–50. https://doi.org/10.1145/3392031
   Google Scholar
• You, L., & Lu, Y. (2012). A genetic algorithm for the time-aware regression testing reduction problem, International Conference on Natural Computation, China.
   Google Scholar
• Younes, A. (2008). Strength and weakness in grover’s quantum search algorithm. arXiv:0811.4481v1.
   Google Scholar
• Younes, A., & Miller, J. F. (2004). Representation of boolean quantum circuits as reed-muller expansions. International Journal of Electronics, 91(7), 431–444. https://doi.org/10.1080/00207210412331272643
   Web of Science ®Google Scholar
• Younes, A., Rowe, J., & Miller, J. (2003). Quantum search algorithm with more reliable behaviour using partial diffusion, AIP Conference Proceedings, USA. https://doi.org/10.1063/1.1834408
   Google Scholar
• Younes, A., Rowe, J., & Miller, J. (2008). Enhanced quantum searching via entanglement and partial diffusion, Physica D: Nonlinear Phenomena, 237(8), 1074-1078.
   Google Scholar
• Younes, A., & Rowe, J. E. (2015). A polynomial time bounded-error quantum algorithm for boolean satisfiability. arXiv:1507.05061v2.
   Google Scholar