Reformulation of the generation of conformance testing sequences to the asymmetric travelling salesman problem

Authors:
Jitian Xiao;Chiou Peng Lam;Huaizhong Li;Jun Wang
Affiliations:
Edith Cowan University, Mt Lawley, Australia;Edith Cowan University, Mt Lawley, Australia;Edith Cowan University, Mt Lawley, Australia;Edith Cowan University, Mt Lawley, Australia
Venue:
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Year:
2006

Citing 4
Cited 1

Test Selection Based on Finite State Models

IEEE Transactions on Software Engineering
Testability Transformation

IEEE Transactions on Software Engineering
Search-Based Techniques Applied to Optimization of Project Planning for a Massive Maintenance Project

ICSM '05 Proceedings of the 21st IEEE International Conference on Software Maintenance
Eliminating redundant tests in a checking sequence

TestCom'05 Proceedings of the 17th IFIP TC6/WG 6.1 international conference on Testing of Communicating Systems

Ant colony optimisation for generation of conformance testing sequences using a characterising set

ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology

Quantified Score

Hi-index	0.02

Visualization

Abstract

Protocol conformance testing generally involves checking whether the protocol under test conforms to the given specification. An important issue in protocol conformance testing is the generation of test sequences in an efficient and effective way that achieves the required fault detection coverage. This paper proposed an approach for finding the shorter test sequences for protocol conformance testing based on the Wp method. The approach provides a technique for transforming the problem of the test sequence generation from a given FSM into one of finding the shortest path in the asymmetric travelling salesman problem by using one of the many existing meta-heuristic algorithms for addressing TSP. The approach addresses the issue of reformulation of Software Engineering problems as search-based problems in Search-based Software Engineering. The paper also shows that the resulting test sequences will maintain the same fault detection capability as those of the Wp method.