Deriving Compact Test Suites for Telecommunication Software Using Distance Metrics

This paper proposes a string edit distance based test selection method to generate compact test sets for telecommunications software. Following the results of previous research, a trace in a test set is considered to be redundant if its edit distance from others is less than a given parameter. The algorithm first determines the minimum cardinality of the target test set in accordance with the provided parameter, then it selects the test set with the highest sum of internal edit distances. The selection problem is reduced to an assignment problem in bipartite graphs

Test Case Generation from UML State Machines

In this paper we describe a comprehensive approach for conformance testing of embedded reactive systems. Based on a formal specification, namely UML state machines, we automatically generate test cases and use them to check the functional conformance of a system under test. Our test cases include not only stimuli to trigger the system under test, they also include possible correct observations to automatically evaluate the test case execution. In contrast to classical Harel Statecharts, state machines behave asynchronously, which makes automatic test case generation a challenge. The TEAGER Tool Suite implements the automatic generation, execution and evaluation of test cases and proves the applicability of our test approach

Model Checking and Model-Based Testing : Improving Their Feasibility by Lazy Techniques, Parallelization, and Other Optimizations

This thesis focuses on the lightweight formal method of model-based testing for checking safety properties, and derives a new and more feasible approach. For liveness properties, dynamic testing is impossible, so feasibility is increased by specializing on an important class of properties, livelock freedom, and deriving a more feasible model checking algorithm for it. All mentioned improvements are substantiated by experiments

Test Selection, Trace Distance and Heuristics

Two heuristic principles for test selection are proposed: the reduction heuristic and the cycling heuristic. The rst assumes that few outgoing transitions of a state show essentially dierent behaviour. The second assumes that the probability to detect erroneous behaviour in a loop decreases after each correct execution of the loop behaviour. We formalize these heuristic principles and we dene a coverage function which serves as a measure for the error-detecting capability of a test suite. For this purpose we introduce the notion of a marked trace and a distance function on such marked traces. Keywords: test selection, test coverage, trace distance, heuristics, edit distance. 1