Sciweavers

4670 search results - page 158 / 934
» Testing that distributions are close
Sort
View
CCS
2004
ACM
15 years 12 months ago
Testing network-based intrusion detection signatures using mutant exploits
Misuse-based intrusion detection systems rely on models of attacks to identify the manifestation of intrusive behavior. Therefore, the ability of these systems to reliably detect ...
Giovanni Vigna, William K. Robertson, Davide Balza...
SIGSOFT
2010
ACM
15 years 4 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...
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
16 years 7 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
AADEBUG
2005
Springer
16 years 2 days ago
Code coverage testing using hardware performance monitoring support
Code coverage analysis, the process of finding code exercised by a particular set of test inputs, is an important component of software development and verification. Most tradit...
Alex Shye, Matthew Iyer, Vijay Janapa Reddi, Danie...
CCS
2003
ACM
15 years 11 months 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,...