earticle

논문검색

Bi-objective Test Case Selection using Abstract Snytax Tree and Tree Matching

초록

영어

Software testing is a vital activity during software production to detect faults and to guarantee that the software is working properly as per the requirements.Regression testing is an activity that is carried out during the maintenance phase to ensure the quality and reliability after altering the existing version of the software. There are many techniques for performing regression testing. They are re-test all, test case minimization, test case selection and test case prioritization.The aim of this paper is to select a subset of test cases which should be run when there are siginificant changes in the original program. To extract the subset of test cases, a novel method is adopted in this research which uses executable backward static slicing.The program slices are converted into abstract syntax tree and then compared using modified simple tree matching algorithm to obtain the subset of test cases.It is clear from the result obtained that this method is very significant.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Methodology
  3.1. Program Formatting
  3.2. Program Slicing
  3.3. Generation of Abstract Syntax Tree
  3.4. Tree Matching
  3.5. Test Case Selection
 4. Experiments and Results
 5. Conclusion
 References

저자정보

  • R. Beena Research Scholar, Dept. of Information Technology, Bharathiar University, India
  • S. Sarala Assistant Professor, Dept. of Information Technology, Bharathiar University, India

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.