{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T21:08:20Z","timestamp":1792184900262,"version":"4.4.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T00:00:00Z","timestamp":1738627200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["EXC 2050\/1 390696704"],"award-info":[{"award-number":["EXC 2050\/1 390696704"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["TRR 248 389792660"],"award-info":[{"award-number":["TRR 248 389792660"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["VI.Veni.222.431"],"award-info":[{"award-number":["VI.Veni.222.431"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,2,4]]},"DOI":"10.1145\/3715340.3715442","type":"proceedings-article","created":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T17:04:13Z","timestamp":1748451853000},"page":"11-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["When to Sample from Feature Diagrams?"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0645-1078","authenticated-orcid":false,"given":"Nikolai","family":"K\u00e4fer","sequence":"first","affiliation":[{"name":"TU Dresden, Dresden, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3687-2233","authenticated-orcid":false,"given":"Sven","family":"Apel","sequence":"additional","affiliation":[{"name":"Saarland University, Saarbr\u00fccken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5321-9343","authenticated-orcid":false,"given":"Christel","family":"Baier","sequence":"additional","affiliation":[{"name":"TU Dresden, Dresden, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5718-8276","authenticated-orcid":false,"given":"Clemens","family":"Dubslaff","sequence":"additional","affiliation":[{"name":"Eindhoven University of Technology, Eindhoven, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2766-9615","authenticated-orcid":false,"given":"Holger","family":"Hermanns","sequence":"additional","affiliation":[{"name":"Saarland University, Saarbr\u00fccken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,5,28]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3461002.3473070"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","unstructured":"Mathieu Acher Gilles Perrouin and Maxime Cordy. 2023. BURST: Benchmarking Uniform Random Sampling Techniques. Science of Computer Programming 226 (March 2023) 102914. 10.1016\/j.scico.2022.102914","DOI":"10.1016\/j.scico.2022.102914"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94144-8_9"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37521-7"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/2528265.2528267"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/SPLC.2008.53"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.3233\/FAIA336"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.5772\/50787"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","unstructured":"Randal\u00a0E Bryant. 1986. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Trans. Comput. C-35 8 (1986) 677\u2013691. 10.1109\/TC.1986.1676819","DOI":"10.1109\/TC.1986.1676819"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"crossref","unstructured":"Muffy Calder Mario Kolberg Evan\u00a0H. Magill and Stephan Reiff-Marganiec. 2003. Feature interaction: a critical review and considered forecast. Computer Networks 41 (2003) 115\u2013141.","DOI":"10.1016\/S1389-1286(02)00352-3"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46681-0_25"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39799-8_40"},{"key":"e_1_3_3_2_14_2","volume-title":"Software Product Lines : Practices and Patterns","author":"Clements Paul","year":"2001","unstructured":"Paul Clements and Linda Northrop. 2001. Software Product Lines : Practices and Patterns. Addison-Wesley Professional."},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"crossref","unstructured":"Adnan Darwiche and Pierre Marquis. 2002. A knowledge compilation map. J. Artif. Int. Res. 17 1 (Sept. 2002) 229\u2013264.","DOI":"10.1613\/jair.989"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3646548.3676538"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3180155.3180248"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.34727\/2021\/ISBN.978-3-85448-046-4_31"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3382025.3414951"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","unstructured":"Ruben Heradio David Fernandez-Amoros Jos\u00e9\u00a0A. Galindo David Benavides and Don Batory. 2022. Uniform and Scalable Sampling of Highly Configurable Systems. Empirical Software Engineering 27 2 (March 2022) 44. 10.1007\/s10664-021-10102-5","DOI":"10.1007\/s10664-021-10102-5"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3634713.3634716"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-57256-2_13"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"publisher","unstructured":"Mark\u00a0R. Jerrum Leslie\u00a0G. Valiant and Vijay\u00a0V. Vazirani. 1986. Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science 43 (1986) 169\u2013188. 10.1016\/0304-3975(86)90174-X","DOI":"10.1016\/0304-3975(86)90174-X"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.21236\/ADA235785"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3106237.3106252"},{"key":"e_1_3_3_2_26_2","volume-title":"The Art of Computer Programming, Volume 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams (12th ed.)","author":"Knuth Donald\u00a0E.","year":"2009","unstructured":"Donald\u00a0E. Knuth. 2009. The Art of Computer Programming, Volume 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams (12th ed.). Addison-Wesley Professional."},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"publisher","unstructured":"Tuukka Korhonen and Matti J\u00e4rvisalo. 2023. SharpSAT-TD in Model Counting Competitions 2021-2023. 10.48550\/ARXIV.2308.15819","DOI":"10.48550\/ARXIV.2308.15819"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3180155.3180159"},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3551349.3556938"},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3106237.3106273"},{"key":"e_1_3_3_2_31_2","volume-title":"Scalable Uniform Sampling for Real-World Software Product Lines","author":"Oh Jeho","year":"2020","unstructured":"Jeho Oh, Paul Gazzillo, Don Batory, Marijn Heule, and Margaret Myers. 2020. Scalable Uniform Sampling for Real-World Software Product Lines. Technical Report TR-20-01. University of Texas at Austin, Department of Computer Science."},{"key":"e_1_3_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2019.00032"},{"key":"e_1_3_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/RE.2006.23"},{"key":"e_1_3_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.29007\/h4p9"},{"key":"e_1_3_3_2_35_2","volume-title":"CUDD: CU Decision Diagram Package","author":"Somenzi Fabio","year":"2015","unstructured":"Fabio Somenzi. 2015. CUDD: CU Decision Diagram Package. Technical Report. University of Colorado at Boulder."},{"key":"e_1_3_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-53288-8_22"},{"key":"e_1_3_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3646548.3672590"},{"key":"e_1_3_3_2_38_2","doi-asserted-by":"publisher","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 (March 2023) 29. 10.1007\/s10664-022-10265-9","DOI":"10.1007\/s10664-022-10265-9"},{"key":"e_1_3_3_2_39_2","doi-asserted-by":"publisher","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 (Jan. 2014) 70\u201385. 10.1016\/j.scico.2012.06.002","DOI":"10.1016\/j.scico.2012.06.002"},{"key":"e_1_3_3_2_40_2","volume-title":"Linear Time Computation of Variation Degree and Commonalities on Feature Diagrams","author":"Vavrille Mathieu","year":"2023","unstructured":"Mathieu Vavrille, Erwan Meunier, Charlotte Truchet, and Charles Prud\u2019Homme. 2023. Linear Time Computation of Variation Degree and Commonalities on Feature Diagrams. Technical Report RR-2023-01-DAPI. Nantes Universit\u00e9, \u00c9cole Centrale Nantes, IMT Atlantique, CNRS, LS2N, UMR 6004, F-44000 Nantes, France."},{"key":"e_1_3_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/11554844_9"},{"key":"e_1_3_3_2_42_2","first-page":"36","volume-title":"Monte Carlo Method","author":"Neumann John von","year":"1951","unstructured":"John von Neumann. 1951. Various techniques used in connection with random digits. In Monte Carlo Method. National Bureau of Standards Applied Mathematics Series, 12, Washington, D.C.: U.S. Government Printing Office, 36\u201338."},{"key":"e_1_3_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/774572.774590"},{"key":"e_1_3_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3644033.3644371"}],"event":{"name":"VaMoS 2025: 19th International Working Conference on Variability Modelling of Software-Intensive Systems","location":"Rennes France","acronym":"VaMoS 2025"},"container-title":["Proceedings of the 19th International Working Conference on Variability Modelling of Software-Intensive Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3715340.3715442","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3715340.3715442","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:18Z","timestamp":1750295898000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3715340.3715442"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,4]]},"references-count":43,"alternative-id":["10.1145\/3715340.3715442","10.1145\/3715340"],"URL":"https:\/\/doi.org\/10.1145\/3715340.3715442","relation":{},"subject":[],"published":{"date-parts":[[2025,2,4]]},"assertion":[{"value":"2025-05-28","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}