Sciweavers

33 search results - page 1 / 7
» Greedy Algorithms for the Test Selection Problem in Protocol...
Sort
View
ACSD
2003
IEEE
102views Hardware» more  ACSD 2003»
13 years 9 months ago
Specification Coverage Aided Test Selection
In this paper test selection strategies in formal conformance testing are considered. As the testing conformance relation we use the ioco relation, and extend the previously prese...
Tuomo Pyhälä, Keijo Heljanko
ACTAC
1999
81views more  ACTAC 1999»
13 years 5 months ago
Test Suite Reduction in Conformance Testing
Conformance testing is based on a test suite. Standardization committees release standard test suites, which consist of hundreds of test cases. The main problem of conformance tes...
Tibor Csöndes, Sarolta Dibuz, Balázs K...
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
13 years 10 months ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
Bryant A. Julstrom
TACAS
2005
Springer
120views Algorithms» more  TACAS 2005»
13 years 10 months ago
Symbolic Test Selection Based on Approximate Analysis
This paper addresses the problem of generating symbolic test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of rea...
Bertrand Jeannet, Thierry Jéron, Vlad Rusu,...