Paper Info
Title
Reformulation of the generation of conformance testing sequences to the asymmetric travelling salesman problem
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.
Year
DOI
Venue
2006
10.1145/1143997.1144318
GECCO
Keywords
Field
DocType
asymmetric travelling salesman problem,wp method,resulting test sequence,conformance testing sequence,fault detection capability,shorter test sequence,test sequence generation,search-based software engineering,protocol conformance testing,software engineering problem,test sequence,heuristic algorithm,travelling salesman problem,search based software engineering,shortest path,fault detection,tsp,conformance testing,software engineering
Mathematical optimization,Protocol conformance testing,Shortest path problem,Fault detection and isolation,Computer science,Test sequence,Theoretical computer science,Conformance testing,Travelling salesman problem
Conference
ISBN
Citations 
PageRank 
1-59593-186-4
1
0.37
References 
Authors
5
4
Name
Order
Citations
PageRank
Jitian Xiao1258.27
Chiou Peng Lam27010.64
Huaizhong Li317718.16
Jun Wang482.34