Algorithmic complexity vulnerabilities occur when the worst-case time/space complexity of
an application is significantly higher than the respective average case for particular user …

An essential goal of Virtual Machine Introspection (VMI) is assuring security policy
enforcement and overall functionality in the presence of an untrustworthy OS. A fundamental …

Software-Defined Networking (SDN) has significantly enriched network functionalities by
decoupling programmable network controllers from the network hardware. Because SDN …

Network firewalls act as the first line of defense against unwanted and malicious traffic
targeting Internet servers. Predicting the overall firewall performance is crucial to network …

We present the first static approach that systematically detects potential double-fetch
vulnerabilities in the Linux kernel. Using a pattern-based analysis, we identified 90 double …

Applications must be able to synchronize accesses to operating system resources in order to
ensure correctness in the face of concurrency and system failures. System transactions …

This paper presents a study of Linux API usage across all applications and libraries in the
Ubuntu Linux 15.04 distribution. We propose metrics for reasoning about the importance of …

Double-fetch bugs are a special type of race condition, where an unprivileged execution
thread is able to change a memory location between the time-of-check and time-of-use of a …

An approximate membership query data structure (AMQ)-such as a Bloom, quotient, or
cuckoo filter-maintains a compact, probabilistic representation of a set S of keys from a …

We describe a new blackbox complexity testing technique for determining the worst-case
asymptotic complexity of a given application. The key idea is to look for an input pattern …