{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:52Z","timestamp":1750306672846,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,12]],"date-time":"2014-07-12T00:00:00Z","timestamp":1405123200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,12]]},"DOI":"10.1145\/2576768.2598305","type":"proceedings-article","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T12:10:42Z","timestamp":1405080642000},"page":"1255-1262","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["A parallel evolutionary algorithm for prioritized pairwise testing of software product lines"],"prefix":"10.1145","author":[{"given":"Roberto Erick","family":"Lopez-Herrejon","sequence":"first","affiliation":[{"name":"Johannes Kepler University Linz, Linz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier","family":"Javier Ferrer","sequence":"additional","affiliation":[{"name":"Universidad de Malaga, Andalucia Tech, Spain, Malaga, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Chicano","sequence":"additional","affiliation":[{"name":"Universidad de Malaga, Andalucia Tech, Spain, Malaga, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evelyn Nicole","family":"Haslinger","sequence":"additional","affiliation":[{"name":"Johannes Kepler University Linz, Linz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Egyed","sequence":"additional","affiliation":[{"name":"Johannes Kepler University Linz, Linz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrique","family":"Alba","sequence":"additional","affiliation":[{"name":"Universidad de Malaga, Andalucia Tech, Spain, Malaga, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"Studies in Computational Intelligence","volume-title":"Parallel genetic algorithms","author":"Alba E.","year":"2011","unstructured":"E. Alba and G. Luque . Parallel genetic algorithms , volume 367 of Studies in Computational Intelligence . Springer-Verlag , 2011 . E. Alba and G. Luque. Parallel genetic algorithms, volume 367 of Studies in Computational Intelligence. Springer-Verlag, 2011."},{"key":"e_1_3_2_1_2_1","volume-title":"Softw. Test. Verif. Reliab","author":"Arcuri A.","year":"2012","unstructured":"A. Arcuri and L. Briand . A hitchhiker's guide to statistical tests for assessing randomized algorithms in software engineering . Softw. Test. Verif. Reliab , 2012 . A. Arcuri and L. Briand. A hitchhiker's guide to statistical tests for assessing randomized algorithms in software engineering. Softw. Test. Verif. Reliab, 2012."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2010.01.001"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2012-754"},{"key":"e_1_3_2_1_5_1","first-page":"425","volume-title":"MoDELS","author":"Cichos H.","year":"2011","unstructured":"H. Cichos , S. Oster , M. Lochau , and A. Schurr . Model-based coverage-driven test suite generation for software product lines . In MoDELS , pages 425 -- 439 , 2011 . H. Cichos, S. Oster, M. Lochau, and A. Schurr. Model-based coverage-driven test suite generation for software product lines. In MoDELS, pages 425--439, 2011."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2010.12.003"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2011.05.014"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2010.05.011"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31095-9_40"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330331"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-010-9135-7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2379776.2379787"},{"key":"e_1_3_2_1_13_1","volume-title":"Bypassing the combinatorial explosion: Using similarity to generate and prioritize t-wise test suites for large software product lines. CoRR, abs\/1211.5451","author":"Henard C.","year":"2012","unstructured":"C. Henard , M. Papadakis , G. Perrouin , J. Klein , P. Heymans , and Y. L. Traon . Bypassing the combinatorial explosion: Using similarity to generate and prioritize t-wise test suites for large software product lines. CoRR, abs\/1211.5451 , 2012 . C. Henard, M. Papadakis, G. Perrouin, J. Klein, P. Heymans, and Y. L. Traon. Bypassing the combinatorial explosion: Using similarity to generate and prioritize t-wise test suites for large software product lines. CoRR, abs\/1211.5451, 2012."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE.2011.31"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2362536.2362547"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33666-9_18"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSTW.2011.100"},{"key":"e_1_3_2_1_19_1","volume-title":"Software Product Line Online Tools(SPLOT)","author":"Mendonca M.","year":"2013","unstructured":"M. Mendonca . Software Product Line Online Tools(SPLOT) , 2013 . http:\/\/www.splot-research.org\/. M. Mendonca. Software Product Line Online Tools(SPLOT), 2013. http:\/\/www.splot-research.org\/."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2010.43"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-28901-1","volume-title":"Software Product Line Engineering: Foundations, Principles and Techniques","author":"Pohl K.","year":"2005","unstructured":"K. Pohl , G. Bockle , and F. J. van der Linden . Software Product Line Engineering: Foundations, Principles and Techniques . Springer , 2005 . K. Pohl, G. Bockle, and F. J. van der Linden. Software Product Line Engineering: Foundations, Principles and Techniques. Springer, 2005."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2012.07.020"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SPLC.2008.50"}],"event":{"name":"GECCO '14: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Vancouver BC Canada","acronym":"GECCO '14"},"container-title":["Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576768.2598305","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2576768.2598305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:00:53Z","timestamp":1750230053000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576768.2598305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,12]]},"references-count":22,"alternative-id":["10.1145\/2576768.2598305","10.1145\/2576768"],"URL":"https:\/\/doi.org\/10.1145\/2576768.2598305","relation":{},"subject":[],"published":{"date-parts":[[2014,7,12]]},"assertion":[{"value":"2014-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}