Coverage-Based Testing with Symbolic Transition Systems
conference paper
We provide a model-based testing approach for systems comprising both state-transition based control flow, and data elements such as variables and data-dependent transitions. We propose test generation and execution, based on model-coverage: we generate test cases that aim to reach all transitions of the model. To obtain a test case reaching a certain transition, we need to combine reachability in the control flow, and satisfiability of the data elements of the model. Concrete values for data parameters are generated on-the-fly, i.e., during test execution, such that received outputs from the system can be taken into account for the inputs later provided in test execution. Due to undecidability of the satisfiability problem, SMT solvers may return result ‘unknown’. Our algorithm deals with this explicitly. We implemented our method in Maude combined with Z3, and use this to demonstrate the applicability of our method on the Bounded Retransmission Protocol benchmark. We measure performance by counting the number of inputs and outputs needed to discover bugs in mutants, i.e., in non-conforming variants of the specification. As a result, we find that we perform 3 times better, according to the geometric mean, than when using random testing as implemented by the tool TorXakis.
Topics
TNO Identifier
871716
ISSN
03029743
ISBN
9783030311568
Publisher
Springer
Source title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 13th International Conference on Tests and Proofs, TAP 2019, held as part of the 3rd World Congress on Formal Methods, FM 2019, 9 October 2019 through 11 October 2019
Editor(s)
Keller, D.
Beyer, C.
Beyer, C.
Pages
64-82
Files
To receive the publication files, please send an e-mail request to TNO Repository.