Optimal length test sequence generation using distinguishing sequences
IEEE/ACM Transactions on Networking (TON)
Using a goal-driven approach to generate test cases for GUIs
Proceedings of the 21st international conference on Software engineering
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Solving the rural postman problem using a genetic algorithm with a graph transformation
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Specification Based Regression Testing Using Explicit State Space Enumeration
ICSEA '06 Proceedings of the International Conference on Software Engineering Advances
A safe regression testing approach for safety critical systems
Advances in Engineering Software
| Hi-index | 0.00 |
In the regression testing of reactive systems, a sequence of events, called the test sequence, is sent to it, and the system's behaviour is observed. The basic test sequence computation problem is equivalent to the rural postman problem, an NP-complete problem. We present PathFinder, a heuristic branch and bound algorithm, parameterised with a lookahead value k, to compute good test sequences from the state space graph of an API library. We also present a modified test sequence computation problem, and a modified version of PathFinder to solve it. We present the results of our experiments. These results provide insights to the tester on the choice of the best lookahead value for regression test sequence computation