Sciweavers

142 search results - page 12 / 29
» Generating example data for dataflow programs
Sort
View
ISSTA
2006
ACM
15 years 3 months ago
Path-oriented random testing
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
Arnaud Gotlieb, Matthieu Petit
66
Voted
CIB
2005
41views more  CIB 2005»
14 years 9 months ago
A Partial-Repeatability Approach to Data Mining
Unlike the data approached in traditional data mining activities, software data are featured with partial-repeatability or parepeatics, which is an invariant property that can neit...
Kai-Yuan Cai, Yunfei Yin, Shichao Zhang
ISSRE
2003
IEEE
15 years 3 months ago
A New Software Testing Approach Based on Domain Analysis of Specifications and Programs
Partition testing is a well-known software testing technique. This paper shows that partition testing strategies are relatively ineffective in detecting faults related to small sh...
Ruilian Zhao, Michael R. Lyu, Yinghua Min
ILP
2004
Springer
15 years 3 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik
CF
2010
ACM
15 years 2 months ago
Variant-based competitive parallel execution of sequential programs
Competitive parallel execution (CPE) is a simple yet attractive technique to improve the performance of sequential programs on multi-core and multi-processor systems. A sequential...
Oliver Trachsel, Thomas R. Gross