Earticle

현재 위치 Home

An Adaptive PSO Algorithm Based Test Data Generator for Data-Flow Dependencies using Dominance Concepts

첫 페이지 보기
  • 발행기관
    보안공학연구지원센터(IJSEIA) 바로가기
  • 간행물
    International Journal of Software Engineering and Its Applications SCOPUS 바로가기
  • 통권
    Vol.10 No.11 (2016.11)바로가기
  • 페이지
    pp.59-82
  • 저자
    Sumit Kumar, D K Yadav, D A Khan
  • 언어
    영어(ENG)
  • URL
    https://www.earticle.net/Article/A292521

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

원문정보

초록

영어
One of the most important and effort intensive activity of the entire software development process is software testing. The effort involved chiefly increases because of the need to obtain optimal test data out of the entire search space of the problem under testing. Software test data generation is one area that has seen tremendous research in terms of automation and optimization. Generating or identifying an optimal test set that satisfies a more robust adequacy criteria, like data flow testing, is still a challenging task. A number of heuristic and meta-heuristics like genetic algorithm (GA), Particle Swarm Optimization (PSO) have been applied to optimize the test data generation problem. GA, although more popular, has its own difficulties such as complex to implement and slow convergence rate. In this paper an Adaptive Particle Swarm Optimization (APSO) algorithm is applied to generate test data for data-flow dependencies of a program guided by a novel fitness function. Adaptive PSO is used because of its capability of balancing in exploration and exploitation. A new fitness function is designed based on the concepts of dominance relations, weighted branch distance for APSO to guide the search direction. A set of benchmark programs and four modules of Krishna Institute of Engineering and Technology (KIET), Enterprise resource planning (ERP) system were taken for the experimental analysis. The experimental results show that the proposed adaptive PSO based approach performed significantly better than random search, Genetic Algorithm and PSO in enhancing the convergence speed.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Background
  3.1. Data Flow Analysis
  3.2. Dominator Tree
  3.3. Particle Swarm Optimization
 4. Adaptive Particle Swarm Optimization
 5. Proposed Approach
  5.1. Adaptive PSO based Test Data Generation
  5.2. Fitness Function
  5.3. Branch Distance Computation
  5.4. Branch Weight Computation
 6. Result and Discussion
  6.1. Experimental Setup
  6.2. Performance Evaluation Parameter
  6.3. Research Questions
  6.4. Results
  6.5. Experiment on ERP Module
  6.6. Discussion
  6.7. Statistical Analysis of Proposed Approach
 7. Threats to Validity and Limitations
 8. Conclusion
 References

저자

  • Sumit Kumar [ KIET, Ghaziabad, India ]
  • D K Yadav [ NIT Jamshedpur, Jharkhand, India ]
  • D A Khan [ NIT Jamshedpur, Jharkhand, 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.10 No.11

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

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

      페이지 저장