{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T15:34:59Z","timestamp":1784302499721,"version":"3.55.0"},"reference-count":68,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T00:00:00Z","timestamp":1735171200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100005416","name":"Research Council of Norway","doi-asserted-by":"crossref","award":["Qu-Test Project#299827"],"award-info":[{"award-number":["Qu-Test Project#299827"]}],"id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Engineerable AI Techniques for Practical Applications of High-Quality Machine Learning-Based Systems Project","award":["JPMJMI20B8"],"award-info":[{"award-number":["JPMJMI20B8"]}]},{"name":"ERATO HASUO Metamathematics for Systems Design","award":["JPMJER1603"],"award-info":[{"award-number":["JPMJER1603"]}]},{"name":"JST"}],"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            Quantum annealers are specialized quantum computers for solving combinatorial optimization problems with special quantum computing characteristics, e.g., superposition and entanglement. Theoretically, quantum annealers can outperform classic computers. However, current quantum annealers are constrained by a limited number of qubits and cannot demonstrate quantum advantages. Nonetheless, research is needed to develop novel mechanisms to formulate combinatorial optimization problems for quantum annealing (QA). However, QA applications in software engineering remain unexplored. Thus, we propose\n            <jats:italic toggle=\"yes\">BootQA<\/jats:italic>\n            , the very first effort at solving test case minimization (TCM) problems on classical software with QA. We provide a novel TCM formulation for QA and utilize bootstrap sampling to optimize the qubit usage. We also implemented our TCM formulation in three other optimization processes: simulated annealing (SA), QA without problem decomposition, and QA with an existing D-Wave problem decomposition strategy, and conducted an empirical evaluation with three real-world TCM datasets. Results show that\n            <jats:italic toggle=\"yes\">BootQA<\/jats:italic>\n            outperforms QA without problem decomposition and QA with the existing decomposition strategy regarding effectiveness. Moreover,\n            <jats:italic toggle=\"yes\">BootQA<\/jats:italic>\n            \u2019s effectiveness is similar to SA. Finally,\n            <jats:italic toggle=\"yes\">BootQA<\/jats:italic>\n            has higher efficiency in terms of time when solving large TCM problems than the other three optimization processes.\n          <\/jats:p>","DOI":"10.1145\/3680467","type":"journal-article","created":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T10:52:37Z","timestamp":1722077557000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Test Case Minimization with Quantum Annealers"],"prefix":"10.1145","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5621-6140","authenticated-orcid":false,"given":"Xinyi","family":"Wang","sequence":"first","affiliation":[{"name":"Simula Research Laboratory, Oslo, Norway, and University of Oslo, Oslo, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2620-3167","authenticated-orcid":false,"given":"Asmar","family":"Muqeet","sequence":"additional","affiliation":[{"name":"Simula Research Laboratory, Oslo, Norway, and University of Oslo, Oslo, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3262-5577","authenticated-orcid":false,"given":"Tao","family":"Yue","sequence":"additional","affiliation":[{"name":"Simula Research Laboratory, Oslo, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9979-3519","authenticated-orcid":false,"given":"Shaukat","family":"Ali","sequence":"additional","affiliation":[{"name":"Simula Research Laboratory, Oslo, Norway, and Oslo Metropolitan University, Oslo, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6253-4062","authenticated-orcid":false,"given":"Paolo","family":"Arcaini","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,12,26]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0219749919500424"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3528230.3529189"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICST49551.2021.00014"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSPC47137.2019.9068003"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985795"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2019.06.009"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2021.3070549"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2011.00719"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3530019.3530023"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3468264.3468555"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-008-0082-9"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205648"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/s42979-021-00466-2"},{"key":"e_1_3_2_15_2","unstructured":"Edward Farhi Jeffrey Goldstone Sam Gutmann and Michael Sipser. 2000. Quantum computation by adiabatic evolution. arXiv: quant-ph\/0001106. Retrieved from https:\/\/arxiv.org\/abs\/quant-ph\/0001106"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2022.3195061"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3510454.3528649"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3533767.3543296"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1002\/smr.2419"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-021-03226-6"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1002\/wics.182"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3387940.3391459"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1080\/23311916.2021.1882116"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-021-82740-0"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-020-58081-9"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.58.5355"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108511"},{"key":"e_1_3_2_28_2","first-page":"2319","volume-title":"Proceedings of the Control 2000 Conference","author":"Kerrigan Eric C","year":"2000","unstructured":"Eric C Kerrigan and Jan M. Maciejowski. 2000. Soft constraints and exact penalty functions in model predictive control. In Proceedings of the Control 2000 Conference, 2319\u20132327."},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/047"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-016-9437-5"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2020.106346"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.3414"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/s42484-021-00050-0"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.21751"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE51524.2021.9678563"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3549036.3562061"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3549036.3562060"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE-NIER.2019.00023"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3377816.3381731"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1063\/1.2995837"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2018.09.005"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-020-04719-9"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-021-10066-6"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-022-08394-8"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1140\/epjst\/e2015-02347-y"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/3528230.3528395"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2021.0417"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2574703"},{"issue":"06","key":"e_1_3_2_49_2","doi-asserted-by":"crossref","first-page":"1630001","DOI":"10.1142\/S0218213016300015","article-title":"Simulated annealing, its variants and engineering applications","volume":"25","author":"Siddique Nazmul","year":"2016","unstructured":"Nazmul Siddique and Hojjat Adeli. 2016. Simulated annealing, its variants and engineering applications. International Journal on Artificial Intelligence Tools 25, 06 (2016), 1630001.","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1007\/s42484-020-00031-9"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/3092703.3092709"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAES.2021.3088490"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.05.014"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3070634"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-006-7551-5"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICST49551.2021.00061"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2014.08.024"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2312.15547"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1109\/QRS54544.2021.00029"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE51524.2021.9678798"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/3510454.3516839"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE56229.2023.00062"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528869"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1007\/s42452-019-1829-x"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00542-019-04679-7"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6633\/ac8c54"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE56229.2023.00196"},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-50743-5_10"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1145\/3532213.3532248"}],"container-title":["ACM Transactions on Software Engineering and Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3680467","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3680467","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T16:41:30Z","timestamp":1756485690000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3680467"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,26]]},"references-count":68,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1,31]]}},"alternative-id":["10.1145\/3680467"],"URL":"https:\/\/doi.org\/10.1145\/3680467","relation":{},"ISSN":["1049-331X","1557-7392"],"issn-type":[{"value":"1049-331X","type":"print"},{"value":"1557-7392","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,26]]},"assertion":[{"value":"2023-08-14","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-09","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-12-26","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}