[1] P. Bourque and R. E. Fairley, “SWEBOK: Guide to the Software Engineering Body of Knowledge (v3.0),” IEEE Computer Society, 2014 [2] N. Kobayashi, T. Tsuchiya,T. Kikuno, “Non-Specification-based Approaches to Logic Testing for Software,” Information and Software Technology, Vol. 44, No. 2, pp. 113-121, 2002 [3] W. A. Ballance, S. Vikomir,W. Jenkins, “Effectiveness of Pair-Wise Testing for Software with Boolean Inputs,” inProceedings of IEEE 5th International Conference on Software Testing, Verification and Validation (ICST2012): 1st International Workshop on Combinatorial Testing (IWCT2012), pp. 580-586, 2016 [4] S. Vikomir, O. Starov,R. Bhambroo, “Evaluation of T-Wise Approach for Testing Logical Expressions in Software,” inProceedings of IEEE 6th International Conference on Software Testing, Verification and Validation Workshops (ICSTW2013), 2nd International Workshop on Combinatorial Testing (IWCT2013), pp. 249-256, 2013 [5] H. Wu, C. Nie, J. Petke, Y. Jia,M. Harman, “An Empirical Comparison of Combinatorial Testing, Random Testing and Adaptive Random Testing,”IEEE Transactions on Software Engineering, DOI: 10.1109/TSE.2018.2852744 [6] P. J. Schroeder, P. Bolaki, and V. Gopu, “Comparing the Fault Detection Effectiveness of N-way and Random Test Suites,” in Proceedings of the 2004 International Symposium on Empirical Software Engineering (ISESE2004), pp. 49-59, Redondo Beach, California, USA, August 19-20, 2004 [7] L. S. Ghandehari, J. Czerwonka, Y. Lei, S. Shafiee, R. Kacker,R. Kuhn, “An Empirical Comparison of Combinatorial and Random Testing,” inProceedings of IEEE 7th International Conference on Software Testing, Verification, and Validation Workshops (ICSTW2014), 3rd International Workshop on Combinatorial Testing (IWCT2014), pp. 68-77, 2014 [8] Z. Chen, T. Y. Chen,B. Xu, “A Revisit of Fault Class Hierarchies in General Boolean Specifications,” ACM Transactions on Software Engineering and Methodology (TOSEM), Vol. 20, No. 3, pp. 13, 2011 [9] C. Nie and H. Leung, “A Survey of Combinatorial Testing,” ACM Computing Surveys (CSUR), Vol. 43, No. 2, pp. 11, 2011 [10] R. Mandl, “Orthogonal Latin Squares: An Application of Experimental Design to Compiler Testing,” Communications of the ACM, Vol. 28, No. 10, pp. 1054-1058, 1985 [11] 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, Vol. 41, No. 1, pp. 33-57, 2006 [12] R. C.Bryce and C. J. Colbourn, “A Density-based Greedy Algorithm for Higher Strength Covering Arrays,” Software Testing, Verification and Reliability, Vol. 19, No. 1, pp. 37-53, 2009 [13] 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, Vol. 18, No. 3, pp. 125-148, 2008 [14] J. Lin, C. Luo, S. Cai, K. Su, D. Hao,L. Zhang, “TCA: An Efficient Two-Mode Meta-Heuristic Algorithm for Combinatorial Test Generation,” in Proceedings of 30th IEEE/ACM International Conference on Automated Software Engineering (ASE2015), pp. 494-505, Lincoln, Nebraska, USA, November 9-13, 2015 [15] S. Maity and A. Nayak, “Improved Test Generation Algorithms for Pair-Wise Testing,” inProceedings of 16th IEEE International Symposium on Software Reliability Engineering (ISSRE2005), November 8-11, 2005 [16] C. H. Nie, B. W. Xu,L. Shi, “A New Pairwise Covering Test Data Generation Algorithm for the System with Many 2-Level Factors,” Chinese Journal of Computers, Vol. 29, No. 6, pp. 841-848, 2006 [17] D. J.Kleitman and J. Spencer, “Families of K-Independent Sets,”Discrete Mathematics, Vol. 6, pp. 255-262, 1973 [18] M. Naor, L. J. Schulman,A. Srinvasan, “Splitters and Near-Optimal Randomization,” inProceedings of 36th Annual Symposium on Foundations of Computer Science (FOCS1996), pp. 182-191, 1996 [19] N. G. Leveson, M. P. E.Heimdahl, H. Hildreth, and J. D. Reese, “Requirements Specification for Process-Control Systems,” IEEE Transaction Software Engineering, Vol. 20, No. 9, pp. 684-707, 1994 [20] E. Weyuker, T. Goradia,A. Singh, “Automatically Generating Test Data from a Boolean Specification,” IEEE Transaction Software Engineering, Vol. 20, No. 5, pp. 353-363, 1994 [21] D. R. Kuhn, D. R. Wallace,A. M. Gallo, “Software Fault Interaction and Implication for Software Testing,” IEEE Transaction on Software Engineering, Vol. 30, No. 6, pp. 418-421, 2004 [22] Z. Wang and Y. Qi, “Why Combinatorial Testing Works: Analyzing Minimal Failure-Causing Schemas in Logic Expressions,” inProceedings of IEEE 8th International Conference on Software Testing, Verification, and Validation Workshops (ICSTW2015): 4th International Workshop on Combinatorial Testing (IWCT2015), April 13-17, 2015 [23] P. J. Schroeder, “Black-Box Test Reduction using Input-Output Analysis: [Dissertation for PhD],” Department of Computer Science, Illinois Institute of Technology, Chicago, IL, USA, 2001 [24] Z. Wang, B. Xu,C. Nie, “Greedy Heuristic Algorithms to Generate Variable Strength Combinatorial Test Suite,” in Proceedings of the 8th International Conference on Quality Software (QSIC2008), pp. 155-160, Oxford, UK, August 12-13, 2008 [25] Z. Wang, C. Nie,B. Xu, “Generating Combinatorial Test Suite for Interaction Relationship,” in Proceedings of 4th International Workshop on Software Quality Assurance (SOQUA2007), pp. 55-61, Croatia, September 3-4, 2007 |