Sciweavers

2218 search results - page 64 / 444
» Testing Expressibility Is Hard
Sort
View
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
14 years 1 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
SFP
2003
13 years 9 months ago
Testing reactive systems with GAST
G∀ST is a fully automatic test system. Given a logical property, stated as a function, it is able to generate appropriate test values, to execute tests with these values, and to ...
Pieter W. M. Koopman, Rinus Plasmeijer
SEKE
2010
Springer
13 years 6 months ago
Ontology-Based Test Case Generation For Simulating Complex Production Automation Systems
—The behavior of complex production automation systems is hard to predict, therefore simulation is used to study the likely system behavior. However, in a real-world system many ...
Thomas Moser, Gregor Dürr, Stefan Biffl
JUCS
2010
107views more  JUCS 2010»
13 years 6 months ago
Systematic Unit Testing in a Read-eval-print Loop
: Lisp programmers constantly carry out experiments in a read-eval-print loop. The experimental activities convince the Lisp programmers that new or modified pieces of programs wo...
Kurt Nørmark
ICSM
2007
IEEE
14 years 2 months ago
Fault Detection Probability Analysis for Coverage-Based Test Suite Reduction
Test suite reduction seeks to reduce the number of test cases in a test suite while retaining a high percentage of the original suite’s fault detection effectiveness. Most appro...
Scott McMaster, Atif M. Memon