{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:36:16Z","timestamp":1725561376745},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206958"},{"type":"electronic","value":"9783540245872"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24587-2_32","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:59:19Z","timestamp":1280393959000},"page":"300-308","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Algorithms for Generation of Combinatorial Covering Suites"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF00264296","volume":"20","author":"A.K. Chandra","year":"1983","unstructured":"Chandra, A.K., Kou, L.T., Markowsky, G., Zaks, S.: On sets of boolean n-vectors with all k-projections surjective. Acta Informatica\u00a020, 103\u2013111 (1983)","journal-title":"Acta Informatica"},{"key":"32_CR2","unstructured":"Cheng, C., Dumitrescu, A., Schroeder, P.: Generating small test suites for nonuniform instances. In: Third International Conference on Quality Software (QSIC 2003), Dallas (November 2003) (accepted)"},{"issue":"7","key":"32_CR3","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1109\/32.605761","volume":"23","author":"D.M. 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 Transactions on Software Engineering\u00a023(7), 437\u2013444 (1997)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"32_CR4","first-page":"303","volume-title":"Proceedings of the 5-th International Symposium on Software Reliability Engineering","author":"D.M. Cohen","year":"1994","unstructured":"Cohen, D.M., Dalal, S.R., Kajla, A., Patton, G.C.: The automatic efficient test generator (AETG) system. In: Proceedings of the 5-th International Symposium on Software Reliability Engineering, pp. 303\u2013309. IEEE, Los Alamitos (1994)"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/52.536462","volume":"13","author":"D.M. Cohen","year":"1996","unstructured":"Cohen, D.M., Dalal, S.R., Parelius, J., Patton, G.C.: The combinatorial design approach to automatic test generation. IEEE Software\u00a013, 83\u201389 (1996)","journal-title":"IEEE Software"},{"issue":"6","key":"32_CR6","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1002\/(SICI)1520-6610(1998)6:6<411::AID-JCD3>3.0.CO;2-I","volume":"6","author":"D.M. Cohen","year":"1998","unstructured":"Cohen, D.M., Fredman, M.L.: New techniques for designing qualitatively independent systems. Journal of Combinatorial Designs\u00a06(6), 411\u2013416 (1998)","journal-title":"Journal of Combinatorial Designs"},{"issue":"3","key":"32_CR7","doi-asserted-by":"publisher","first-page":"234","DOI":"10.2307\/1271179","volume":"40","author":"S.R. Dalal","year":"1998","unstructured":"Dalal, S.R., Mallows, C.M.: Factor-covering designs for testing software. Technometrics\u00a040(3), 234\u2013243 (1998)","journal-title":"Technometrics"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01195325","volume":"9","author":"L. Gargano","year":"1993","unstructured":"Gargano, L., K\u00f6rner, J., Vaccaro, U.: Sperner capacities. Graphs and Combinatorics\u00a09, 31\u201346 (1993)","journal-title":"Graphs and Combinatorics"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1017\/S0963548300001905","volume":"5","author":"A.P. Godbole","year":"1996","unstructured":"Godbole, A.P., Skipper, D.E., Sunley, R.A.: t-Covering arrays: upper bounds and Poisson approximations. Combinatorics, Probability and Computing\u00a05, 105\u2013117 (1996)","journal-title":"Combinatorics, Probability and Computing"},{"key":"32_CR10","unstructured":"Hartman, A.: Software and hardware testing using combinatorial covering suites. In: Golumbic, M. (ed.) Interdisciplinary Applications of Graph Theory, Combinatorics and Algorithms, manuscript (July 2002)"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF02018457","volume":"3","author":"G.O.H. Katona","year":"1973","unstructured":"Katona, G.O.H.: Two applications (for search theory and truth functions) of Sperner type theorems. Periodica Mathematica Hungarica\u00a03, 19\u201326 (1973)","journal-title":"Periodica Mathematica Hungarica"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0012-365X(73)90098-8","volume":"6","author":"D.J. Kleitman","year":"1973","unstructured":"Kleitman, D.J., Spencer, J.: Families of k-independent sets. Discrete Mathematics\u00a06, 255\u2013262 (1973)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"32_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0020-0190(01)00195-8","volume":"81","author":"N. Kobayashi","year":"2002","unstructured":"Kobayashi, N., Tsuchiya, T., Kikuno, T.: A new method for constructing pairwise covering designs for software testing. Information Processing Letters\u00a081(2), 85\u201391 (2002)","journal-title":"Information Processing Letters"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: Proceedings of the 36-th Annual Symposium on Foundations of Computer Science (FOCS), pp. 182\u2013191 (1995)","DOI":"10.1109\/SFCS.1995.492475"},{"key":"32_CR15","volume-title":"Foundations of Probability","author":"A. R\u00e9nyi","year":"1971","unstructured":"R\u00e9nyi, A.: Foundations of Probability. Wiley, New york (1971)"},{"issue":"3","key":"32_CR16","doi-asserted-by":"publisher","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 digital circuits. IEEE Transactions on Information Theory\u00a034(3), 513\u2013522 (1988)","journal-title":"IEEE Transactions on Information Theory"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/jcd.3180010106","volume":"1","author":"N.J.A. Sloane","year":"1993","unstructured":"Sloane, N.J.A.: Covering arrays and intersecting codes. Journal of Combinatorial Designs\u00a01, 51\u201363 (1993)","journal-title":"Journal of Combinatorial Designs"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24587-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T15:05:22Z","timestamp":1552835122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24587-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206958","9783540245872"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24587-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}