Test case prioritization based on information retrieval concepts정보검색기법을 활용한 테스트케이스 우선순위 기법

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 1152
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorKo, In-Young-
dc.contributor.advisor고인영-
dc.contributor.advisorGregg Rothermel-
dc.contributor.advisor그레그 로더멜-
dc.contributor.authorKwon, Jung-Hyun-
dc.contributor.author권정현-
dc.date.accessioned2015-04-23T07:06:27Z-
dc.date.available2015-04-23T07:06:27Z-
dc.date.issued2014-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=569161&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/197107-
dc.description학위논문(석사) - 한국과학기술원 : 웹사이언스공학전공, 2014.2, [ 47 p. ]-
dc.description.abstractTest case prioritization is one of the techniques used in regression testing. This technique determines an execution order of test cases in test suites so that the scheduled test cases can achieve certain goals such as maximizing code coverage or increasing fault detection rate. Traditionally, code coverage based prioritization techniques such as statement and method coverage have been used. These techniques are effective because a test case covering many lines is likely to execute many faulty lines. Therefore, there has been much research on coverage based prioritization techniques. However, there has been less research focusing on less tested code. Faults in the code might not be detected fast when coverage-based techniques are used. Also, there are faults that even a test case covering many lines cannot detect. These issues can be limitations of the existing coverage based prioritization techniques. This work, involving research overcoming the limitation of the coverage based techniques, utilizes Term Frequency (TF) and Inverted Document Frequency (IDF), which are document modeling concepts in the Information Retrieval (IR) field. In this work, an effective prioritization technique is suggested with the TF/IDF scores. This work explains how TF/IDF can fit into test case prioritization. The proposed approach gives TF and IDF scores to each covered element such as a line or branch. Then, each test case that covers the elements has TF/IDF scores. Next, the proposed approach schedules the test cases by using a combination of the total TF/IDF scores and the coverage scores of the test cases. To determine appropriate weights between TF/IDF and coverage scores, a set of mutants are used as training data. In our study, five open source applications are evaluated. The proposed approach is compared to baseline approaches such as a random ordering, statement, branch and additional statement techniques. The results demonstrate that the proposed approach is generally mo...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectTest Case Prioritization-
dc.subjectInformation Retrieval-
dc.subject소프트웨어 테스팅-
dc.subject테스트케이스 우선순위 기법-
dc.subjectSoftware Testing-
dc.subject정보검색-
dc.titleTest case prioritization based on information retrieval concepts-
dc.title.alternative정보검색기법을 활용한 테스트케이스 우선순위 기법-
dc.typeThesis(Master)-
dc.identifier.CNRN569161/325007 -
dc.description.department한국과학기술원 : 웹사이언스공학전공, -
dc.identifier.uid020123041-
dc.contributor.localauthorKo, In-Young-
dc.contributor.localauthor고인영-
dc.contributor.localauthorGregg Rothermel-
dc.contributor.localauthor그레그 로더멜-
Appears in Collection
WST-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0