Transcription of Code Coverage Analysis of Combinatorial Testing
{{id}} {{{paragraph}}}
code Coverage Analysis of Combinatorial TestingEun-Hye Choi , Osamu Mizuno , Yifan Hu National Institute of Advanced Industrial Science and Technology (AIST), Ikeda, JapanEmail: Kyoto Institute of Technology, Kyoto, JapanEmail: Combinatorialt-way Testing with smalltis known asan e cient black-box Testing technique to detect parameter inter-action failures. So far, several empirical studies have reported thee ectiveness oft-way Testing on fault detection abilities. However,few studies have investigated the e ectiveness oft-way testingoncodecoverage, which is one of the most important coveragecriteria widely used for software Testing . This paper presents aquantitative Analysis to evaluate the code - Coverage e ectivenessoft-way Testing . Using three open source utility programs, wecomparet-way Testing with exhaustive (all combination) testingw. r. t. code Coverage and test suite Testing ;t-way Testing ; Exhaustive test-ing; code Coverage ; Line Coverage ; Branch IntroductionCombinatorial Testing [15], [20] is a common black-boxtesting to detect failures caused by parameter software systems have a lot of parameters, and thustheir interactions are too numerous to be exhaustively Testing [15], [20], wheretis called aninteraction strength, addresses this problem by Testing all valuecombinations oftparameters with smallt, instead of Testing allparameter-value combi
Code Coverage Analysis of Combinatorial Testing Eun-Hye Choi⇤, Osamu Mizuno†, Yifan Hu† ⇤ National Institute of Advanced Industrial Science and Technology (AIST), Ikeda, Japan Email: e.choi@aist.go.jp † Kyoto Institute of Technology, Kyoto, Japan Email: o-mizuno@kit.ac.jp, y-hu@se.is.kit.ac.jp Abstract—Combinatorial t-way testing with small t is known as
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}