{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:52:43Z","timestamp":1744217563621},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,12,8]],"date-time":"2017-12-08T00:00:00Z","timestamp":1512691200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s11786-017-0326-0","type":"journal-article","created":{"date-parts":[[2017,12,8]],"date-time":"2017-12-08T05:39:47Z","timestamp":1512711587000},"page":"51-67","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["An Efficient Design and Implementation of the In-Parameter-Order Algorithm"],"prefix":"10.1007","volume":"12","author":[{"given":"Kristoffer","family":"Kleine","sequence":"first","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":[[2017,12,8]]},"reference":[{"key":"326_CR1","doi-asserted-by":"crossref","unstructured":"Bozic, J., Garn, B., Simos, D.E., Wotawa, F.: Evaluation of the IPO-family algorithms for test case generation in web security testing. In: 2015 IEEE Eighth International Conference on Software Testing, Verification and Validation Workshops (ICSTW), pp. 1\u201310. IEEE (2015)","DOI":"10.1109\/ICSTW.2015.7107436"},{"issue":"3","key":"326_CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/stvr.365","volume":"17","author":"RC Bryce","year":"2007","unstructured":"Bryce, R.C., Colbourn, C.J.: The density algorithm for pairwise interaction testing. Softw. Test. Verif. Reliab. 17(3), 159\u2013182 (2007)","journal-title":"Softw. Test. Verif. Reliab."},{"issue":"1","key":"326_CR3","doi-asserted-by":"crossref","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":"7","key":"326_CR4","doi-asserted-by":"crossref","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":"326_CR5","doi-asserted-by":"crossref","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":"326_CR6","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. IEEE (2015)","DOI":"10.1109\/ICSTW.2015.7107444"},{"issue":"5","key":"326_CR7","doi-asserted-by":"crossref","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":"5","key":"326_CR8","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1007\/s11390-015-1574-6","volume":"30","author":"S-W Gao","year":"2015","unstructured":"Gao, S.-W., Lv, J.-H., Bing-Lei, D., Colbourn, C.J., Ma, S.-L.: Balancing frequencies and fault detection in the in-parameter-order algorithm. J. Comput. Sci. Technol. 30(5), 957\u2013968 (2015)","journal-title":"J. Comput. Sci. Technol."},{"key":"326_CR9","doi-asserted-by":"crossref","unstructured":"Gao, S., Lv, J., Du, B., Jiang, Y., Ma, S.: General optimization strategies for refining the in-parameter-order algorithm. In: 2014 14th International Conference on Quality Software (QSIC), pp. 21\u201326. IEEE (2014)","DOI":"10.1109\/QSIC.2014.15"},{"issue":"1","key":"326_CR10","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.disc.2003.11.029","volume":"284","author":"A Hartman","year":"2004","unstructured":"Hartman, A., Raskin, L.: Problems and algorithms for covering arrays. Discret. Math. 284(1), 149\u2013156 (2004)","journal-title":"Discret. Math."},{"key":"326_CR11","doi-asserted-by":"crossref","unstructured":"Kitsos, P., Simos, D.E., Torres-Jimenez, J., Voyiatzis, A.G.: Exciting FPGA cryptographic trojans using combinatorial testing. In: 2015 IEEE 26th International Symposium on Software Reliability Engineering (ISSRE), pp. 69\u201376. IEEE (2015)","DOI":"10.1109\/ISSRE.2015.7381800"},{"key":"326_CR12","doi-asserted-by":"crossref","unstructured":"Kleine, K., Simos, D.E.: Coveringcerts: combinatorial methods for x. 509 certificate testing. In: 2017 IEEE International Conference on Software Testing, Verification and Validation (ICST), pp. 69\u201379. IEEE (2017)","DOI":"10.1109\/ICST.2017.14"},{"key":"326_CR13","volume-title":"Combinatorial Algorithms: Generation, Enumeration, and Search","author":"DL Kreher","year":"1998","unstructured":"Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms: Generation, Enumeration, and Search, vol. 7. CRC Press, Boca Raton (1998)"},{"key":"326_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/bs.adcom.2015.05.003","volume":"99","author":"DR Kuhn","year":"2015","unstructured":"Kuhn, D.R., Bryce, R., Duan, F., Ghandehari, L.S., Lei, Y., Kacker, R.N.: Combinatorial testing: theory and practice. Adv. Comput. 99, 1\u201366 (2015)","journal-title":"Adv. Comput."},{"issue":"6","key":"326_CR15","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1109\/TSE.2004.24","volume":"30","author":"DR Kuhn","year":"2004","unstructured":"Kuhn, D.R., Wallace, D.R., Gallo, A.M.: Software fault interactions and implications for software testing. IEEE Trans. Softw. Eng. 30(6), 418\u2013421 (2004)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"326_CR16","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, 2007. ECBS\u201907, pp. 549\u2013556. IEEE (2007)","DOI":"10.1109\/ECBS.2007.47"},{"issue":"3","key":"326_CR17","doi-asserted-by":"crossref","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":"326_CR18","unstructured":"Lei, Y., Tai, K.-C.: In-parameter-order: a test generation strategy for pairwise testing. In: High-Assurance Systems Engineering Symposium, 1998. Proceedings. Third IEEE International, pp. 254\u2013261. IEEE (1998)"},{"issue":"3","key":"326_CR19","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1109\/18.6031","volume":"34","author":"G Seroussi","year":"1988","unstructured":"Seroussi, G., Bshouty, N.H.: Vector sets for exhaustive testing of logic circuits. IEEE Trans. Inf. Theory 34(3), 513\u2013522 (1988)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"326_CR20","doi-asserted-by":"crossref","unstructured":"Torres-Jimenez, J., Izquierdo-Marquez, I.: Survey of covering arrays. In: 2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pp. 20\u201327. IEEE (2013)","DOI":"10.1109\/SYNASC.2013.10"},{"issue":"3","key":"326_CR21","doi-asserted-by":"crossref","first-page":"388","DOI":"10.7763\/IJCTE.2011.V3.337","volume":"3","author":"MI Younis","year":"2011","unstructured":"Younis, M.I., Zamli, K.Z.: MIPOG-an efficient t-way minimization strategy for combinatorial testing. Int. J. Comput. Theory Eng. 3(3), 388 (2011)","journal-title":"Int. J. Comput. Theory Eng."},{"key":"326_CR22","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 (ICST), pp. 370\u2013375. IEEE (2013)","DOI":"10.1109\/ICST.2013.52"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-017-0326-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-017-0326-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-017-0326-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,24]],"date-time":"2018-02-24T03:13:03Z","timestamp":1519441983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-017-0326-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,8]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["326"],"URL":"https:\/\/doi.org\/10.1007\/s11786-017-0326-0","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,8]]}}}