Deriving Compact Test Suites for Telecommunication Software Using Distance Metrics
Abstract
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.
Keywords
test set maintenance, test selection, string edit distance, assignment problem I. INTRODUCTION
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
G. Kovács, G. Németh, Z. Pap and M. Subramaniam, "Deriving Compact Test Suites for Telecommunication Software Using Distance Metrics," in Journal of Communications Software and Systems, vol. 5, no. 2, pp. 57-61, June 2009, doi: 10.24138/jcomss.v5i2.205
@article{kovacs2009derivingcompact,
author = {Gábor Kovács and Gábor Árpád Németh and Zoltán Pap and Mahadevan Subramaniam},
title = {Deriving Compact Test Suites for Telecommunication Software Using Distance Metrics},
journal = {Journal of Communications Software and Systems},
month = {6},
year = {2009},
volume = {5},
number = {2},
pages = {57--61},
doi = {10.24138/jcomss.v5i2.205},
url = {https://doi.org/10.24138/jcomss.v5i2.205}
}