%0 Conference Proceedings
%T A “Strength of Decision Tree Equivalence”-Taxonomy and Its Impact on Test Suite Reduction
%+ Graz University of Technology [Graz] (TU Graz)
%A Felbinger, Hermann
%A Pill, Ingo
%A Wotawa, Franz
%Z Part 4: Test Selection and Quality Estimation
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 29th IFIP International Conference on Testing Software and Systems (ICTSS)
%C St. Petersburg, Russia
%Y Nina Yevtushenko
%Y Ana Rosa Cavalli
%Y Hüsnü Yenigün
%I Springer International Publishing
%3 Testing Software and Systems
%V LNCS-10533
%P 197-212
%8 2017-10-09
%D 2017
%R 10.1007/978-3-319-67549-7_12
%K Test suite reduction
%K Decision tree equivalence
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Being able to reduce test suites without having to execute them for assessing the effects on their fault detection capabilities is quite appealing. In this direction, we proposed recently to characterize test suites via inferred decision trees and use these for comparisons in a reduction process. The equivalence relation underlying the comparisons plays obviously a significant role for the effectiveness achieved and efficiency experienced. In this paper, we explore five such relations that take different aspects into account and investigate their impact on test suite reduction, their effectiveness in fault detection, and computation time. We report corresponding results, and show as well as prove that the equivalence relations build a taxonomy.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01678986/document
%2 https://inria.hal.science/hal-01678986/file/449632_1_En_12_Chapter.pdf
%L hal-01678986
%U https://inria.hal.science/hal-01678986
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-ICTSS
%~ IFIP-LNCS-10533