{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:57:34Z","timestamp":1776333454451,"version":"3.51.2"},"reference-count":136,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T00:00:00Z","timestamp":1735603200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2022YFB4501900"],"award-info":[{"award-number":["2022YFB4501900"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62202025 and Grant 62002256"],"award-info":[{"award-number":["62202025 and Grant 62002256"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Young Elite Scientist Sponsorship Program by CAST","award":["YESS20230566"],"award-info":[{"award-number":["YESS20230566"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Softw. Eng. Methodol."],"published-print":{"date-parts":[[2025,1,31]]},"abstract":"<jats:p>\n            To meet the increasing demand for customized software, highly configurable systems become essential in practice. Such systems offer many options to configure, and ensuring the reliability of these systems is critical. A widely used evaluation metric for testing these systems is\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(t\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            -wise coverage, where\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(t\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            represents testing strength, and its value typically ranges from 2 to 6. It is crucial to design effective and efficient methods for generating test suites that achieve high\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(t\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            -wise coverage. However, current state-of-the-art methods need to generate large test suites for achieving high\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(t\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            -wise coverage. In this work, we propose a novel method called\n            <jats:italic>LS-Sampling-Plus<\/jats:italic>\n            that can efficiently generate test suites with high\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(t\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            -wise coverage for\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(2\\leq t\\leq 6\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            while being smaller in size compared to existing state-of-the-art methods.\n            <jats:italic>LS-Sampling-Plus<\/jats:italic>\n            incorporates many core algorithmic techniques, including two novel scoring functions, a dynamic mechanism for updating sampling probabilities, and a validity-guaranteed systematic search method. Our experiments on various practical benchmarks show that\n            <jats:italic>LS-Sampling-Plus<\/jats:italic>\n            can achieve higher\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(t\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            -wise coverage than current state-of-the-art methods, through building a test suite of the same size. Moreover, our evaluations indicate the effectiveness of all core algorithmic techniques of\n            <jats:italic>LS-Sampling-Plus<\/jats:italic>\n            . Furthermore,\n            <jats:italic>LS-Sampling-Plus<\/jats:italic>\n            exhibits better scalability and fault detection capability than existing state-of-the-art methods.\n          <\/jats:p>","DOI":"10.1145\/3688836","type":"journal-article","created":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T15:45:14Z","timestamp":1723823114000},"page":"1-64","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Solving the\n            <i>t<\/i>\n            -Wise Coverage Maximum Problem via Effective and Efficient Local Search-Based Sampling"],"prefix":"10.1145","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5028-1064","authenticated-orcid":false,"given":"Chuan","family":"Luo","sequence":"first","affiliation":[{"name":"School of Software, Beihang University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0895-6258","authenticated-orcid":false,"given":"Jianping","family":"Song","sequence":"additional","affiliation":[{"name":"School of Software, Beihang University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1017-1562","authenticated-orcid":false,"given":"Qiyuan","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Computing, National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9764-6259","authenticated-orcid":false,"given":"Binqi","family":"Sun","sequence":"additional","affiliation":[{"name":"Chair of Cyber-Physical Systems in Production Engineering, Technical University of Munich, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3056-9962","authenticated-orcid":false,"given":"Junjie","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Intelligence and Computing, Tianjin University, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3063-9425","authenticated-orcid":false,"given":"Hongyu","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Big Data and Software Engineering, Chongqing University, Chongqing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3653-3514","authenticated-orcid":false,"given":"Jinkun","family":"Lin","sequence":"additional","affiliation":[{"name":"SeedMath Technology Limited, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3473-9703","authenticated-orcid":false,"given":"Chunming","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Software, Beihang University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,12,31]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/2993236.2993253","volume-title":"Proceedings of the GPCE 2016","author":"Al-Hajjaji Mustafa","year":"2016","unstructured":"Mustafa Al-Hajjaji, Sebastian Krieter, Thomas Th\u00fcm, Malte Lochau, and Gunter Saake. 2016. IncLing: Efficient product-line testing using incremental pairwise sampling. In Proceedings of the GPCE 2016. 144\u2013155."},{"issue":"1","key":"e_1_3_2_3_2","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/s10270-016-0569-2","article-title":"Effective product-line testing using similarity-based product prioritization","volume":"18","author":"Al-Hajjaji Mustafa","year":"2019","unstructured":"Mustafa Al-Hajjaji, Thomas Th\u00fcm, Malte Lochau, Jens Meinicke, and Gunter Saake. 2019. Effective product-line testing using similarity-based product prioritization. Software and Systems Modeling 18, 1 (2019), 499\u2013521.","journal-title":"Software and Systems Modeling"},{"key":"e_1_3_2_4_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-37521-7","volume-title":"Feature-Oriented Software Product Lines - Concepts and Implementation","author":"Apel Sven","year":"2013","unstructured":"Sven Apel, Don S. Batory, Christian K\u00e4stner, and Gunter Saake. 2013. Feature-Oriented Software Product Lines - Concepts and Implementation. Springer."},{"issue":"5","key":"e_1_3_2_5_2","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1109\/TSE.2011.85","article-title":"Formal analysis of the probability of interaction fault detection using random testing","volume":"38","author":"Arcuri Andrea","year":"2012","unstructured":"Andrea Arcuri and Lionel C. Briand. 2012. Formal analysis of the probability of interaction fault detection using random testing. IEEE Transactions on Software Engineering 38, 5 (2012), 1088\u20131099.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"e_1_3_2_6_2","first-page":"399","volume-title":"Proceedings of the IJCAI 2009","author":"Audemard Gilles","year":"2009","unstructured":"Gilles Audemard and Laurent Simon. 2009. Predicting learnt clauses quality in modern SAT solvers. In Proceedings of the IJCAI 2009, 399\u2013404."},{"key":"e_1_3_2_7_2","first-page":"87","volume-title":"Proceedings of the CASCON 2012","author":"Bagheri Ebrahim","year":"2012","unstructured":"Ebrahim Bagheri, Faezeh Ensan, and Dragan Gasevic. 2012. Grammar-based test generation for software product line feature models. In Proceedings of the CASCON 2012, 87\u2013101."},{"key":"e_1_3_2_8_2","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.artint.2015.01.002","article-title":"Overview and analysis of the SAT Challenge 2012 solver competition","volume":"223","author":"Balint Adrian","year":"2015","unstructured":"Adrian Balint, Anton Belov, Matti J\u00e4rvisalo, and Carsten Sinz. 2015. Overview and analysis of the SAT Challenge 2012 solver competition. Artificial Intelligence 223 (2015), 120\u2013155.","journal-title":"Artificial Intelligence"},{"key":"e_1_3_2_9_2","first-page":"112","volume-title":"Proceedings of the LPAR 2010","author":"Banbara Mutsunori","year":"2010","unstructured":"Mutsunori Banbara, Haruki Matsunaka, Naoyuki Tamura, and Katsumi Inoue. 2010. Generating combinatorial test cases by efficient SAT encodings suitable for CDCL SAT solvers. In Proceedings of the LPAR 2010. 112\u2013126."},{"key":"e_1_3_2_10_2","first-page":"46","volume-title":"Proceedings of the SPLC 2022","author":"Baranov Eduard","year":"2022","unstructured":"Eduard Baranov and Axel Legay. 2022. Baital: An adaptive weighted sampling platform for configurable systems. In Proceedings of the SPLC 2022. ACM, 46\u201349."},{"key":"e_1_3_2_11_2","first-page":"1114","volume-title":"Proceedings of the ESEC\/FSE 2020","author":"Baranov Eduard","year":"2020","unstructured":"Eduard Baranov, Axel Legay, and Kuldeep S. Meel. 2020. Baital: An adaptive weighted sampling approach for improved t-wise coverage. In Proceedings of the ESEC\/FSE 2020. 1114\u20131126."},{"key":"e_1_3_2_12_2","first-page":"7","volume-title":"Proceedings of the SPLC 2005","author":"Batory Don S.","year":"2005","unstructured":"Don S. Batory. 2005. Feature models, grammars, and propositional formulas. In Proceedings of the SPLC 2005. 7\u201320."},{"key":"e_1_3_2_13_2","first-page":"2","article-title":"The Sat4j library, release 2.2","volume":"7","author":"Berre Daniel Le","year":"2010","unstructured":"Daniel Le Berre and Anne Parrain. 2010. The Sat4j library, release 2.2. Journal on Satisfiability, Boolean Modeling and Computation 7, 2\u20133 (2010), 59\u20136.","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"e_1_3_2_14_2","doi-asserted-by":"crossref","DOI":"10.3233\/FAIA336","volume-title":"Handbook of Satisfiability","author":"Biere Armin","year":"2021","unstructured":"Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh (Eds.). 2021. Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, Vol. 336. IOS Press."},{"issue":"3","key":"e_1_3_2_15_2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/stvr.365","article-title":"The density algorithm for pairwise interaction testing","volume":"17","author":"Bryce Ren\u00e9e C.","year":"2007","unstructured":"Ren\u00e9e C. Bryce and Charles J. Colbourn. 2007. The density algorithm for pairwise interaction testing. Software Testing, Verification and Reliability 17, 3 (2007), 159\u2013182.","journal-title":"Software Testing, Verification and Reliability"},{"issue":"1","key":"e_1_3_2_16_2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/stvr.393","article-title":"A density-based greedy algorithm for higher strength covering arrays","volume":"19","author":"Bryce Ren\u00e9e C.","year":"2009","unstructured":"Ren\u00e9e C. Bryce and Charles J. Colbourn. 2009. A density-based greedy algorithm for higher strength covering arrays. Software Testing, Verification and Reliability 19, 1 (2009), 37\u201353.","journal-title":"Software Testing, Verification and Reliability"},{"key":"e_1_3_2_17_2","first-page":"146","volume-title":"Proceedings of the ICSE 2005","author":"Bryce Ren\u00e9e C.","year":"2005","unstructured":"Ren\u00e9e C. Bryce, Charles J. Colbourn, and Myra B. Cohen. 2005. A framework of greedy methods for constructing interaction test suites. In Proceedings of the ICSE 2005, 146\u2013155."},{"key":"e_1_3_2_18_2","first-page":"227","volume-title":"Proceedings of the CAV 2022","author":"Cai Shaowei","year":"2022","unstructured":"Shaowei Cai, Bohan Li, and Xindi Zhang. 2022. Local search for SMT on linear integer arithmetic. In Proceedings of the CAV 2022, 227\u2013248."},{"key":"e_1_3_2_19_2","first-page":"11","article-title":"Improving WalkSAT by effective tie-breaking and efficient implementation","volume":"58","author":"Cai Shaowei","year":"2015","unstructured":"Shaowei Cai, Chuan Luo, and Kaile Su. 2015. Improving WalkSAT by effective tie-breaking and efficient implementation. The Computer Journal 58, 11 (2015), 2864\u20132875.","journal-title":"The Computer Journal"},{"key":"e_1_3_2_20_2","first-page":"5:1","volume-title":"Proceedings of the CP 2021","author":"Cai Shaowei","year":"2021","unstructured":"Shaowei Cai, Chuan Luo, Xindi Zhang, and Jian Zhang. 2021. Improving local search for structured SAT formulas via unit propagation based construct and cut initialization. In Proceedings of the CP 2021, 5:1\u20135:10."},{"key":"e_1_3_2_21_2","first-page":"64","volume-title":"Proceedings of the SAT 2021","author":"Cai Shaowei","year":"2021","unstructured":"Shaowei Cai and Xindi Zhang. 2021. Deep cooperation of CDCL and local search for SAT. In Proceedings of the SAT 2021, 64\u201381."},{"key":"e_1_3_2_22_2","first-page":"235","volume-title":"Proceedings of the ESEC\/FSE 2019","author":"Cha Sooyoung","year":"2019","unstructured":"Sooyoung Cha and Hakjoo Oh. 2019. Concolic testing with adaptively changing search heuristics. In Proceedings of the ESEC\/FSE 2019, 235\u2013245."},{"key":"e_1_3_2_23_2","first-page":"304","volume-title":"Proceedings of the TACAS 2015","author":"Chakraborty Supratik","year":"2015","unstructured":"Supratik Chakraborty, Daniel J. Fremont, Kuldeep S. Meel, Sanjit A. Seshia, and Moshe Y. Vardi. 2015. On parallel scalable uniform SAT witness generation. In Proceedings of the TACAS 2015, 304\u2013319."},{"key":"e_1_3_2_24_2","doi-asserted-by":"crossref","first-page":"103819","DOI":"10.1016\/j.artint.2022.103819","article-title":"Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism","volume":"314","author":"Chen Jiejiang","year":"2023","unstructured":"Jiejiang Chen, Shaowei Cai, Yiyuan Wang, Wenhao Xu, Jia Ji, and Minghao Yin. 2023. Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism. Artificial Intelligence 314 (2023), 103819.","journal-title":"Artificial Intelligence"},{"key":"e_1_3_2_25_2","first-page":"3915","volume-title":"Proceedings of the AAAI 2023","author":"Chu Yi","year":"2023","unstructured":"Yi Chu, Shaowei Cai, and Chuan Luo. 2023a. NuWLS: improving local search for (weighted) partial MaxSAT by new weighting techniques. In Proceedings of the AAAI 2023, 3915\u20133923."},{"key":"e_1_3_2_26_2","first-page":"12:1","volume-title":"Proceedings of the CP 2023","author":"Chu Yi","year":"2023","unstructured":"Yi Chu, Shaowei Cai, Chuan Luo, Zhendong Lei, and Cong Peng. 2023b. Towards more efficient local search for pseudo-boolean optimization. In Proceedings of the CP 2023, 12:1\u201312:18."},{"issue":"7","key":"e_1_3_2_27_2","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1109\/32.605761","article-title":"The AETG System: An approach to testing based on combinatiorial design","volume":"23","author":"Cohen David M.","year":"1997","unstructured":"David M. Cohen, Siddhartha R. Dalal, Michael L. Fredman, and Gardner C. Patton. 1997. The AETG System: An approach to testing based on combinatiorial design. IEEE Transactions on Software Engineering 23, 7 (1997), 437\u2013444.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"e_1_3_2_28_2","first-page":"394","volume-title":"Proceedings of the ISSRE 2003","author":"Cohen Myra B.","year":"2003","unstructured":"Myra B. Cohen, Charles J. Colbourn, and Alan C. H. Ling. 2003a. Augmenting simulated annealing to build interaction test suites. In Proceedings of the ISSRE 2003, 394\u2013405."},{"key":"e_1_3_2_29_2","first-page":"129","volume-title":"Proceedings of the ISSTA 2007","author":"Cohen Myra B.","year":"2007","unstructured":"Myra B. Cohen, Matthew B. Dwyer, and Jiangfan Shi. 2007. Interaction testing of highly-configurable systems in the presence of constraints. In Proceedings of the ISSTA 2007, 129\u2013139."},{"key":"e_1_3_2_30_2","first-page":"38","volume-title":"Proceedings ICSE 2003","author":"Cohen Myra B.","year":"2003","unstructured":"Myra B. Cohen, Peter B. Gibbons, Warwick B. Mugridge, and Charles J. Colbourn. 2003b. Constructing Test Suites for Interaction Testing. In Proceedings ICSE 2003, 38\u201348."},{"key":"e_1_3_2_31_2","first-page":"413","volume-title":"Proceedings of the COMPAC 2003","author":"Cohen Myra B.","year":"2003","unstructured":"Myra B. Cohen, Peter B. Gibbons, Warwick B. Mugridge, Charles J. Colbourn, and James S. Collofello. 2003c. A variable strength interaction testing of components. In Proceedings of the COMPAC 2003, 413\u2013418."},{"issue":"1","key":"e_1_3_2_32_2","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ipl.2008.03.017","article-title":"The generalized maximum coverage problem","volume":"108","author":"Cohen Reuven","year":"2008","unstructured":"Reuven Cohen and Liran Katzir. 2008. The generalized maximum coverage problem. Information Processing Letters 108, 1 (2008), 15\u201322.","journal-title":"Information Processing Letters"},{"key":"e_1_3_2_33_2","first-page":"151","volume-title":"Proceedings of the STOC 1971","author":"Cook Stephen A.","year":"1971","unstructured":"Stephen A. Cook. 1971. The complexity of theorem-proving procedures. In Proceedings of the STOC 1971, 151\u2013158."},{"key":"e_1_3_2_34_2","unstructured":"Adnan Darwiche and Knot Pipatsrisawat. 2021. Complete algorithms. In Handbook of Satisfiability. Armin Biere Marijn Heule Hans van Maaren and Toby Walsh (Eds.) IOS Press 101\u2013132. Retrieved from https:\/\/dblp.uni-trier.de\/rec\/series\/faia\/DarwicheP21.html?view=bibtex."},{"key":"e_1_3_2_35_2","first-page":"549","volume-title":"Proceedings of the ICSE 2018","author":"Dutra Rafael","year":"2018","unstructured":"Rafael Dutra, Kevin Laeufer, Jonathan Bachrach, and Koushik Sen. 2018. Efficient sampling of SAT solutions for testing. In Proceedings of the ICSE 2018, 549\u2013559."},{"key":"e_1_3_2_36_2","first-page":"502","volume-title":"Proceedings of the SAT 2003","author":"E\u00e9n Niklas","year":"2003","unstructured":"Niklas E\u00e9n and Niklas S\u00f6rensson. 2003. An extensible SAT-solver. In Proceedings of the SAT 2003, 502\u2013518."},{"key":"e_1_3_2_37_2","first-page":"613","volume-title":"Proceedings of the CAiSE 2012","author":"Ensan Faezeh","year":"2012","unstructured":"Faezeh Ensan, Ebrahim Bagheri, and Dragan Gasevic. 2012. Evolutionary search-based test generation for software product line feature models. In Proceedings of the CAiSE 2012, 613\u2013628."},{"key":"e_1_3_2_38_2","doi-asserted-by":"crossref","first-page":"106288","DOI":"10.1016\/j.infsof.2020.106288","article-title":"WCA: A weighting local search for constrained combinatorial test optimization","volume":"122","author":"Fu Yingjie","year":"2020","unstructured":"Yingjie Fu, Zhendong Lei, Shaowei Cai, Jinkun Lin, and Haoran Wang. 2020. WCA: A weighting local search for constrained combinatorial test optimization. Information and Software Technology 122 (2020), 106288.","journal-title":"Information and Software Technology"},{"key":"e_1_3_2_39_2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/SSBSE.2009.25","volume-title":"Proceedings of the International Symposium on Search Based Software Engineering 2009","author":"Garvin Brady J.","year":"2009","unstructured":"Brady J. Garvin, Myra B. Cohen, and Matthew B. Dwyer. 2009. An improved meta-heuristic search for constrained interaction testing. In Proceedings of the International Symposium on Search Based Software Engineering 2009, 13\u201322."},{"issue":"1","key":"e_1_3_2_40_2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10664-010-9135-7","article-title":"Evaluating improvements to a meta-heuristic search for constrained interaction testing","volume":"16","author":"Garvin Brady J.","year":"2011","unstructured":"Brady J. Garvin, Myra B. Cohen, and Matthew B. Dwyer. 2011. Evaluating improvements to a meta-heuristic search for constrained interaction testing. Empirical Software Engineering 16, 1 (2011), 61\u2013102.","journal-title":"Empirical Software Engineering"},{"key":"e_1_3_2_41_2","first-page":"1420","volume-title":"Proceedings of the CEC 2003","author":"Ghazi Syed A.","year":"2003","unstructured":"Syed A. Ghazi and Moataz A. Ahmed. 2003. Pair-wise test coverage using genetic algorithms. In Proceedings of the CEC 2003, 1420\u20131424."},{"key":"e_1_3_2_42_2","first-page":"222","volume-title":"Proceedings of the FMCAD 2021","author":"Golia Priyanka","year":"2021","unstructured":"Priyanka Golia, Mate Soos, Sourav Chakraborty, and Kuldeep S. Meel. 2021. Designing samplers is easy: The boon of testers. In Proceedings of the FMCAD 2021, 222\u2013230."},{"key":"e_1_3_2_43_2","first-page":"51","volume-title":"Proceedings of the COCOA 2010","author":"Gonzalez-Hernandez Loreto","year":"2010","unstructured":"Loreto Gonzalez-Hernandez, Nelson Rangel-Valdez, and Jose Torres-Jimenez. 2010. Construction of mixed covering arrays of variable strength using a Tabu search approach. In Proceedings of the COCOA 2010, 51\u201364."},{"issue":"3","key":"e_1_3_2_44_2","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/stvr.319","article-title":"Combination testing strategies: A survey","volume":"15","author":"Grindal Mats","year":"2005","unstructured":"Mats Grindal, Jeff Offutt, and Sten F. Andler. 2005. Combination testing strategies: A survey. Software Testing, Verification & Reliability 15, 3 (2005), 167\u2013199.","journal-title":"Software Testing, Verification & Reliability"},{"key":"e_1_3_2_45_2","first-page":"292","volume-title":"Proceedings of the ESEC\/FSE 2020","author":"Gu Jiazhen","year":"2020","unstructured":"Jiazhen Gu, Chuan Luo, Si Qin, Bo Qiao, Qingwei Lin, Hongyu Zhang, Ze Li, Yingnong Dang, Shaowei Cai, Wei Wu, Yangfan Zhou, Murali Chintalapati, and Dongmei Zhang. 2020. Efficient incident identification from multi-dimensional issue reports via meta-heuristic search. In Proceedings of the ESEC\/FSE 2020, 292\u2013303."},{"issue":"4","key":"e_1_3_2_46_2","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/MC.2015.114","article-title":"Introducing combinatorial testing in a large organization","volume":"48","author":"Hagar Jon D.","year":"2015","unstructured":"Jon D. Hagar, Thomas L. Wissink, D. Richard Kuhn, and Raghu Kacker. 2015. Introducing combinatorial testing in a large organization. Computer 48, 4 (2015), 64\u201372.","journal-title":"Computer"},{"issue":"2","key":"e_1_3_2_47_2","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1109\/TSE.2009.71","article-title":"A theoretical and empirical study of search-based testing: Local, global, and hybrid search","volume":"36","author":"Harman Mark","year":"2010","unstructured":"Mark Harman and Phil McMinn. 2010. A theoretical and empirical study of search-based testing: Local, global, and hybrid search. IEEE Transactions on Software Engineering 36, 2 (2010), 226\u2013247.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"e_1_3_2_48_2","first-page":"517","volume-title":"Proceedings of the ICSE 2015","author":"Henard Christopher","year":"2015","unstructured":"Christopher Henard, Mike Papadakis, Mark Harman, and Yves Le Traon. 2015b. Combining multi-objective search and constraint solving for configuring large software product lines. In Proceedings of the ICSE 2015, 517\u2013528."},{"issue":"7","key":"e_1_3_2_49_2","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1109\/TSE.2014.2327020","article-title":"Bypassing the combinatorial explosion: Using similarity to generate and prioritize t-wise test configurations for software product lines","volume":"40","author":"Henard Christopher","year":"2014","unstructured":"Christopher Henard, Mike Papadakis, Gilles Perrouin, Jacques Klein, Patrick Heymans, and Yves Le Traon. 2014. Bypassing the combinatorial explosion: Using similarity to generate and prioritize t-wise test configurations for software product lines. IEEE Transactions on Software Engineering 40, 7 (2014), 650\u2013670.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"e_1_3_2_50_2","first-page":"1","volume-title":"Proceedings of the ICST 2015 Workshops","author":"Henard Christopher","year":"2015","unstructured":"Christopher Henard, Mike Papadakis, and Yves Le Traon. 2015a. Flattening or not of the combinatorial interaction testing models?. In Proceedings of the ICST 2015 Workshops, 1\u20134."},{"key":"e_1_3_2_51_2","first-page":"17:1","volume-title":"Proceedings of the SPLC 2020","author":"Heradio Ruben","year":"2020","unstructured":"Ruben Heradio, David Fern\u00e1ndez-Amor\u00f3s, Jos\u00e9 A. Galindo, and David Benavides. 2020. Uniform and scalable SAT-sampling for configurable systems. In Proceedings of the SPLC 2020, 17:1\u201317:11."},{"key":"e_1_3_2_52_2","first-page":"2","article-title":"Constraint models for the covering test problem","volume":"11","author":"Hnich Brahim","year":"2006","unstructured":"Brahim Hnich, Steven David Prestwich, Evgeny Selensky, and Barbara M. Smith. 2006. Constraint models for the covering test problem. Constraints 11, 2\u20133 (2006), 199\u2013219.","journal-title":"Constraints"},{"issue":"2","key":"e_1_3_2_53_2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1287\/opre.42.2.201","article-title":"Needed: An empirical science of algorithms","volume":"42","author":"Hooker John N.","year":"1994","unstructured":"John N. Hooker. 1994. Needed: An empirical science of algorithms. Operations Research 42, 2 (1994), 201\u2013212.","journal-title":"Operations Research"},{"key":"e_1_3_2_54_2","first-page":"289","volume-title":"Proceedings of the KI 1999","author":"Hoos Holger H.","year":"1999","unstructured":"Holger H. Hoos and Thomas St\u00fctzle. 1999. Systematic vs. local search for SAT. In Proceedings of the KI 1999, 289\u2013293."},{"issue":"4","key":"e_1_3_2_55_2","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1023\/A:1006350622830","article-title":"Local search algorithms for SAT: An empirical evaluation","volume":"24","author":"Hoos Holger H.","year":"2000","unstructured":"Holger H. Hoos and Thomas St\u00fctzle. 2000. Local search algorithms for SAT: An empirical evaluation. Journal of Automated Reasoning 24, 4 (2000), 421\u2013481.","journal-title":"Journal of Automated Reasoning"},{"key":"e_1_3_2_56_2","volume-title":"Stochastic Local Search: Foundations & Applications","author":"Hoos Holger H.","year":"2004","unstructured":"Holger H. Hoos and Thomas St\u00fctzle. 2004. Stochastic Local Search: Foundations & Applications. Elsevier\/Morgan Kaufmann."},{"key":"e_1_3_2_57_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artint.2016.09.006","article-title":"The configurable SAT solver challenge (CSSC)","volume":"243","author":"Hutter Frank","year":"2017","unstructured":"Frank Hutter, Marius Lindauer, Adrian Balint, Sam Bayless, Holger H. Hoos, and Kevin Leyton-Brown. 2017. The configurable SAT solver challenge (CSSC). Artificial Intelligence 243 (2017), 1\u201325.","journal-title":"Artificial Intelligence"},{"key":"e_1_3_2_58_2","first-page":"540","volume-title":"Proceedings of the ICSE 2015","author":"Jia Yue","year":"2015","unstructured":"Yue Jia, Myra B. Cohen, Mark Harman, and Justyna Petke. 2015. learning combinatorial interaction test generation strategies using hyperheuristic search. In Proceedings of the ICSE 2015, 540\u2013550."},{"key":"e_1_3_2_59_2","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/2362536.2362547","volume-title":"Proceedings of the 16th International Software Product Line Conference - Volume 1 (SPLC \u201912)","author":"Johansen Martin Fagereng","year":"2012","unstructured":"Martin Fagereng Johansen, \u00d8ystein Haugen, and Franck Fleurey. 2012a. An algorithm for generating t-wise covering arrays from large feature models. In Proceedings of the 16th International Software Product Line Conference - Volume 1 (SPLC \u201912). ACM, New York, NY, 46\u201355."},{"key":"e_1_3_2_60_2","first-page":"269","volume-title":"Proceedings of the MODELS 2012","author":"Johansen Martin Fagereng","year":"2012","unstructured":"Martin Fagereng Johansen, \u00d8ystein Haugen, Franck Fleurey, Anne Grete Eldegard, and Torbj\u00f8rn Syversen. 2012b. Generating better partial covering arrays by modeling weights on sub-product lines. In Proceedings of the MODELS 2012, 269\u2013284."},{"key":"e_1_3_2_61_2","first-page":"1084","volume-title":"Proceedings of the ICSE 2019","author":"Kaltenecker Christian","year":"2019","unstructured":"Christian Kaltenecker, Alexander Grebhahn, Norbert Siegmund, Jianmei Guo, and Sven Apel. 2019. Distance-based sampling of software configuration spaces. In Proceedings of the ICSE 2019, 1084\u20131094."},{"key":"e_1_3_2_62_2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Proceedings of the Complexity of Computer Computations 1972","author":"Karp Richard M.","year":"1972","unstructured":"Richard M. Karp. 1972. Reducibility among combinatorial problems. In Proceedings of the Complexity of Computer Computations 1972, 85\u2013103."},{"key":"e_1_3_2_63_2","unstructured":"Henry Kautz Ashish Sabharwal and Bart Selman. 2021. Incomplete algorithms. In Handbook of Satisfiability. Armin Biere Marijn Heule Hans van Maaren and Toby Walsh (Eds.) IOS Press 185\u2013203. Retrieved from https:\/\/dblp.uni-trier.de\/rec\/series\/faia\/KautzSS21.html?view=bibtex."},{"issue":"1","key":"e_1_3_2_64_2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","article-title":"The budgeted maximum coverage problem","volume":"70","author":"Khuller Samir","year":"1999","unstructured":"Samir Khuller, Anna Moss, and Joseph Naor. 1999. The budgeted maximum coverage problem. Information Processing Letters 70, 1 (1999), 39\u201345.","journal-title":"Information Processing Letters"},{"key":"e_1_3_2_65_2","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/3106237.3106252","volume-title":"Proceedings of the ESEC\/FSE 2017","author":"Kn\u00fcppel Alexander","year":"2017","unstructured":"Alexander Kn\u00fcppel, Thomas Th\u00fcm, Stephan Mennicke, Jens Meinicke, and Ina Schaefer. 2017. Is there a mismatch between real-world feature models and product-line research?. In Proceedings of the ESEC\/FSE 2017, 291\u2013302."},{"key":"e_1_3_2_66_2","first-page":"29:1","volume-title":"Proceedings of the SPLC 2020","author":"Krieter Sebastian","year":"2020","unstructured":"Sebastian Krieter. 2020. Large-scale T-wise interaction sampling using YASA. In Proceedings of the SPLC 2020, 29:1\u201329:4."},{"key":"e_1_3_2_67_2","first-page":"4:1","volume-title":"Proceedings of the VaMoS 2020","author":"Krieter Sebastian","year":"2020","unstructured":"Sebastian Krieter, Thomas Th\u00fcm, Sandro Schulze, Gunter Saake, and Thomas Leich. 2020. YASA: Yet another sampling algorithm. In Proceedings of the VaMoS 2020, 4:1\u20134:10."},{"key":"e_1_3_2_68_2","volume-title":"Introduction to Combinatorial Testing","author":"Kuhn D. Richard","year":"2013","unstructured":"D. Richard Kuhn, Raghu N. Kacker, and Yu Lei. 2013. Introduction to Combinatorial Testing. CRC press."},{"issue":"6","key":"e_1_3_2_69_2","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1109\/TSE.2004.24","article-title":"Software fault interactions and implications for software testing","volume":"30","author":"Kuhn D. Richard","year":"2004","unstructured":"D. Richard Kuhn, Dolores R. Wallace, and Albert M. Gallo. 2004. Software fault interactions and implications for software testing. IEEE Transactions on Software Engineering 30, 6 (2004), 418\u2013421.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"e_1_3_2_70_2","first-page":"549","volume-title":"Proceedings of the ECBS 2007","author":"Lei Yu","year":"2007","unstructured":"Yu Lei, Raghu Kacker, D. Richard Kuhn, Vadim Okun, and James Lawrence. 2007. IPOG: A general strategy for t-way software testing. In Proceedings of the ECBS 2007, 549\u2013556."},{"issue":"3","key":"e_1_3_2_71_2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/stvr.381","article-title":"IPOG\/IPOG-D: Efficient test generation for multi-way combinatorial testing","volume":"18","author":"Lei Yu","year":"2008","unstructured":"Yu Lei, Raghu Kacker, D. Richard Kuhn, Vadim Okun, and James Lawrence. 2008. IPOG\/IPOG-D: Efficient test generation for multi-way combinatorial testing. Software Testing, Verification and Reliability 18, 3 (2008), 125\u2013148.","journal-title":"Software Testing, Verification and Reliability"},{"key":"e_1_3_2_72_2","first-page":"254","volume-title":"Proceedings of the HASE 1998","author":"Lei Yu","year":"1998","unstructured":"Yu Lei and Kuo-Chung Tai. 1998. In-parameter-order: A test generation strategy for pairwise testing. In Proceedings of the HASE 1998, 254\u2013261."},{"key":"e_1_3_2_73_2","first-page":"332","volume-title":"Proceedings of the SAT 2021","author":"Lei Zhendong","year":"2021","unstructured":"Zhendong Lei, Shaowei Cai, Chuan Luo, and Holger H. Hoos. 2021. Efficient local search for pseudo boolean optimization. In Proceedings of the SAT 2021, 332\u2013348."},{"key":"e_1_3_2_74_2","first-page":"91","volume-title":"Proceedings of the SPLC 2015","author":"Liang Jia Hui","year":"2015","unstructured":"Jia Hui Liang, Vijay Ganesh, Krzysztof Czarnecki, and Venkatesh Raman. 2015. SAT-based analysis of large real-world feature models is easy. In Proceedings of the SPLC 2015, 91\u2013100."},{"key":"e_1_3_2_75_2","first-page":"123","volume-title":"Proceedings of the SAT 2016","author":"Liang Jia Hui","year":"2016","unstructured":"Jia Hui Liang, Vijay Ganesh, Pascal Poupart, and Krzysztof Czarnecki. 2016. Learning rate based branching heuristic for SAT solvers. In Proceedings of the SAT 2016, 123\u2013140."},{"key":"e_1_3_2_76_2","first-page":"77","volume-title":"Proceedings of the ICSE Companion 2021","author":"Lin Jinkun","year":"2021","unstructured":"Jinkun Lin, Shaowei Cai, Bing He, Yingjie Fu, Chuan Luo, and Qingwei Lin. 2021. FastCA: An effective and efficient tool for combinatorial covering array generation. In Proceedings of the ICSE Companion 2021, 77\u201380."},{"key":"e_1_3_2_77_2","first-page":"212","volume-title":"Proceedings of the ESEC\/FSE 2019","author":"Lin Jinkun","year":"2019","unstructured":"Jinkun Lin, Shaowei Cai, Chuan Luo, Qingwei Lin, and Hongyu Zhang. 2019. Towards more efficient meta-heuristic algorithms for combinatorial test generation. In Proceedings of the ESEC\/FSE 2019, 212\u2013222."},{"key":"e_1_3_2_78_2","first-page":"494","volume-title":"Proceedings of the ASE 2015","author":"Lin Jinkun","year":"2015","unstructured":"Jinkun Lin, Chuan Luo, Shaowei Cai, Kaile Su, Dan Hao, and Lu Zhang. 2015. TCA: An efficient two-mode meta-heuristic algorithm for combinatorial test generation. In Proceedings of the ASE 2015, 494\u2013505."},{"key":"e_1_3_2_79_2","first-page":"404","volume-title":"Proceedings of the ICSM 2013","author":"Lopez-Herrejon Roberto E.","year":"2013","unstructured":"Roberto E. Lopez-Herrejon, Francisco Chicano, Javier Ferrer, Alexander Egyed, and Enrique Alba. 2013. Multi-objective optimal test suite computation for software product line pairwise testing. In Proceedings of the ICSM 2013, 404\u2013407."},{"key":"e_1_3_2_80_2","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.artint.2016.11.001","article-title":"CCEHC: An efficient local search algorithm for weighted partial maximum satisfiability","volume":"243","author":"Luo Chuan","year":"2017","unstructured":"Chuan Luo, Shaowei Cai, Kaile Su, and Wenxuan Huang. 2017. CCEHC: An efficient local search algorithm for weighted partial maximum satisfiability. Artificial Intelligence 243 (2017), 26\u201344.","journal-title":"Artificial Intelligence"},{"issue":"5","key":"e_1_3_2_81_2","doi-asserted-by":"crossref","first-page":"1014","DOI":"10.1109\/TCYB.2014.2343242","article-title":"Clause states based configuration checking in local search for satisfiability","volume":"45","author":"Luo Chuan","year":"2015","unstructured":"Chuan Luo, Shaowei Cai, Kaile Su, and Wei Wu. 2015a. Clause states based configuration checking in local search for satisfiability. IEEE Transactions on Cybernetics 45, 5 (2015), 1014\u20131027.","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"7","key":"e_1_3_2_82_2","doi-asserted-by":"crossref","first-page":"1830","DOI":"10.1109\/TC.2014.2346196","article-title":"CCLS: An efficient local search algorithm for weighted maximum satisfiability","volume":"64","author":"Luo Chuan","year":"2015","unstructured":"Chuan Luo, Shaowei Cai, Wei Wu, Zhong Jie, and Kaile Su. 2015b. CCLS: An efficient local search algorithm for weighted maximum satisfiability. IEEE Transactions on Computers 64, 7 (2015), 1830\u20131843.","journal-title":"IEEE Transactions on Computers"},{"key":"e_1_3_2_83_2","first-page":"481","volume-title":"Proceedings of the CP 2013","author":"Luo Chuan","year":"2013","unstructured":"Chuan Luo, Shaowei Cai, Wei Wu, and Kaile Su. 2013. Focused random walk with configuration checking and break minimum for satisfiability. In Proceedings of the CP 2013, 481\u2013496."},{"key":"e_1_3_2_84_2","first-page":"2703","volume-title":"Proceedings of the AAAI 2014","author":"Luo Chuan","year":"2014","unstructured":"Chuan Luo, Shaowei Cai, Wei Wu, and Kaile Su. 2014a. Double configuration checking in stochastic local search for satisfiability. In Proceedings of the AAAI 2014, 2703\u20132709."},{"key":"e_1_3_2_85_2","first-page":"373","volume-title":"Proceedings of the PPSN 2020","author":"Luo Chuan","year":"2020","unstructured":"Chuan Luo, Holger H. Hoos, and Shaowei Cai. 2020a. PbO-CCSAT: Boosting local search for satisfiability using programming by optimisation. In Proceedings of the PPSN 2020, 373\u2013389."},{"key":"e_1_3_2_86_2","first-page":"1297","volume-title":"Proceedings of the IJCAI 2019","author":"Luo Chuan","year":"2019","unstructured":"Chuan Luo, Holger H. Hoos, Shaowei Cai, Qingwei Lin, Hongyu Zhang, and Dongmei Zhang. 2019. Local search with efficient automatic configuration for minimum vertex cover. In Proceedings of the IJCAI 2019, 1297\u20131304."},{"key":"e_1_3_2_87_2","first-page":"201","volume-title":"Proceedings of the ICSE 2021","author":"Luo Chuan","year":"2021","unstructured":"Chuan Luo, Jinkun Lin, Shaowei Cai, Xin Chen, Bing He, Bo Qiao, Pu Zhao, Qingwei Lin, Hongyu Zhang, Wei Wu, Saravanakumar Rajmohan, and Dongmei Zhang. 2021a. AutoCCAG: An automated approach to constrained covering array generation. In Proceedings of the ICSE 2021, 201\u2013212."},{"key":"e_1_3_2_88_2","volume-title":"Proceedings of the ISSTA 2024","author":"Luo Chuan","year":"2024","unstructured":"Chuan Luo, Shuangyu Lyu, Qiyuan Zhao, Wei Wu, Hongyu Zhang, and Chunming Hu. 2024a. Beyond pairwise testing: Advancing 3-wise combinatorial interaction testing for highly configurable systems. In Proceedings of the ISSTA 2024."},{"key":"e_1_3_2_89_2","first-page":"1495","volume-title":"Proceedings of the IJCAI 2020","author":"Luo Chuan","year":"2020","unstructured":"Chuan Luo, Bo Qiao, Xin Chen, Pu Zhao, Randolph Yao, Hongyu Zhang, Wei Wu, Andrew Zhou, and Qingwei Lin. 2020b. Intelligent virtual machine provisioning in cloud computing. In Proceedings of the IJCAI 2020, 1495\u20131502."},{"key":"e_1_3_2_90_2","first-page":"12363","volume-title":"Proceedings of the AAAI 2021","author":"Luo Chuan","year":"2021","unstructured":"Chuan Luo, Bo Qiao, Wenqian Xing, Xin Chen, Pu Zhao, Chao Du, Randolph Yao, Hongyu Zhang, Wei Wu, Shaowei Cai, Bing He, Saravanakumar Rajmohan, and Qingwei Lin. 2021b. Correlation-aware heuristic search for intelligent virtual machine provisioning in cloud systems. In Proceedings of the AAAI 2021, 12363\u201312372."},{"key":"e_1_3_2_91_2","first-page":"570","volume-title":"Proceedings of the ECAI 2012","author":"Luo Chuan","year":"2012","unstructured":"Chuan Luo, Kaile Su, and Shaowei Cai. 2012. Improving local search for random 3-SAT using quantitative configuration checking. In Proceedings of the ECAI 2012, 570\u2013575."},{"issue":"3","key":"e_1_3_2_92_2","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1007\/s10489-014-0556-7","article-title":"More efficient two-mode stochastic local search for random 3-satisfiability","volume":"41","author":"Luo Chuan","year":"2014","unstructured":"Chuan Luo, Kaile Su, and Shaowei Cai. 2014b. More efficient two-mode stochastic local search for random 3-satisfiability. Applied Intelligence 41, 3 (2014), 665\u2013680.","journal-title":"Applied Intelligence"},{"key":"e_1_3_2_93_2","first-page":"1081","volume-title":"Proceedings of the ESEC\/FSE 2021","author":"Luo Chuan","year":"2021","unstructured":"Chuan Luo, Binqi Sun, Bo Qiao, Junjie Chen, Hongyu Zhang, Jinkun Lin, Qingwei Lin, and Dongmei Zhang. 2021c. LS-Sampling: An effective local search based sampling approach for achieving high t-wise coverage. In Proceedings of the ESEC\/FSE 2021, 1081\u20131092."},{"issue":"3","key":"e_1_3_2_94_2","doi-asserted-by":"crossref","first-page":"1403","DOI":"10.1109\/TCYB.2022.3199147","article-title":"NuSC: An effective local search algorithm for solving the set covering problem","volume":"54","author":"Luo Chuan","year":"2024","unstructured":"Chuan Luo, Wenqian Xing, Shaowei Cai, and Chunming Hu. 2024b. NuSC: An effective local search algorithm for solving the set covering problem. IEEE Transactions on Cybernetics 54, 3 (2024), 1403\u20131416.","journal-title":"IEEE Transactions on Cybernetics"},{"key":"e_1_3_2_95_2","first-page":"1185","volume-title":"Proceedings of the ESEC\/FSE 2022","author":"Luo Chuan","year":"2022","unstructured":"Chuan Luo, Qiyuan Zhao, Shaowei Cai, Hongyu Zhang, and Chunming Hu. 2022. SamplingCA: Effective and efficient sampling-based pairwise testing for highly configurable software systems. In Proceedings of the ESEC\/FSE 2022, 1185\u20131197."},{"key":"e_1_3_2_96_2","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/S1571-0653(04)00322-1","article-title":"Stochastic systematic search algorithms for satisfiability","volume":"9","author":"Lynce In\u00eas","year":"2001","unstructured":"In\u00eas Lynce, Lu\u00eds Baptista, and Jo\u00e3o Marques-Silva. 2001. Stochastic systematic search algorithms for satisfiability. Electronic Notes in Discrete Mathematics 9 (2001), 190\u2013204.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"e_1_3_2_97_2","doi-asserted-by":"crossref","unstructured":"Jo\u00e3o Marques-Silva In\u00eas Lynce and Sharad Malik. 2021. Conflict-driven clause learning SAT solvers. In Handbook of Satisfiability. Armin Biere Marijn Heule Hans van Maaren and Toby Walsh (Eds.) IOS Press 133\u2013182. Retrieved from https:\/\/dblp.uni-trier.de\/rec\/series\/faia\/0001LM21.html?view=bibtex","DOI":"10.3233\/FAIA200987"},{"key":"e_1_3_2_98_2","first-page":"626","volume-title":"Proceedings of the COMPSAC 2009","author":"McCaffrey James D.","year":"2009","unstructured":"James D. McCaffrey. 2009. Generation of pairwise test sets using a genetic algorithm. In Proceedings of the COMPSAC 2009, 626\u2013631."},{"key":"e_1_3_2_99_2","first-page":"643","volume-title":"Proceedings of the ICSE 2016","author":"Medeiros Fl\u00e1vio","year":"2016","unstructured":"Fl\u00e1vio Medeiros, Christian K\u00e4stner, M\u00e1rcio Ribeiro, Rohit Gheyi, and Sven Apel. 2016. A comparison of 10 sampling algorithms for configurable systems. In Proceedings of the ICSE 2016, 643\u2013654."},{"key":"e_1_3_2_100_2","first-page":"231","volume-title":"Proceedings of the SPLC 2009","author":"Mendon\u00e7a Marc\u00edlio","year":"2009","unstructured":"Marc\u00edlio Mendon\u00e7a, Andrzej Wasowski, and Krzysztof Czarnecki. 2009. SAT-based analysis of feature models is easy. In Proceedings of the SPLC 2009, 231\u2013240."},{"key":"e_1_3_2_101_2","first-page":"12","article-title":"CHiP: A configurable hybrid parallel covering array constructor","volume":"45","author":"Mercan Hanefi","year":"2019","unstructured":"Hanefi Mercan, Cemal Yilmaz, and Kamer Kaya. 2019. CHiP: A configurable hybrid parallel covering array constructor. IEEE Transactions on Software Engineering 45, 12 (2019), 1270\u20131291.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"1","key":"e_1_3_2_102_2","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1142\/S1469026808002193","article-title":"Systematic versus local search and GA techniques for incremental SAT","volume":"7","author":"Mouhoub Malek","year":"2008","unstructured":"Malek Mouhoub. 2008. Systematic versus local search and GA techniques for incremental SAT. International Journal of Computational Intelligence and Applications 7, 1 (2008), 77\u201396.","journal-title":"International Journal of Computational Intelligence and Applications"},{"key":"e_1_3_2_103_2","first-page":"39:1","volume-title":"Proceedings of the SPLC 2019","author":"Munoz Daniel-Jesus","year":"2019","unstructured":"Daniel-Jesus Munoz, Jeho Oh, M\u00f3nica Pinto, Lidia Fuentes, and Don S. Batory. 2019. Uniform random sampling product configurations of feature models that have numerical features. In Proceedings of the SPLC 2019. 39:1\u201339:13."},{"issue":"2","key":"e_1_3_2_104_2","first-page":"11:1","article-title":"A survey of combinatorial testing","volume":"43","author":"Nie Changhai","year":"2011","unstructured":"Changhai Nie and Hareton Leung. 2011. A survey of combinatorial testing. Computing Surveys 43, 2 (2011), 11:1\u201311:29.","journal-title":"Computing Surveys"},{"key":"e_1_3_2_105_2","first-page":"61","volume-title":"Proceedings of the ESEC\/FSE 2017","author":"Oh Jeho","year":"2017","unstructured":"Jeho Oh, Don Batory, Margaret Myers, and Norbert Siegmund. 2017. Finding near-optimal configurations in product lines by random sampling. In Proceedings of the ESEC\/FSE 2017, 61\u201371."},{"key":"e_1_3_2_106_2","first-page":"15:1","volume-title":"Proceedings of the SPLC 2019","author":"Oh Jeho","year":"2019","unstructured":"Jeho Oh, Paul Gazzillo, and Don S. Batory. 2019. t-wise coverage by uniform sampling. In Proceedings of the SPLC 2019. 15:1\u201315:4."},{"key":"e_1_3_2_107_2","first-page":"1","volume-title":"Proceedings of the ICST 2014","author":"Papadakis Mike","year":"2014","unstructured":"Mike Papadakis, Christopher Henard, and Yves Le Traon. 2014. Sampling program inputs with mutation analysis: Going beyond combinatorial interaction testing. In Proceedings of the ICST 2014. 1\u201310."},{"key":"e_1_3_2_108_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-7997-1","volume-title":"Handbook of Combinatorial Optimization","author":"Pardalos Panos M.","year":"2013","unstructured":"Panos M. Pardalos, Ding-Zhu Du, and Ronald L. Graham (Eds.). 2013. Handbook of Combinatorial Optimization. Springer."},{"key":"e_1_3_2_109_2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.jss.2016.09.045","article-title":"Multi-objective test case prioritization in highly configurable systems: A case study","volume":"122","author":"Parejo Jos\u00e9 Antonio","year":"2016","unstructured":"Jos\u00e9 Antonio Parejo, Ana Bel\u00e9n S\u00e1nchez, Sergio Segura, Antonio Ruiz Cort\u00e9s, Roberto E. Lopez-Herrejon, and Alexander Egyed. 2016. Multi-objective test case prioritization in highly configurable systems: A case study. Journal of Systems and Software 122 (2016), 287\u2013310.","journal-title":"Journal of Systems and Software"},{"issue":"9","key":"e_1_3_2_110_2","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1109\/TSE.2015.2421279","article-title":"Practical combinatorial interaction testing: Empirical findings on efficiency and early fault detection","volume":"41","author":"Petke Justyna","year":"2015","unstructured":"Justyna Petke, Myra B. Cohen, Mark Harman, and Shin Yoo. 2015. Practical combinatorial interaction testing: Empirical findings on efficiency and early fault detection. IEEE Transactions on Software Engineering 41, 9 (2015), 901\u2013924.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"e_1_3_2_111_2","first-page":"14:1","volume-title":"Proceedings of the SPLC 2019","author":"Pett Tobias","year":"2019","unstructured":"Tobias Pett, Thomas Th\u00fcm, Tobias Runge, Sebastian Krieter, Malte Lochau, and Ina Schaefer. 2019. Product sampling for product lines: The scalability challenge. In Proceedings of the SPLC 2019, 14:1\u201314:6."},{"key":"e_1_3_2_112_2","first-page":"240","volume-title":"Proceedings of the ICST 2019","author":"Plazar Quentin","year":"2019","unstructured":"Quentin Plazar, Mathieu Acher, Gilles Perrouin, Xavier Devroey, and Maxime Cordy. 2019. Uniform sampling of SAT solutions for configurable systems: Are we there yet?. In Proceedings of the ICST 2019, 240\u2013251."},{"key":"e_1_3_2_113_2","first-page":"41","volume-title":"Proceedings of the ICST 2014","author":"S\u00e1nchez Ana Bel\u00e9n","year":"2014","unstructured":"Ana Bel\u00e9n S\u00e1nchez, Sergio Segura, and Antonio Ruiz Cort\u00e9s. 2014. A comparison of test case prioritization criteria for software product lines. In Proceedings of the ICST 2014, 41\u201350."},{"key":"e_1_3_2_114_2","first-page":"254","volume-title":"Proceedings of the ISSTA 2011","author":"Segall Itai","year":"2011","unstructured":"Itai Segall, Rachel Tzoref-Brill, and Eitan Farchi. 2011. Using binary decision diagrams for combinatorial test design. In Proceedings of the ISSTA 2011. 254\u2013264."},{"key":"e_1_3_2_115_2","first-page":"337","volume-title":"Proceedings of the AAAI 1994","author":"Selman Bart","year":"1994","unstructured":"Bart Selman, Henry A. Kautz, and Bram Cohen. 1994. Noise strategies for improving local search. In Proceedings of the AAAI 1994, 337\u2013343."},{"key":"e_1_3_2_116_2","first-page":"440","volume-title":"Proceedings of the AAAI 1992","author":"Selman Bart","year":"1992","unstructured":"Bart Selman, Hector J. Levesque, and David G. Mitchell. 1992. A new method for solving hard satisfiability problems. In Proceedings of the AAAI 1992, 440\u2013446."},{"key":"e_1_3_2_117_2","first-page":"303","volume-title":"Proceedings of the ICECCS 2005","author":"Sun Jing","year":"2005","unstructured":"Jing Sun, Hongyu Zhang, Yuan-Fang Li, and Hai H. Wang. 2005. Formal semantics and verification for feature modeling. In Proceedings of the ICECCS 2005, 303\u2013312."},{"issue":"3","key":"e_1_3_2_118_2","first-page":"15:1","article-title":"Computing alignments of well-formed process models using local search","volume":"29","author":"Taymouri Farbod","year":"2020","unstructured":"Farbod Taymouri and Josep Carmona. 2020. Computing alignments of well-formed process models using local search. ACM Transactions on Software Engineering and Methodology 29, 3 (2020), 15:1\u201315:41.","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"issue":"1","key":"e_1_3_2_119_2","first-page":"6:1","article-title":"A classification and survey of analysis strategies for software product lines","volume":"47","author":"Th\u00fcm Thomas","year":"2014","unstructured":"Thomas Th\u00fcm, Sven Apel, Christian K\u00e4stner, Ina Schaefer, and Gunter Saake. 2014. A classification and survey of analysis strategies for software product lines. Computing Surveys 47, 1 (2014), 6:1\u20136:45.","journal-title":"Computing Surveys"},{"key":"e_1_3_2_120_2","volume-title":"Systematic and local search algorithms for regular-SAT","author":"Torres Ram\u00f3n B\u00e9jar","year":"2000","unstructured":"Ram\u00f3n B\u00e9jar Torres. 2000. Systematic and local search algorithms for regular-SAT. Ph.D. Dissertation. Autonomous University of Barcelona, Spain."},{"key":"e_1_3_2_121_2","volume-title":"Systematic conformational search with constraint satisfaction","author":"Tucker-Kellogg Lisa","year":"2002","unstructured":"Lisa Tucker-Kellogg. 2002. Systematic conformational search with constraint satisfaction. Ph.D. Dissertation. Massachusetts Institute of Technology, Cambridge, MA."},{"key":"e_1_3_2_122_2","first-page":"431","volume-title":"Proceedings of the IEEE Aerospace Conference 2000","author":"Tung Yu-Wen","year":"2000","unstructured":"Yu-Wen Tung and Wafa S Aldiwan. 2000. Automating test case generation for the new generation mission software system. In Proceedings of the IEEE Aerospace Conference 2000, 431\u2013437."},{"key":"e_1_3_2_123_2","doi-asserted-by":"crossref","first-page":"106768","DOI":"10.1016\/j.infsof.2021.106768","article-title":"An adaptive penalty based parallel tabu search for constrained covering array generation","volume":"143","author":"Wang Yan","year":"2022","unstructured":"Yan Wang, Huayao Wu, Xintao Niu, Changhai Nie, and Jiaxi Xu. 2022. An adaptive penalty based parallel tabu search for constrained covering array generation. Information and Software Technology 143 (2022), 106768.","journal-title":"Information and Software Technology"},{"key":"e_1_3_2_124_2","first-page":"55","volume-title":"Proceedings of the SOQUA 2007","author":"Wang Ziyuan","year":"2007","unstructured":"Ziyuan Wang, Changhai Nie, and Baowen Xu. 2007. Generating combinatorial test suite for interaction relationship. In Proceedings of the SOQUA 2007, 55\u201361."},{"key":"e_1_3_2_125_2","first-page":"2395","volume-title":"Proceedings of the AAAI 2019","author":"Weise Thomas","year":"2019","unstructured":"Thomas Weise, Zijun Wu, and Markus Wagner. 2019. An improved generic bet-and-run strategy with performance prediction for stochastic local search. In Proceedings of the AAAI 2019, 2395\u20132402."},{"issue":"7","key":"e_1_3_2_126_2","doi-asserted-by":"crossref","first-page":"2317","DOI":"10.1109\/TSE.2021.3057853","article-title":"Looking for novelty in search-based software product line testing","volume":"48","author":"Xiang Yi","year":"2022","unstructured":"Yi Xiang, Han Huang, Miqing Li, Sizhe Li, and Xiaowei Yang. 2022a. Looking for novelty in search-based software product line testing. IEEE Transactions on Software Engineering 48, 7 (2022), 2317\u20132338.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"2","key":"e_1_3_2_127_2","doi-asserted-by":"crossref","first-page":"46:1","DOI":"10.1145\/3628158","article-title":"Automated test suite generation for software product lines based on quality-diversity optimization","volume":"33","author":"Xiang Yi","year":"2024","unstructured":"Yi Xiang, Han Huang, Sizhe Li, Miqing Li, Chuan Luo, and Xiaowei Yang. 2024. Automated test suite generation for software product lines based on quality-diversity optimization. ACM Transactions on Software Engineering and Methodology 33, 2 (2024), 46:1\u201346:52.","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"e_1_3_2_128_2","first-page":"1945","volume-title":"Proceedings of the ICSE 2022","author":"Xiang Yi","year":"2022","unstructured":"Yi Xiang, Han Huang, Yuren Zhou, Sizhe Li, Chuan Luo, Qingwei Lin, Miqing Li, and Xiaowei Yang. 2022b. Search-based diverse sampling from real-world software product lines. In Proceedings of the ICSE 2022, 1945\u20131957."},{"issue":"2","key":"e_1_3_2_129_2","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/s10515-022-00348-8","article-title":"Sampling configurations from software product lines via probability-aware diversification and SAT solving","volume":"29","author":"Xiang Yi","year":"2022","unstructured":"Yi Xiang, Xiaowei Yang, Han Huang, Zhengxin Huang, and Miqing Li. 2022c. Sampling configurations from software product lines via probability-aware diversification and SAT solving. Automated Software Engineering 29, 2 (2022), 54.","journal-title":"Automated Software Engineering"},{"issue":"4","key":"e_1_3_2_130_2","first-page":"14:1","article-title":"Configuring software product lines by combining many-objective optimization and SAT solvers","volume":"26","author":"Xiang Yi","year":"2018","unstructured":"Yi Xiang, Yuren Zhou, Zibin Zheng, and Miqing Li. 2018. Configuring software product lines by combining many-objective optimization and SAT solvers. ACM Transactions on Software Engineering and Methodology 26, 4 (2018), 14:1\u201314:46.","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"e_1_3_2_131_2","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1145\/2970276.2970335","volume-title":"Proceedings of the ASE 2016","author":"Yamada Akihisa","year":"2016","unstructured":"Akihisa Yamada, Armin Biere, Cyrille Artho, Takashi Kitamura, and Eun-Hye Choi. 2016. Greedy combinatorial test case generation using unsatisfiable cores. In Proceedings of the ASE 2016, 614\u2013624."},{"key":"e_1_3_2_132_2","first-page":"1","volume-title":"Proceedings of the ICST 2015","author":"Yamada Akihisa","year":"2015","unstructured":"Akihisa Yamada, Takashi Kitamura, Cyrille Artho, Eun-Hye Choi, Yutaka Oiwa, and Armin Biere. 2015. Optimization of combinatorial testing by incremental SAT solving. In Proceedings of the ICST 2015, 1\u201310."},{"issue":"1","key":"e_1_3_2_133_2","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/TSE.2006.8","article-title":"Covering arrays for efficient fault characterization in complex configuration spaces","volume":"32","author":"Yilmaz Cemal","year":"2006","unstructured":"Cemal Yilmaz, Myra B. Cohen, and Adam A. Porter. 2006. Covering arrays for efficient fault characterization in complex configuration spaces. IEEE Transactions on Software Engineering 32, 1 (2006), 20\u201334.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"e_1_3_2_134_2","first-page":"242","volume-title":"Proceedings of the ICST 2013","author":"Yu Linbin","year":"2013","unstructured":"Linbin Yu, Yu Lei, Mehra Nouroz Borazjany, Raghu Kacker, and D. Richard Kuhn. 2013. An efficient algorithm for constraint handling in combinatorial test generation. In Proceedings of the ICST 2013, 242\u2013251."},{"key":"e_1_3_2_135_2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.jss.2014.09.001","article-title":"Generating combinatorial test suite using combinatorial optimization","volume":"98","author":"Zhang Zhiqiang","year":"2014","unstructured":"Zhiqiang Zhang, Jun Yan, Yong Zhao, and Jian Zhang. 2014. Generating combinatorial test suite using combinatorial optimization. Journal of Systems and Software 98 (2014), 191\u2013207.","journal-title":"Journal of Systems and Software"},{"key":"e_1_3_2_136_2","first-page":"81","volume-title":"Proceedings of the ESEC\/FSE 2023","author":"Zhao Qiyuan","year":"2023","unstructured":"Qiyuan Zhao, Chuan Luo, Shaowei Cai, Wei Wu, Jinkun Lin, Hongyu Zhang, and Chunming Hu. 2023. CAmpactor: A novel and effective local search algorithm for optimizing pairwise covering arrays. In Proceedings of the ESEC\/FSE 2023, 81\u201393."},{"issue":"8","key":"e_1_3_2_137_2","doi-asserted-by":"crossref","first-page":"2587","DOI":"10.1109\/TCAD.2021.3112143","article-title":"An iterated local search methodology for the qubit mapping problem","volume":"41","author":"Zhu Pengcheng","year":"2022","unstructured":"Pengcheng Zhu, Shiguang Feng, and Zhijin Guan. 2022. An iterated local search methodology for the qubit mapping problem. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 41, 8 (2022), 2587\u20132597.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"}],"container-title":["ACM Transactions on Software Engineering and Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3688836","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3688836","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:04:10Z","timestamp":1750291450000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3688836"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,31]]},"references-count":136,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1,31]]}},"alternative-id":["10.1145\/3688836"],"URL":"https:\/\/doi.org\/10.1145\/3688836","relation":{},"ISSN":["1049-331X","1557-7392"],"issn-type":[{"value":"1049-331X","type":"print"},{"value":"1557-7392","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,31]]},"assertion":[{"value":"2023-12-05","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-18","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-12-31","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}