{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T16:35:39Z","timestamp":1726072539849},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030431198"},{"type":"electronic","value":"9783030431204"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43120-4_24","type":"book-chapter","created":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:13:56Z","timestamp":1584490436000},"page":"313-323","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["IPO-Q: A Quantum-Inspired Approach to\u00a0the IPO Strategy Used in CA Generation"],"prefix":"10.1007","author":[{"given":"Michael","family":"Wagner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ludwig","family":"Kampel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitris E.","family":"Simos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,18]]},"reference":[{"key":"24_CR1","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 18 Sept 2019"},{"key":"24_CR2","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010541","volume-title":"Handbook of Combinatorial Designs","author":"CJ Colbourn","year":"2006","unstructured":"Colbourn, C.J., Dinitz, J.H.: Handbook of Combinatorial Designs. CRC Press, Boca Raton (2006)"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Ghandehari, L.S.G., Bourazjany, M.N., Lei, Y., Kacker, R.N., Kuhn, D.R.: Applying combinatorial testing to the siemens suite. In: 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation Workshops, pp. 362\u2013371, March 2013","DOI":"10.1109\/ICSTW.2013.47"},{"key":"24_CR4","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":"24_CR5","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":"24_CR6","unstructured":"Kuhn, D., Kacker, R., Lei, Y.: Introduction to Combinatorial Testing. Chapman & Hall\/CRC Innovations in Software Engineering and Software Development Series. Taylor & Francis, London (2013)"},{"key":"24_CR7","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"},{"issue":"3","key":"24_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/stvr.381","volume":"18","author":"Y Lei","year":"2008","unstructured":"Lei, Y., Kacker, R., Kuhn, D.R., Okun, V., Lawrence, J.: IPOG\/IPOG-D: efficient test generation for multi-way combinatorial testing. Softw. Test. Verif. Reliab. 18(3), 125\u2013148 (2008)","journal-title":"Softw. Test. Verif. Reliab."},{"key":"24_CR9","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":"24_CR10","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) (to appear)","DOI":"10.1109\/ICSTW50294.2020.00041"},{"key":"24_CR11","unstructured":"NIST: Covering arrays generated by IPOG-F. National Institute of Standards and Technology. https:\/\/math.nist.gov\/coveringarrays\/ipof\/ipof-results.html . Accessed 18 Sept 2019"},{"key":"24_CR12","unstructured":"Smith, R., 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, April 2019"},{"key":"24_CR13","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"},{"issue":"1","key":"24_CR14","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":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-030-34029-2_20","volume-title":"Analysis of Experimental Algorithms","author":"M Wagner","year":"2019","unstructured":"Wagner, M., Kampel, L., Simos, D.E.: Quantum-inspired evolutionary algorithms for covering arrays of arbitrary strength. In: Kotsireas, I., Pardalos, P., Parsopoulos, K.E., Souravlias, D., Tsokas, A. (eds.) SEA 2019. LNCS, vol. 11544, pp. 300\u2013316. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34029-2_20"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Yu, L., Lei, Y., Kacker, R.N., Kuhn, D.R.: ACTS: a combinatorial test generation tool. In: 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation, pp. 370\u2013375, March 2013","DOI":"10.1109\/ICST.2013.52"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43120-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T20:19:53Z","timestamp":1614889193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43120-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030431198","9783030431204"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43120-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Aspects of Computer and Information Sciences","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gebze","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turkey","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icmacis2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/macis2019.gtu.edu.tr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"66","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":"22","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":"14","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":"33% - 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":"2,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":"5,8","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)"}}]}}