Sciweavers

6800 search results - page 221 / 1360
» Testing with Functions as Specifications
Sort
View
FOCS
2004
IEEE
15 years 10 months ago
Testing Low-Degree Polynomials over Prime Fields
We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...
Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra...
APPROX
2010
Springer
135views Algorithms» more  APPROX 2010»
15 years 7 months ago
Monotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
Jop Briët, Sourav Chakraborty, David Garc&iac...
PAMI
1998
87views more  PAMI 1998»
15 years 6 months ago
What Size Test Set Gives Good Error Rate Estimates?
—We address the problem of determining what size test set guarantees statistically significant results in a character recognition task, as a function of the expected error rate. ...
Isabelle Guyon, John Makhoul, Richard M. Schwartz,...
KBSE
1998
IEEE
15 years 11 months ago
Automated Software Test Data Generation for Complex Programs
We report on GADGET, a new software test generation system that uses combinatorial optimization to obtain condition/decision coverage of C/C++ programs. The GADGET system is fully...
Christoph C. Michael, Gary McGraw
MBEES
2010
15 years 5 months ago
Test Case Integration: From Components to Systems
In a component-based development approach system integration generally implies the packaging and deployment of a group of software components on hardware units, possibly hiding th...
Bernhard Schätz, Christian Pfaller