Test Selection Based on Finite State Models
IEEE Transactions on Software Engineering
Testing Finite-State Machines: State Identification and Verification
IEEE Transactions on Computers
IEEE Transactions on Software Engineering
FSM-Based Incremental Conformance Testing Methods
IEEE Transactions on Software Engineering
ICSM '05 Proceedings of the 21st IEEE International Conference on Software Maintenance
Separating sequence overlap for automated test sequence generation
Automated Software Engineering
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Automated Unique Input Output Sequence Generation for Conformance Testing of FSMs
The Computer Journal
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
Hi-index | 0.00 |
Protocol conformance testing generally involves cheching whether the protocol under test conforms to the given specification. The generation of test sequences in an efficient and effective way that achieves the required fault detection coverage is highly desirable. This paper proposed an approach that formulates the problem of finding shorter test sequences based on the Wp method into one of finding the shortest tour in the asymmetric travelling salesman problem (ATSP). In the formulation of the ATSP, the approach excludes redundant test segments, employs the concepts of overlap to reduce test sequence length and concatenation without linking cost ito the test sequence generation technique. The approach recast a Software Engineering problem as a search-based problems using Ant Colony Optimization to find the shortest will maintain the same fault detection capability as those of the Wp method. The approach is applicable to every minimal FSM as each one of them possesses a characterising set.