Although extensive studies have been done on the protocol conformance testing based on an extended finite state machine (EFSM) model, the automatic generation of feasible test sequences is still a challenging task. A generated test sequence may be infeasible, due to the conflicts among the transition conditions and context variables of EFSMs. This paper proposed a test sequence generation approach for EFSM-based protocols conformance test by using the transition feasibility estimation. Firstly, our method generates candidate transition paths from a directed graph G which is derived from the EFSM model under testing ignoring all the predicates; Then, we designed a fitness function to guide the test generation with a trade-off among path feasibility, coverage criterion and path length. Finally, an adaptive exploration algorithm is developed to generate executable test sequences through expanding CPs. An experiment was designed to validate the effectiveness of the proposed method with two classic EFSM models. The experimental results show that our approach is more effective by comparing it to the TEA method based on breadth-first search (BFS).
목차
Abstract 1. Introduction 2. Preliminaries 3. The Proposed Approach 3.1. DP Classification 3.2. Candidate Paths Generation 3.3. Test Sequence Generation 4. Empirical Results and Discussion 5. Related Work. 6. Conclusion and Prospective References
보안공학연구지원센터(IJCA) [Science & Engineering Research Support Center, Republic of Korea(IJCA)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Control and Automation
간기
월간
pISSN
2005-4297
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Control and Automation Vol.9 No.5