{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:59:02Z","timestamp":1763643542876,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":67,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T00:00:00Z","timestamp":1653091200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","award":["NRF-NRFFAI1-2019-0004 and AISG-RP-2018-005"],"award-info":[{"award-number":["NRF-NRFFAI1-2019-0004 and AISG-RP-2018-005"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["HDR:TRIPODS-1934884"],"award-info":[{"award-number":["HDR:TRIPODS-1934884"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["826278 ? SERUMS ? H2020-SC1-FA-DTS-2018-2020"],"award-info":[{"award-number":["826278 ? SERUMS ? H2020-SC1-FA-DTS-2018-2020"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,5,21]]},"DOI":"10.1145\/3510003.3510218","type":"proceedings-article","created":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T22:42:59Z","timestamp":1657060979000},"page":"36-47","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A scalable t-wise coverage estimator"],"prefix":"10.1145","author":[{"given":"Eduard","family":"Baranov","sequence":"first","affiliation":[{"name":"Universite catholique de Louvain, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sourav","family":"Chakraborty","sequence":"additional","affiliation":[{"name":"Indian Statistical Institute, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Axel","family":"Legay","sequence":"additional","affiliation":[{"name":"Universite catholique de Louvain, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuldeep S.","family":"Meel","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vinodchandran N.","family":"Variyam","sequence":"additional","affiliation":[{"name":"University of Nebraska-Lincoln"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2642937.2642990"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3093335.2993253"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3368089.3409744"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2430502.2430513"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2013.34"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1527149.1527152"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-010-9171-4"},{"key":"e_1_3_2_1_8_1","volume-title":"Vardi","author":"Chakraborty Supratik","year":"2013","unstructured":"Supratik Chakraborty, Kuldeep S. Meel, and Moshe Y. Vardi. 2013. A Scalable and Nearly Uniform Generator of SAT Witnesses. In Proc. of CAV. 608--623."},{"key":"e_1_3_2_1_9_1","volume-title":"Vardi","author":"Chakraborty Supratik","year":"2013","unstructured":"Supratik Chakraborty, Kuldeep S. Meel, and Moshe Y. Vardi. 2013. A Scalable Approximate Model Counter. In Proc. of CP. 200--216."},{"key":"e_1_3_2_1_10_1","volume-title":"Vardi","author":"Chakraborty Supratik","year":"2014","unstructured":"Supratik Chakraborty, Kuldeep S. Meel, and Moshe Y. Vardi. 2014. Balancing Scalability and Uniformity in SAT Witness Generator. In Proc. of DAC. 1--6."},{"key":"e_1_3_2_1_11_1","volume-title":"Vardi","author":"Chakraborty Supratik","year":"2016","unstructured":"Supratik Chakraborty, Kuldeep S. Meel, and Moshe Y. Vardi. 2016. Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls. In Proc. of IJCAI."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30502-6_23"},{"key":"e_1_3_2_1_13_1","first-page":"53","article-title":"Efficient and effective testing of automotive software product lines","volume":"7","author":"Cmyrev Anastasia","year":"2014","unstructured":"Anastasia Cmyrev and Ralf Reissing. 2014. Efficient and effective testing of automotive software product lines. King Mongkuts University of Technology North Bangkok International Journal of Applied Science and Technology 7, 2 (2014), 53--57.","journal-title":"King Mongkuts University of Technology North Bangkok International Journal of Applied Science and Technology"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.605761"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the 25th International Conference on Software Engineering, May 3--10","author":"Cohen Myra B.","year":"2003","unstructured":"Myra B. Cohen, Peter B. Gibbons, Warwick B. Mugridge, and Charles J. Colbourn. [n.d.]. Constructing Test Suites for Interaction Testing. In Proceedings of the 25th International Conference on Software Engineering, May 3--10, 2003, Portland, Oregon, USA. 38--48."},{"volume-title":"Proc. of AAAI\/IAAI. 15--21","author":"Dechter R.","key":"e_1_3_2_1_16_1","unstructured":"R. Dechter, K. Kask, E. Bin, and R. Emek. 2002. Generating Random Solutions for Constraint Satisfaction Problems. In Proc. of AAAI\/IAAI. 15--21."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1984.5010257"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1195971.1195974"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3180155.3180248"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3180155.3180248"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSBSE.2009.25"},{"volume-title":"Proc. of CP. 711--715","author":"Gogate V.","key":"e_1_3_2_1_22_1","unstructured":"V. Gogate and R. Dechter. 2006. A New Algorithm for Sampling CSP Solutions Uniformly at Random. In Proc. of CP. 711--715."},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. of AAAI. 54--61","author":"Gomes Carla P.","year":"2006","unstructured":"Carla P. Gomes, Ashish Sabharwal, and Bart Selman. 2006. Model counting: A new strategy for obtaining good bounds. In Proc. of AAAI. 54--61."},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. of NIPS. 670--676","author":"Gomes Carla P.","year":"2007","unstructured":"Carla P. Gomes, Ashish Sabharwal, and Bart Selman. 2007. Near-Uniform sampling of combinatorial spaces using XOR constraints. In Proc. of NIPS. 670--676."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17458-2_6"},{"key":"e_1_3_2_1_26_1","volume-title":"Meel","author":"Gupta Rahul","year":"2019","unstructured":"Rahul Gupta, Shubham Sharma, Subhajit Roy, and Kuldeep S. Meel. 2019. WAPS: Weighted and Projected Sampling. In Proceedings of Tools and Algorithms for the Construction and Analysis of Systems (TACAS)."},{"key":"e_1_3_2_1_27_1","volume-title":"Learning Combinatorial Interaction Test Generation Strategies Using Hyperheuristic Search. In 37th IEEE\/ACM International Conference on Software Engineering, ICSE 2015","volume":"1","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 37th IEEE\/ACM International Conference on Software Engineering, ICSE 2015, Florence, Italy, May 16--24, 2015, Volume 1. IEEE Computer Society, 540--550."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2362536.2362547"},{"key":"e_1_3_2_1_29_1","volume-title":"Proc. of FOCS","author":"Karp R.M.","year":"1983","unstructured":"R.M. Karp and M. Luby. 1983. Monte-Carlo algorithms for enumeration and reliability problems. Proc. of FOCS (1983)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(89)90038-2"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3106237.3106252"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/2206221"},{"volume-title":"Introduction to combinatorial testing","author":"Kuhn D Richard","key":"e_1_3_2_1_34_1","unstructured":"D Richard Kuhn, Raghu N Kacker, and Yu Lei. 2013. Introduction to combinatorial testing. CRC press."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/10722167_12"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECBS.2007.47"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/1405567.1405569"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2791060.2791070"},{"key":"e_1_3_2_1_39_1","volume-title":"LS-Sampling: An Effective Local Search Based Sampling Approach for Achieving High t-Wise Coverage (ESEC\/FSE","author":"Luo Chuan","year":"2021","unstructured":"Chuan Luo, Binqi Sun, Bo Qiao, Junjie Chen, Hongyu Zhang, Jinkun Lin, Qingwei Lin, and Dongmei Zhang. 2021. LS-Sampling: An Effective Local Search Based Sampling Approach for Achieving High t-Wise Coverage (ESEC\/FSE 2021). 1081--1092."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/4372.4375"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491627.2491646"},{"volume-title":"Generation of pairwise test sets using a genetic algorithm. In 2009 33rd annual IEEE international computer software and applications conference","author":"McCaffrey James D","key":"e_1_3_2_1_42_1","unstructured":"James D McCaffrey. 2009. Generation of pairwise test sets using a genetic algorithm. In 2009 33rd annual IEEE international computer software and applications conference, Vol. 1. IEEE, 626--631."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884793"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","unstructured":"Kuldeep S. Meel. 2020. Model counting and uniform sampling instances. 10.5281\/zenodo.3793090","DOI":"10.5281\/zenodo.3793090"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373718.3394809"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379017"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1883612.1883618"},{"key":"e_1_3_2_1_48_1","volume-title":"Upper bounds for covering arrays by tabu search. Discrete applied mathematics 138, 1--2","author":"Nurmela Kari J","year":"2004","unstructured":"Kari J Nurmela. 2004. Upper bounds for covering arrays by tabu search. Discrete applied mathematics 138, 1--2 (2004), 143--152."},{"key":"e_1_3_2_1_49_1","volume-title":"Proceedings of the 23rd International Systems and Software Product Line Conference, SPLC 2019","volume":"13","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 23rd International Systems and Software Product Line Conference, SPLC 2019, Volume A, Paris, France, September 9--13, 2019. 15:1--15:4."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1976.233797"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2010.43"},{"key":"e_1_3_2_1_52_1","unstructured":"Tobias Pett Thomas Th\u00fcm Tobias Runge Sebastian Krieter Malte Lochau and Ina Schaefer. [n.d.]. Product Sampling for Product Lines: The Scalability Challenge. ([n.d.])."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2019.00032"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2016.05.006"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.6031"},{"key":"e_1_3_2_1_56_1","volume-title":"Meel","author":"Sharma Shubham","year":"2018","unstructured":"Shubham Sharma, Rahul Gupta, Subhajit Roy, and Kuldeep S. Meel. 2018. Knowledge Compilation meets Uniform Sampling. In Proc. of LPAR-22. 620--636."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.3180010106"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-53288-8_22"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011592"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808740"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2039239.2039242"},{"key":"e_1_3_2_1_62_1","volume-title":"Proc. International Conference on Quality Control (ICQC'87)","author":"Tatsumi Keizo","year":"1987","unstructured":"Keizo Tatsumi. 1987. Test case design support system. In Proc. International Conference on Quality Control (ICQC'87). 615--620."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/2580950"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/QSIC.2008.52"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/11499107_24"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/2970276.2970335"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2013.408"}],"event":{"name":"ICSE '22: 44th International Conference on Software Engineering","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS"],"location":"Pittsburgh Pennsylvania","acronym":"ICSE '22"},"container-title":["Proceedings of the 44th International Conference on Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3510003.3510218","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3510003.3510218","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3510003.3510218","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:24Z","timestamp":1750191144000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3510003.3510218"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,21]]},"references-count":67,"alternative-id":["10.1145\/3510003.3510218","10.1145\/3510003"],"URL":"https:\/\/doi.org\/10.1145\/3510003.3510218","relation":{},"subject":[],"published":{"date-parts":[[2022,5,21]]},"assertion":[{"value":"2022-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}