Earticle

현재 위치 Home

Regression Test Cases Minimization for Object Oriented Programming using New Optimal Page Replacement Algorithm

첫 페이지 보기
  • 발행기관
    보안공학연구지원센터(IJSEIA) 바로가기
  • 간행물
    International Journal of Software Engineering and Its Applications SCOPUS 바로가기
  • 통권
    Vol.8 No.6 (2014.06)바로가기
  • 페이지
    pp.253-264
  • 저자
    Swapan Kumar Mondal, Dr. Hitesh Tahbildar
  • 언어
    영어(ENG)
  • URL
    https://www.earticle.net/Article/A230655

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

원문정보

초록

영어
Regression testing remains one of the most laborious and costly software testing activities in software maintenance. Its laboriousness and costing increases with increasing number of test suits: need to changed re-testing strategy. The strategy should identify and eliminate redundant test cases in order to minimize the test cases from test suites. The aim of regression testing is to reduce the retesting effort and achieve the adequate testing coverage. An important research problem, in this context, is the new developed algorithm is needed to reduce the retesting effort, cost and time without disturbance of thoroughness. The traditional optimal page replacement algorithm is used for managing the virtual memory. Our approach has been showing that the novel optimal page replacement algorithm reducing the redundant test cases during retesting of modified object oriented program. Our testing approach is on unit level. The logic based transitive relationship model achieves the adequate testing coverage to the modified object oriented program. Hybridization of clock page replacement-counting based algorithm is used for making the logic based transition relationship model. An Illustrative example has been presented to establish the effectiveness of our methodology coupled with logic based transitive relationship model.

목차

Abstract
 1. Introduction
 2. Related Works
 3. Proposed Approach
 4. Illustration of Proposed Approach
 5. Result and Discussion
 6. Conclusion and Future Work
 References

키워드

Clock page replacement algorithm Counting based algorithm Logic based transition relationship optimal page replacement algorithm

저자

  • Swapan Kumar Mondal [ Research Scholar, Department of CSE University of Science and Technology, Meghalaya, Ri-Bhoi, Meghalaya-793101, India, ]
  • Dr. Hitesh Tahbildar [ H.O.D, Assam Engineering Institute, Guwahati. India ]

참고문헌

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

간행물 정보

발행기관

  • 발행기관명
    보안공학연구지원센터(IJSEIA) [Science & Engineering Research Support Center, Republic of Korea(IJSEIA)]
  • 설립연도
    2006
  • 분야
    공학>컴퓨터학
  • 소개
    1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업

간행물

  • 간행물명
    International Journal of Software Engineering and Its Applications
  • 간기
    월간
  • pISSN
    1738-9984
  • 수록기간
    2008~2016
  • 등재여부
    SCOPUS
  • 십진분류
    KDC 505 DDC 605

이 권호 내 다른 논문 / International Journal of Software Engineering and Its Applications Vol.8 No.6

    피인용수 : 0(자료제공 : 네이버학술정보)

    함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.

      페이지 저장