Sciweavers

2218 search results - page 4 / 444
» Testing Expressibility Is Hard
Sort
View
COMBINATORICA
2008
92views more  COMBINATORICA 2008»
13 years 7 months ago
A separation theorem in property testing
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...
Noga Alon, Asaf Shapira
ISSTA
2004
ACM
14 years 1 months ago
Testing malware detectors
In today’s interconnected world, malware, such as worms and viruses, can cause havoc. A malware detector (commonly known as virus scanner) attempts to identify malware. In spite...
Mihai Christodorescu, Somesh Jha
SIGSOFT
2010
ACM
13 years 5 months ago
Representation dependence testing using program inversion
The definition of a data structure may permit many different concrete representations of the same logical content. A (client) program that accepts such a data structure as input i...
Aditya Kanade, Rajeev Alur, Sriram K. Rajamani, Ga...
CCS
2003
ACM
14 years 26 days ago
Using graphic turing tests to counter automated DDoS attacks against web servers
We present WebSOS, a novel overlay-based architecture that provides guaranteed access to a web server that is targeted by a denial of service (DoS) attack. Our approach exploits t...
William G. Morein, Angelos Stavrou, Debra L. Cook,...
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
14 years 8 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman