Sciweavers

2877 search results - page 51 / 576
» The Complexity of Planarity Testing
Sort
View
SE
2007
13 years 10 months ago
An integration framework for heterogeneous automatic software tests
: Developing and maintaining large software systems can require the usage of a variety of different automatic test tools. The complexity of the tools leads to considerable overhead...
Holger Schackmann, Horst Lichter, Veit Hoffmann
ISSTA
2004
ACM
14 years 2 months ago
Covering arrays for efficient fault characterization in complex configuration spaces
—Many modern software systems are designed to be highly configurable so they can run on and be optimized for a wide variety of platforms and usage scenarios. Testing such systems...
Cemal Yilmaz, Myra B. Cohen, Adam A. Porter
ANTS
2004
Springer
109views Algorithms» more  ANTS 2004»
14 years 2 months ago
On the Complexity of Computing Units in a Number Field
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
Vikraman Arvind, Piyush P. Kurur
STACS
2007
Springer
14 years 3 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom
GECCO
2004
Springer
117views Optimization» more  GECCO 2004»
14 years 2 months ago
Evaluating Evolutionary Testability with Software-Measurements
Test case design is the most important test activity with respect to test quality. For this reason, a large number of testing methods have been developed to assist the tester with ...
Frank Lammermann, André Baresel, Joachim We...