Automated Test Case Selection Based on Subpurposes

Csöndes, Tibor; Kotnyek, Balázs

doi:10.1007/978-0-387-35567-2_16

Cited by 3 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are different measures of quality used to guide the reduction process like symbol (path) coverage [1], fault coverage based on a fault model [2], test sub-purpose coverage [3] or trace distance heuristics [4]. The selection problem can be solved by exact algorithms such as linear programming methods [5] [6], but considering the large number of generated test cases and the hardness of the selection problem usually approximate solutions, for example genetic algorithms [3], are applied.…”

Section: Introductionmentioning

confidence: 99%

Deriving Compact Test Suites for Telecommunication Software Using Distance Metrics

Kovács

Németh

Pap

et al. 2009

JCOMSS

View full text Add to dashboard Cite

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 inaccordance 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.

show abstract

Section: Introductionmentioning

confidence: 99%

Deriving Compact Test Suites for Telecommunication Software Using Distance Metrics

Kovács

Németh

Pap

et al. 2009

JCOMSS

View full text Add to dashboard Cite

show abstract

“…The selection problem can be solved by exact algorithms such as linear programming methods [5] [6], but considering the large number of generated test cases and the hardness of the selection problem usually approximate solutions, for example genetic algorithms [3], are applied.…”

Section: Introductionmentioning

confidence: 99%

Deriving compact test suites for telecommunication software using distance metrics

Kovács

Németh

Pap

et al. 2008

2008 16th International Conference on Software, Telecommunications and Computer Networks

View full text Add to dashboard Cite

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.

show abstract

Greedy Algorithms for the Test Selection Problem in Protocol Conformance Testing

Csöndes

Kotnyek

2002

J CIRCUIT SYST COMP

View full text Add to dashboard Cite

This paper presents a mathematical model for the test selection problem in protocol conformance testing, the goal of which is to select a suitable test set from a given test suite. The problem is described together with its mathematical formulation including two optimization problems and four different models for the coverage. The test selection problem is shown to be NP-hard. The Integer Programming transformation of the problems is also discussed. We propose greedy algorithms for the selection, which perform much better than the existing methods and can provide very good solutions as experimental results show.

show abstract

Automated Test Case Selection Based on Subpurposes

Cited by 3 publications

References 3 publications

Deriving Compact Test Suites for Telecommunication Software Using Distance Metrics

Deriving Compact Test Suites for Telecommunication Software Using Distance Metrics

Deriving compact test suites for telecommunication software using distance metrics

Greedy Algorithms for the Test Selection Problem in Protocol Conformance Testing

Contact Info

Product

Resources

About