Application of heuristic methods for conformance test selection

Csöndes, Tibor; Kotnyek, Balázs; Szabó, János Zoltán

doi:10.1016/s0377-2217(01)00284-3

Cited by 16 publications

(7 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…RSO for traffic grooming in optical WDM networks is considered in [12]. Optimal conformance test selection is studied in [51]. Conformance testing is used to increase the reliability of telecommunication applications.…”

Section: Real-world Applicationsmentioning

confidence: 99%

Reactive Search Optimization: Learning While Optimizing

Battiti

Brunato

2010

International Series in Operations Research &Amp; Management Science

View full text Add to dashboard Cite

Section: Real-world Applicationsmentioning

confidence: 99%

Reactive Search Optimization: Learning While Optimizing

Battiti

Brunato

2010

International Series in Operations Research &Amp; Management Science

View full text Add to dashboard Cite

“…Figure 2. The bipartite graph G constructed from matrix A Bold lines show a maximum cardinality matching: the selected elements of A are (1, 3), (2,4), (3,1), (4,2). In general more maximum cardinality assignments may exist, but all with the same cardinality.…”

Section: Theorem 34mentioning

confidence: 99%

“…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

“…They lay somewhere in between pure chance and pure determinism, which gives them some of the advantages of both these two extremes (see, [21] for a discussion on the theoretical concepts of this particular class of model). The importance of Genetic Algorithms is obvious from the variety of their applications ( [1,2,19], among others). However, few variations have been proposed so far from the basic concept, which is mainly application-driven (i.e., [11]).…”

Section: Outlinementioning

confidence: 99%