Sciweavers

1241 search results - page 83 / 249
» Path-oriented random testing
Sort
View
SPAA
2000
ACM
15 years 9 months ago
An experimental study of a simple, distributed edge coloring algorithm
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
Madhav V. Marathe, Alessandro Panconesi, Larry D. ...
KDD
2003
ACM
205views Data Mining» more  KDD 2003»
16 years 5 months ago
The data mining approach to automated software testing
In today's industry, the design of software tests is mostly based on the testers' expertise, while test automation tools are limited to execution of pre-planned tests on...
Mark Last, Menahem Friedman, Abraham Kandel
ISSRE
2002
IEEE
15 years 9 months ago
A Case Study Using the Round-Trip Strategy for State-Based Class Testing
A number of strategies have been proposed for state-based class testing. An important proposal was made by Chow [5] and adapted by Binder [3]: It consists in deriving test sequenc...
Giuliano Antoniol, Lionel C. Briand, Massimiliano ...
VLDB
1998
ACM
110views Database» more  VLDB 1998»
15 years 9 months ago
Massive Stochastic Testing of SQL
Deterministic testing of SQL database systems is human intensive and cannot adequately cover the SQL input domain. A system (RAGS), was built to stochastically generate valid SQL ...
Donald R. Slutz
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
16 years 2 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra