{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:39:12Z","timestamp":1742945952335,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030799861"},{"type":"electronic","value":"9783030799878"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79987-8_40","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"571-586","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Heuristically Enhanced IPO Algorithms for Covering Array Generation"],"prefix":"10.1007","author":[{"given":"Michael","family":"Wagner","sequence":"first","affiliation":[]},{"given":"Ludwig","family":"Kampel","sequence":"additional","affiliation":[]},{"given":"Dimitris E.","family":"Simos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"issue":"4","key":"40_CR1","doi-asserted-by":"publisher","first-page":"1330","DOI":"10.1016\/j.asoc.2011.11.029","volume":"12","author":"BS Ahmed","year":"2012","unstructured":"Ahmed, B.S., Zamli, K.Z., Lim, C.P.: Application of particle swarm optimization to uniform and variable strength covering array construction. Appl. Soft Comput. 12(4), 1330\u20131347 (2012)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"40_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1002\/stvr.393","volume":"19","author":"RC Bryce","year":"2009","unstructured":"Bryce, R.C., Colbourn, C.J.: A density-based greedy algorithm for higher strength covering arrays. Softw. Test. Verif. Reliab. 19(1), 37\u201353 (2009)","journal-title":"Softw. Test. Verif. Reliab."},{"issue":"3","key":"40_CR3","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1214\/aoms\/1177729387","volume":"23","author":"KA Bush","year":"1952","unstructured":"Bush, K.A., et al.: Orthogonal arrays of index unity. Ann. Math. Stat. 23(3), 426\u2013434 (1952)","journal-title":"Ann. Math. Stat."},{"issue":"7","key":"40_CR4","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1109\/32.605761","volume":"23","author":"DM Cohen","year":"1997","unstructured":"Cohen, D.M., Dalal, S.R., Fredman, M.L., Patton, G.C.: The AETG system: an approach to testing based on combinatorial design. IEEE Trans. Softw. Eng. 23(7), 437\u2013444 (1997)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"40_CR5","unstructured":"Colbourn, C.J.: Covering Array Tables for t = 2, 3, 4, 5, 6. http:\/\/www.public.asu.edu\/~ccolbou\/src\/tabby\/catable.html. Accessed 28 July 2020"},{"issue":"4","key":"40_CR6","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/s10623-017-0369-x","volume":"86","author":"CJ Colbourn","year":"2018","unstructured":"Colbourn, C.J., Lanus, E., Sarkar, K.: Asymptotic and constructive methods for covering perfect hash families and covering arrays. Des. Codes Cryptogr. 86(4), 907\u2013937 (2018)","journal-title":"Des. Codes Cryptogr."},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"Duan, F., Lei, Y., Yu, L., Kacker, R.N., Kuhn, D.R.: Improving IPOG\u2019s vertical growth based on a graph coloring scheme. In: 2015 IEEE Eighth International Conference on Software Testing, Verification and Validation Workshops (ICSTW), pp. 1\u20138 (2015)","DOI":"10.1109\/ICSTW.2015.7107444"},{"issue":"5","key":"40_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.6028\/jres.113.022","volume":"113","author":"M Forbes","year":"2008","unstructured":"Forbes, M., Lawrence, J., Lei, Y., Kacker, R.N., Kuhn, D.R.: Refining the in-parameter-order strategy for constructing covering arrays. J. Res. Natl. Inst. Stand. Technol. 113(5), 287 (2008)","journal-title":"J. Res. Natl. Inst. Stand. Technol."},{"issue":"2","key":"40_CR9","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10601-006-7094-9","volume":"11","author":"B Hnich","year":"2006","unstructured":"Hnich, B., Prestwich, S.D., Selensky, E., Smith, B.M.: Constraint models for the covering test problem. Constraints 11(2), 199\u2013219 (2006)","journal-title":"Constraints"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"Jarman, D., et al.: Applying combinatorial testing to large-scale data processing at adobe. In: 2019 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW), pp. 190\u2013193 (2019)","DOI":"10.1109\/ICSTW.2019.00051"},{"issue":"6","key":"40_CR11","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1007\/s11590-019-01459-0","volume":"14","author":"L Kampel","year":"2020","unstructured":"Kampel, L., Leithner, M., Simos, D.E.: Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm. Optim. Lett. 14(6), 1543\u20131556 (2020)","journal-title":"Optim. Lett."},{"key":"40_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.tcs.2019.10.019","volume":"800","author":"L Kampel","year":"2019","unstructured":"Kampel, L., Simos, D.E.: A survey on the state of the art of complexity problems for covering arrays. Theor. Comput. Sci. 800, 107\u2013124 (2019)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"40_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s11786-017-0326-0","volume":"12","author":"K Kleine","year":"2018","unstructured":"Kleine, K., Simos, D.E.: An efficient design and implementation of the in-parameter-order algorithm. Math. Comput. Sci. 12(1), 51\u201367 (2018)","journal-title":"Math. Comput. Sci."},{"key":"40_CR14","unstructured":"Kuhn, D., Kacker, R., Lei, Y.: Introduction to Combinatorial Testing. Chapman & Hall\/CRC. Innovations in Software Engineering and Software Development Series. Taylor & Francis (2013)"},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"Lei, Y., Kacker, R., Kuhn, D.R., Okun, V., Lawrence, J.: IPOG: a general strategy for t-way software testing. In: 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS 2007), pp. 549\u2013556 (March 2007)","DOI":"10.1109\/ECBS.2007.47"},{"key":"40_CR16","unstructured":"Lei, Y., Tai, K.C.: In-parameter-order: a test generation strategy for pairwise testing. In: Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No. 98EX231), pp. 254\u2013261 (November 1998)"},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"Leithner, M., Kleine, K., Simos, D.E.: CAmetrics: a tool for advanced combinatorial analysis and measurement of test sets. In: 2018 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW), pp. 318\u2013327 (2018)","DOI":"10.1109\/ICSTW.2018.00067"},{"key":"40_CR18","unstructured":"Forbes, M., Lawrence, J., Lei, Y., Kacker, R., Kuhn, D.: NIST repository of CAs. https:\/\/math.nist.gov\/coveringarrays\/ipof\/ipof-results.html"},{"issue":"9","key":"40_CR19","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1109\/TSE.2015.2421279","volume":"41","author":"J Petke","year":"2015","unstructured":"Petke, J., Cohen, M.B., Harman, M., Yoo, S.: Practical combinatorial interaction testing: empirical findings on efficiency and early fault detection. IEEE Trans. Softw. Eng. 41(9), 901\u2013924 (2015)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"40_CR20","unstructured":"Shiba, T., Tsuchiya, T., Kikuno, T.: Using artificial life techniques to generate test cases for combinatorial testing. In: Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004, COMPSAC 2004, vol. 1, pp. 72\u201377 (2004)"},{"key":"40_CR21","doi-asserted-by":"publisher","first-page":"42774","DOI":"10.1109\/ACCESS.2019.2907057","volume":"7","author":"J Torres-Jimenez","year":"2019","unstructured":"Torres-Jimenez, J., Izquierdo-Marquez, I., Avila-George, H.: Methods to construct uniform covering arrays. IEEE Access 7, 42774\u201342797 (2019)","journal-title":"IEEE Access"},{"key":"40_CR22","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-319-26285-7_17","volume-title":"Trends and Applications in Software Engineering","author":"J Torres-Jimenez","year":"2016","unstructured":"Torres-Jimenez, J., Avila-George, H.: Search-based software engineering to construct binary test-suites. In: Mejia, J., Mu\u00f1oz, M., Rocha, \u00c1., Calvo-Manzano, J. (eds.) Trends and Applications in Software Engineering. AISC, vol. 405, pp. 201\u2013212. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-26285-7_17"},{"issue":"1","key":"40_CR23","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.trit.2016.12.006","volume":"2","author":"J Torres-Jimenez","year":"2017","unstructured":"Torres-Jimenez, J., Rodriguez-Cristerna, A.: Metaheuristic post-optimization of the NIST repository of covering arrays. CAAI Trans. Intell. Technol. 2(1), 31\u201338 (2017)","journal-title":"CAAI Trans. Intell. Technol."},{"issue":"1","key":"40_CR24","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.ins.2011.09.020","volume":"185","author":"J Torres-Jimenez","year":"2012","unstructured":"Torres-Jimenez, J., Rodriguez-Tello, E.: New bounds for binary covering arrays using simulated annealing. Inf. Sci. 185(1), 137\u2013152 (2012)","journal-title":"Inf. Sci."},{"key":"40_CR25","doi-asserted-by":"crossref","unstructured":"Wagner, M., Kleine, K., Simos, D.E., Kuhn, R., Kacker, R.: CAgen: a fast combinatorial test generation tool with support for constraints and higher-index arrays. In: 2020 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW), pp. 191\u2013200 (2020)","DOI":"10.1109\/ICSTW50294.2020.00041"},{"key":"40_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-030-43120-4_24","volume-title":"Mathematical Aspects of Computer and Information Sciences","author":"M Wagner","year":"2020","unstructured":"Wagner, M., Kampel, L., Simos, D.E.: IPO-Q: a quantum-inspired approach to\u00a0the IPO strategy used in CA generation. In: Slamanig, D., Tsigaridas, E., Zafeirakopoulos, Z. (eds.) MACIS 2019. LNCS, vol. 11989, pp. 313\u2013323. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43120-4_24"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79987-8_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:15:53Z","timestamp":1625008553000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ottawa, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2021.eecs.uottawa.ca\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"107","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The workshop was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}