Sciweavers

1422 search results - page 32 / 285
» Test Generation Algorithms Based on Preorder Relations
Sort
View
FATES
2003
Springer
15 years 2 months ago
Auto-generating Test Sequences Using Model Checkers: A Case Study
Use of model-checking approaches for test generation from requirement models have been proposed by several researchers. These approaches leverage the witness (or counter-example) ...
Mats Per Erik Heimdahl, Sanjai Rayadurgam, Willem ...
COMPSAC
2003
IEEE
15 years 3 months ago
Automated Metamorphic Testing
Usual techniques for automatic test data generation are based on the assumption that a complete oracle will be available during the testing process. However, there are programs fo...
Arnaud Gotlieb, Bernard Botella
SIGMOD
2011
ACM
222views Database» more  SIGMOD 2011»
14 years 15 days ago
Data generation using declarative constraints
We study the problem of generating synthetic databases having declaratively specified characteristics. This problem is motivated by database system and application testing, data ...
Arvind Arasu, Raghav Kaushik, Jian Li
FATES
2006
Springer
15 years 1 months ago
Goldilocks: Efficiently Computing the Happens-Before Relation Using Locksets
We present a new lockset-based algorithm, Goldilocks, for precisely computing the happens-before relation and thereby detecting data-races at runtime. Dynamic race detection algori...
Tayfun Elmas, Shaz Qadeer, Serdar Tasiran
AUSAI
2003
Springer
15 years 2 months ago
Choosing Learning Algorithms Using Sign Tests with High Replicability
An important task in machine learning is determining which learning algorithm works best for a given data set. When the amount of data is small the same data needs to be used repea...
Remco R. Bouckaert