{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:43:15Z","timestamp":1763458995484,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-111674,CCF-1139021,CCF-1319666"],"award-info":[{"award-number":["CCF-111674,CCF-1139021,CCF-1319666"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1145\/2950290.2950311","type":"proceedings-article","created":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T09:46:03Z","timestamp":1477993563000},"page":"655-665","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["iGen: dynamic interaction inference for configurable software"],"prefix":"10.1145","author":[{"given":"ThanhVu","family":"Nguyen","sequence":"first","affiliation":[{"name":"University of Maryland at College Park, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugur","family":"Koc","sequence":"additional","affiliation":[{"name":"University of Maryland at College Park, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javran","family":"Cheng","sequence":"additional","affiliation":[{"name":"University of Maryland at College Park, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey S.","family":"Foster","sequence":"additional","affiliation":[{"name":"University of Maryland at College Park, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam A.","family":"Porter","sequence":"additional","affiliation":[{"name":"University of Maryland at College Park, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2528265.2528267"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1858996.1859010"},{"key":"e_1_3_2_1_3_1","unstructured":"Bisect; coverage tool for OCaml. http:\/\/bisect.x9c.fr accessed on 2016-03-07."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2006.03.004"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/52.536462"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/776816.776822"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368088.1368127"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1173706.1173738"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_1_10_1","volume-title":"International Conference on Advances in System Testing and Validation Lifecycle","author":"Demiroz G.","year":"2012","unstructured":"G. Demiroz and C. Yilmaz. Cost-aware combinatorial interaction testing. In International Conference on Advances in System Testing and Validation Lifecycle, Nov. 2012."},{"key":"e_1_3_2_1_11_1","volume-title":"Dynamically discovering program invariants involving collections. Technical report","author":"Ernst M. D.","year":"2000","unstructured":"M. D. Ernst, W. G. Griswold, Y. Kataoka, and D. Notkin. Dynamically discovering program invariants involving collections. Technical report, University of Washington, 2000."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2007.01.015"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1572272.1572294"},{"key":"e_1_3_2_1_14_1","unstructured":"Hpc; coverate tool for Haskell. https:\/\/wiki.haskell.org\/Haskell program coverage accessed on 2016-03-07."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2642937.2643001"},{"key":"e_1_3_2_1_16_1","unstructured":"MDevel:Cover; coverage tool for Perl. http:\/\/search.cpan.org\/ pjcj\/Devel-Cover- 1.20\/lib\/Devel\/Cover.pm accessed on 2016-03-07."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2015.2415793"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556782"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1883612.1883618"},{"key":"e_1_3_2_1_20_1","unstructured":"Perl Power Tools. http:\/\/perlpowertools.com accessed on 2016-03-07."},{"key":"e_1_3_2_1_21_1","unstructured":"Coverage tool for Python. https:\/\/wiki.python.org\/moin\/CodeCoverage accessed on 2016-03-07."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806799.1806864"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","unstructured":"V. Rijsbergen. Cj information retrieval. 1979.","DOI":"10.5555\/539927"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985856"},{"key":"e_1_3_2_1_25_1","unstructured":"SLOCCount. http:\/\/www.dwheeler.com\/sloccount accessed on 2015-03-07."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2337223.2337329"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2013.55"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.979992"},{"key":"e_1_3_2_1_29_1","unstructured":"T. Th\u00fcm S. Apel C. K\u00e4stner M. Kuhlemann I. Schaefer and G. Saake. Analysis strategies for software product lines. School of Computer Science University of Magdeburg Tech. Rep. FIN-004-2012 2012."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/2818754.2818779"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2006.8"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2010.50"},{"key":"e_1_3_2_1_33_1","unstructured":"Introduction iGen Algorithm Subject Programs Evaluation RQ1: Correctness RQ2: Performance RQ3: Analysis Threats to Validity Related Work Conclusion ACKNOWLEDGMENTS References"}],"event":{"name":"FSE'16: 24nd ACM SIGSOFT International Symposium on the Foundations of Software Engineering","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"Seattle WA USA","acronym":"FSE'16"},"container-title":["Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2950290.2950311","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2950290.2950311","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2950290.2950311","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:38:40Z","timestamp":1763458720000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2950290.2950311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":33,"alternative-id":["10.1145\/2950290.2950311","10.1145\/2950290"],"URL":"https:\/\/doi.org\/10.1145\/2950290.2950311","relation":{},"subject":[],"published":{"date-parts":[[2016,11]]},"assertion":[{"value":"2016-11-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}