{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:33:21Z","timestamp":1743093201777,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319675480"},{"type":"electronic","value":"9783319675497"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-67549-7_12","type":"book-chapter","created":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T12:56:18Z","timestamp":1505393778000},"page":"197-212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A \u201cStrength of Decision Tree Equivalence\u201d-Taxonomy and Its Impact on Test Suite Reduction"],"prefix":"10.1007","author":[{"given":"Hermann","family":"Felbinger","sequence":"first","affiliation":[]},{"given":"Ingo","family":"Pill","sequence":"additional","affiliation":[]},{"given":"Franz","family":"Wotawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,15]]},"reference":[{"issue":"3","key":"12_CR1","first-page":"289","volume":"35","author":"S Biswas","year":"2011","unstructured":"Biswas, S., Mall, R., Satpathy, M., Sukumaran, S.: Regression test selection techniques: a survey. Informatica 35(3), 289\u2013321 (2011)","journal-title":"Informatica"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0269888997000015","volume":"12","author":"LA Breslow","year":"1997","unstructured":"Breslow, L.A., Aha, D.W.: Simplifying decision trees: a survey. Knowl. Eng. Rev. 12(1), 1\u201340 (1997)","journal-title":"Knowl. Eng. Rev."},{"doi-asserted-by":"crossref","unstructured":"Briand, L.C., Labiche, Y., Bawar, Z.: Using machine learning to refine black-box test specifications and test suites. In: 8th International Conference on Quality Software, pp. 135\u2013144 (2008)","key":"12_CR3","DOI":"10.1109\/QSIC.2008.5"},{"issue":"3","key":"12_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0020-0190(96)00135-4","volume":"60","author":"TY Chen","year":"1996","unstructured":"Chen, T.Y., Lau, M.F.: Dividing strategies for the optimization of a test suite. Inf. Process. Lett. 60(3), 135\u2013141 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"12_CR5","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1145\/96559.96576","volume":"37","author":"JRB Cockett","year":"1990","unstructured":"Cockett, J.R.B., Herrera, J.A.: Decision tree reduction. J. ACM 37(4), 815\u2013842 (1990)","journal-title":"J. ACM"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0304-3975(87)90130-7","volume":"54","author":"J Cockett","year":"1987","unstructured":"Cockett, J.: Discrete decision theory: manipulations. Theor. Comput. Sci. 54(2), 215\u2013236 (1987)","journal-title":"Theor. Comput. Sci."},{"unstructured":"Dattatreya, G., Kanal, L.: Decision trees in pattern recognition. In: Progress in Pattern Recognition 2, pp. 189\u2013240. Elsevier Science Publishers B.V. (1985)","key":"12_CR7"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L De Moura","year":"2008","unstructured":"De Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-78800-3_24"},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/C-M.1978.218136","volume":"11","author":"RA DeMillo","year":"1978","unstructured":"DeMillo, R.A., Lipton, R.J., Sayward, F.G.: Hints on test data selection: help for the practicing programmer. Computer 11(4), 34\u201341 (1978)","journal-title":"Computer"},{"doi-asserted-by":"crossref","unstructured":"Felbinger, H., Wotawa, F., Nica, M.: Test-suite reduction does not necessarily require executing the program under test. In: International Conference on Software Quality, Reliability and Security Companion, pp. 23\u201330 (2016)","key":"12_CR10","DOI":"10.1109\/QRS-C.2016.8"},{"doi-asserted-by":"crossref","unstructured":"Felbinger, H., Wotawa, F., Nica, M.: Empirical study of correlation between mutation score and model inference based test suite adequacy assessment. In: 11th International Workshop on Automation of Software Test, pp. 43\u201349 (2016)","key":"12_CR11","DOI":"10.1145\/2896921.2896923"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-71289-3_23","volume-title":"Fundamental Approaches to Software Engineering","author":"G Fraser","year":"2007","unstructured":"Fraser, G., Wotawa, F.: Redundancy based test-suite reduction. In: Dwyer, M.B., Lopes, A. (eds.) FASE 2007. LNCS, vol. 4422, pp. 291\u2013305. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-71289-3_23"},{"doi-asserted-by":"crossref","unstructured":"Gotlieb, A., Marijan, D.: Flower: Optimal test suite reduction as a network maximum flow. In: 2014 International Symposium on Software Testing and Analysis (ISSTA), pp. 171\u2013180 (2014)","key":"12_CR13","DOI":"10.1145\/2610384.2610416"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M Hall","year":"2009","unstructured":"Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: The weka data mining software: an update. SIGKDD Explor. Newsl. 11(1), 10\u201318 (2009)","journal-title":"SIGKDD Explor. Newsl."},{"issue":"3","key":"12_CR15","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1145\/152388.152391","volume":"2","author":"MJ Harrold","year":"1993","unstructured":"Harrold, M.J., Gupta, R., Soffa, M.L.: A methodology for controlling the size of a test suite. ACM Trans. Softw. Eng. Methodol. (TOSEM) 2(3), 270\u2013285 (1993)","journal-title":"ACM Trans. Softw. Eng. Methodol. (TOSEM)"},{"key":"12_CR16","series-title":"Springer Series in Statistics","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The Elements of Statistical Learning","author":"T Hastie","year":"2009","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning. Springer Series in Statistics. Springer, New York (2009). doi:10.1007\/978-0-387-84858-7"},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","volume":"5","author":"L Hyafil","year":"1976","unstructured":"Hyafil, L., Rivest, R.: Constructing optimal binary decision trees is NP-complete. Inf. Process. Lett. 5(1), 15\u201317 (1976)","journal-title":"Inf. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"Just, R.: The major mutation framework: efficient and scalable mutation analysis for Java. In: Proceedings of the 2014 International Symposium on Software Testing and Analysis, pp. 433\u2013436. ACM (2014)","key":"12_CR18","DOI":"10.1145\/2610384.2628053"},{"key":"12_CR19","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Boston (1972). doi:10.1007\/978-1-4684-2001-2_9"},{"key":"12_CR20","volume-title":"Machine Learning","author":"TM Mitchell","year":"1997","unstructured":"Mitchell, T.M.: Machine Learning, vol. 8. McGraw-Hill, Boston (1997)"},{"issue":"4","key":"12_CR21","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1145\/356893.356898","volume":"14","author":"BM Moret","year":"1982","unstructured":"Moret, B.M.: Decision trees and diagrams. ACM Comput. Surv. (CSUR) 14(4), 593\u2013623 (1982)","journal-title":"ACM Comput. Surv. (CSUR)"},{"unstructured":"Offutt, A.J., Pan, J., Voas, J.M.: Procedures for reducing the size of coverage-based test sets. In: Proceedings of the 12th International Conference on Testing Computer Software, pp. 111\u2013123. ACM (1995)","key":"12_CR22"},{"issue":"6","key":"12_CR23","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1145\/62959.62964","volume":"31","author":"TJ Ostrand","year":"1988","unstructured":"Ostrand, T.J., Balcer, M.J.: The category-partition method for specifying and generating fuctional tests. Commun. ACM 31(6), 676\u2013686 (1988)","journal-title":"Commun. ACM"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-642-28872-2_29","volume-title":"Fundamental Approaches to Software Engineering","author":"M Polo Usaola","year":"2012","unstructured":"Polo Usaola, M., Reales Mateo, P., P\u00e9rez Lamancha, B.: Reduction of test suites using mutation. In: de Lara, J., Zisman, A. (eds.) FASE 2012. LNCS, vol. 7212, pp. 425\u2013438. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-28872-2_29"},{"key":"12_CR25","volume-title":"C4.5: Programs for Machine Learning","author":"JR Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers Inc., San Francisco (1993)"},{"issue":"3","key":"12_CR26","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1109\/21.97458","volume":"21","author":"SR Safavian","year":"1991","unstructured":"Safavian, S.R., Landgrebe, D.: A survey of decision tree classifier methodology. IEEE Trans. Syst. Man Cybern. 21(3), 660\u2013674 (1991)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"2","key":"12_CR27","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1002\/stv.430","volume":"22","author":"S Yoo","year":"2012","unstructured":"Yoo, S., Harman, M.: Regression testing minimization, selection and prioritization: a survey. Softw. Test. Verif. Reliab. 22(2), 67\u2013120 (2012)","journal-title":"Softw. Test. Verif. Reliab."},{"unstructured":"Zantema, H.: Decision trees: equivalence and propositional operations. In: 10th Netherlands\/Belgium Conference on AI (NAIC), pp. 157\u2013166 (1998)","key":"12_CR28"},{"issue":"2","key":"12_CR29","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1142\/S0129054100000193","volume":"11","author":"H Zantema","year":"2000","unstructured":"Zantema, H., Bodlaender, H.L.: Finding small equivalent decision trees is hard. Int. J. Found. Comput. Sci. 11(2), 343\u2013354 (2000)","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Testing Software and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67549-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,25]],"date-time":"2021-09-25T02:37:10Z","timestamp":1632537430000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-67549-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319675480","9783319675497"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67549-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"15 September 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Testing Software and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pts2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ictss2017.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}