Formal Methods for Protocol Testing: A Detailed Study
IEEE Transactions on Software Engineering
Specifications of a simplified transport protocol using different formal description techniques
Computer Networks and ISDN Systems
Protocol conformance test generation using multiple UIO sequences with overlapping
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
A new protocol conformance test generation method and experimental results
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
On the generation of minimal-length conformance tests for communication protocols
IEEE/ACM Transactions on Networking (TON)
Computer networks (3rd ed.)
Modeling Reactive Systems with Statecharts: The Statemate Approach
Modeling Reactive Systems with Statecharts: The Statemate Approach
Testing Finite-State Machines: State Identification and Verification
IEEE Transactions on Computers
Reduced Length Checking Sequences
IEEE Transactions on Computers
Generating Software Test Data by Evolution
IEEE Transactions on Software Engineering
Protocol Conformance Testing Using Multiple UIO Sequences
Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
Generation of Feasible Test Sequences for EFSM Models
TestCom '00 Proceedings of the IFIP TC6/WG6.1 13th International Conference on Testing Communicating Systems: Tools and Techniques
Confirming Configurations in EFSM Testing
IEEE Transactions on Software Engineering
A Method Enabling Feasible Conformance Test Sequence Generation for EFSM Models
IEEE Transactions on Computers
Optimizing the Length of Checking Sequences
IEEE Transactions on Computers
Automated Unique Input Output Sequence Generation for Conformance Testing of FSMs
The Computer Journal
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
Functional Search-based Testing from State Machines
ICST '08 Proceedings of the 2008 International Conference on Software Testing, Verification, and Validation
Fault detecting experiments for sequential circuits
SWCT '64 Proceedings of the 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM)
ICST '09 Proceedings of the 2009 International Conference on Software Testing Verification and Validation
Synthesis of on-line planning tester for non-deterministic EFSM models
TAIC PART'10 Proceedings of the 5th international academic and industrial conference on Testing - practice and research techniques
Information and Software Technology
| Hi-index | 0.00 |
There has been significant interest in automating testing on the basis of an extended finite state machine (EFSM) model of the required behaviour of the implementation under test (IUT). Many test criteria require that certain parts of the EFSM are executed. For example, we may want to execute every transition of the EFSM. In order to find a test suite (set of input sequences) that achieves this we might first derive a set of paths through the EFSM that satisfy the criterion using, for example, algorithms from graph theory. We then attempt to produce input sequences that trigger these paths. Unfortunately, however, the EFSM might have infeasible paths and the problem of determining whether a path is feasible is generally undecidable. This paper describes an approach in which a fitness function is used to estimate how easy it is to find an input sequence to trigger a given path through an EFSM. Such a fitness function could be used in a search-based approach in which we search for a path with good fitness that achieves a test objective, such as executing a particular transition, and then search for an input sequence that triggers the path. If this second search fails then we search for another path with good fitness and repeat the process. We give a computationally inexpensive approach (fitness function) that estimates the feasibility of a path. In order to evaluate this fitness function we compared the fitness of a path with the ease with which an input sequence can be produced using search to trigger the path and we used random sampling in order to estimate this. The empirical evidence suggests that a reasonably good correlation (0.72 and 0.62) exists between the fitness of a path, produced using the proposed fitness function, and an estimate of the ease with which we can randomly generate an input sequence to trigger the path.