{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T16:40:11Z","timestamp":1756831211627,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1145\/3744915.3748475","type":"proceedings-article","created":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T14:54:43Z","timestamp":1756565683000},"page":"172-183","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Speed Things Up: Leveraging GPU Processing Capabilities for Faster Sampling of Software Product Lines"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3033-0591","authenticated-orcid":false,"given":"Lennard","family":"Hettich","sequence":"first","affiliation":[{"name":"University of Stuttgart, Stuttgart, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0745-158X","authenticated-orcid":false,"given":"Johannes","family":"St\u00fcmpfle","sequence":"additional","affiliation":[{"name":"University of Stuttgart, Stuttgart, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6722-0911","authenticated-orcid":false,"given":"Nasser","family":"Jazdi","sequence":"additional","affiliation":[{"name":"University of Stuutgart, Stuttgart, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3176-9288","authenticated-orcid":false,"given":"Michael","family":"Weyrich","sequence":"additional","affiliation":[{"name":"University of Stuttgart, Stuttgart, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,8,31]]},"reference":[{"key":"e_1_3_3_2_2_2","unstructured":"Tobias Achterberg. 2019. What\u2019s new in Gurobi 9.0. Webinar Talk url: https:\/\/www. gurobi. com\/wp-content\/uploads\/2019\/12\/Gurobi-90-Overview-Webinar-Slides-1. pdf 5 9 (2019) 97\u2013113."},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"crossref","unstructured":"Mustafa Al-Hajjaji Sebastian Krieter Thomas Th\u00fcm Malte Lochau and Gunter Saake. 2016. IncLing: efficient product-line testing using incremental pairwise sampling. ACM SIGPLAN Notices 52 3 (2016) 144\u2013155.","DOI":"10.1145\/3093335.2993253"},{"key":"e_1_3_3_2_4_2","volume-title":"New Results on Closed-Form Formulas for Evaluating r-flip Moves in Quadratic Unconstrained Binary Optimization","author":"Alidaee Bahram","year":"2022","unstructured":"Bahram Alidaee, Haibo Wang, and W Liu. 2022. New Results on Closed-Form Formulas for Evaluating r-flip Moves in Quadratic Unconstrained Binary Optimization. Technical Report. Working Paper Series, WP 2021-002."},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3646548.3672587"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"crossref","unstructured":"Vasek Chvatal. 1979. A greedy heuristic for the set-covering problem. Mathematics of operations research 4 3 (1979) 233\u2013235.","DOI":"10.1287\/moor.4.3.233"},{"key":"e_1_3_3_2_7_2","volume-title":"Software product lines","author":"Clements Paul","year":"2002","unstructured":"Paul Clements and Linda Northrop. 2002. Software product lines. Vol.\u00a01.Addison-Wesley Boston."},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"crossref","unstructured":"Isma Dahmani and Mhand Hifi. 2021. A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs. Annals of Operations Research 298 (2021) 125\u2013147.","DOI":"10.1007\/s10479-019-03290-3"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"crossref","unstructured":"Emelie Engstr\u00f6m and Per Runeson. 2011. Software product line testing\u2013a systematic mapping study. Information and Software Technology 53 1 (2011) 2\u201313.","DOI":"10.1016\/j.infsof.2010.05.011"},{"key":"e_1_3_3_2_10_2","volume-title":"The little book of deep learning","author":"Fleuret Fran\u00e7ois","year":"2024","unstructured":"Fran\u00e7ois Fleuret. 2024. The little book of deep learning.Universit\u00e9 de Gen\u00e8ve."},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"crossref","unstructured":"Franklin\u00a0Djeumou Fomeni and Adam\u00a0N Letchford. 2014. A dynamic programming heuristic for the quadratic knapsack problem. INFORMS Journal on Computing 26 1 (2014) 173\u2013182.","DOI":"10.1287\/ijoc.2013.0555"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3579027.3608973"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.4271\/2025-01-0297"},{"key":"e_1_3_3_2_14_2","unstructured":"L Hettich J St\u00fcmpfle and M Weyrich. 2024. Testing Variant-Rich Software-Defined Mobility Systems. Electronics In Vehicles (ELIV)-Kongress (2024)."},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24485-8_47"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/2362536.2362547"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/1296907.1296909"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3382025.3414989"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3377024.3377042"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"crossref","unstructured":"Dominik Krupke Ahmad Moradi Michael Perk Phillip Keldenich Gabriel Gehrke Sebastian Krieter Thomas Th\u00fcm and S\u00e1ndor\u00a0P Fekete. 2025. How Low Can We Go? Minimizing Interaction Samples for Configurable Systems. ACM Transactions on Software Engineering and Methodology (2025).","DOI":"10.1145\/3712193"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.5555\/2500930"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3634713.3634733"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3551349.3556938"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/2362536.2362545"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSTW.2015.7107435"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3650212.3680309"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3540250.3549155"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/2491627.2491646"},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"crossref","unstructured":"Changhai Nie and Hareton Leung. 2011. A survey of combinatorial testing. ACM Computing Surveys (CSUR) 43 2 (2011) 1\u201329.","DOI":"10.1145\/1883612.1883618"},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"crossref","unstructured":"Robert Nieuwenhuis Albert Oliveras and Cesare Tinelli. 2006. Solving SAT and SAT modulo theories: From an abstract Davis\u2013Putnam\u2013Logemann\u2013Loveland procedure to DPLL (T). Journal of the ACM (JACM) 53 6 (2006) 937\u2013977.","DOI":"10.1145\/1217856.1217859"},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/2019136.2019143"},{"key":"e_1_3_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3579027.3608980"},{"key":"e_1_3_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3646548.3672589"},{"key":"e_1_3_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3336294.3336322"},{"key":"e_1_3_3_2_35_2","doi-asserted-by":"crossref","unstructured":"Alberto\u00a0Del Pia Santanu\u00a0S Dey and Marco Molinaro. 2017. Mixed-integer quadratic programming is in NP. Mathematical Programming 162 (2017) 225\u2013240.","DOI":"10.1007\/s10107-016-1036-0"},{"key":"e_1_3_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v20i1.13412"},{"key":"e_1_3_3_2_37_2","doi-asserted-by":"crossref","unstructured":"Lothar\u00a0M Schmitt. 2001. Theory of genetic algorithms. Theoretical Computer Science 259 1-2 (2001) 1\u201361.","DOI":"10.1016\/S0304-3975(00)00406-0"},{"key":"e_1_3_3_2_38_2","unstructured":"Niklas S\u00f6rensson. 2010. Minisat 2.2 and minisat++ 1.1. A short description in SAT Race 2010 (2010)."},{"key":"e_1_3_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSR66718.2025.00008"},{"key":"e_1_3_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3646548.3672590"},{"key":"e_1_3_3_2_41_2","doi-asserted-by":"crossref","unstructured":"Chico Sundermann Tobias He\u00df Michael Nieke Paul\u00a0Maximilian Bittner Jeffrey\u00a0M Young Thomas Th\u00fcm and Ina Schaefer. 2023. Evaluating state-of-the-art# SAT solvers on industrial configuration spaces. Empirical Software Engineering 28 2 (2023) 29.","DOI":"10.1007\/s10664-022-10265-9"},{"key":"e_1_3_3_2_42_2","doi-asserted-by":"crossref","unstructured":"Thomas Th\u00fcm Christian K\u00e4stner Fabian Benduhn Jens Meinicke Gunter Saake and Thomas Leich. 2014. FeatureIDE: An extensible framework for feature-oriented software development. Science of Computer Programming 79 (2014) 70\u201385.","DOI":"10.1016\/j.scico.2012.06.002"},{"key":"e_1_3_3_2_43_2","doi-asserted-by":"crossref","unstructured":"Joao\u00a0P Trovao. 2020. Digital transformation systemic design and automotive electronics [automotive electronics]. IEEE Vehicular Technology Magazine 15 2 (2020) 149\u2013159.","DOI":"10.1109\/MVT.2020.2980097"},{"key":"e_1_3_3_2_44_2","unstructured":"Haibo Wang and Bahram Alidaee. 2024. Fast Local Search Strategies for Large-Scale General Quadratic Integer Programming. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2409.14176 (2024)."},{"key":"e_1_3_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-92280-5_2"},{"key":"e_1_3_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043572"},{"key":"e_1_3_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3611643.3616284"}],"event":{"name":"SPLC-A '25: 29th ACM International Systems and Software Product Line Conference - Volume A","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"A Coru\u00f1a Spain","acronym":"SPLC-A '25"},"container-title":["Proceedings of the 29th ACM International Systems and Software Product Line Conference - Volume A"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3744915.3748475","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T16:07:24Z","timestamp":1756829244000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3744915.3748475"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,31]]},"references-count":46,"alternative-id":["10.1145\/3744915.3748475","10.1145\/3744915"],"URL":"https:\/\/doi.org\/10.1145\/3744915.3748475","relation":{},"subject":[],"published":{"date-parts":[[2025,8,31]]},"assertion":[{"value":"2025-08-31","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}