scispace - formally typeset
Open AccessProceedings Article

Finding security vulnerabilities in java applications with static analysis

Reads0
Chats0
TLDR
This paper proposes a static analysis technique for detecting many recently discovered application vulnerabilities such as SQL injections, cross-site scripting, and HTTP splitting attacks based on a scalable and precise points-to analysis.
Abstract: 
This paper proposes a static analysis technique for detecting many recently discovered application vulnerabilities such as SQL injections, cross-site scripting, and HTTP splitting attacks. These vulnerabilities stem from unchecked input, which is widely recognized as the most common source of security vulnerabilities in Web applications. We propose a static analysis approach based on a scalable and precise points-to analysis. In our system, user-provided specifications of vulnerabilities are automatically translated into static analyzers. Our approach finds all vulnerabilities matching a specification in the statically analyzed code. Results of our static analysis are presented to the user for assessment in an auditing interface integrated within Eclipse, a popular Java development environment. Our static analysis found 29 security vulnerabilities in nine large, popular open-source applications, with two of the vulnerabilities residing in widely-used Java libraries. In fact, all but one application in our benchmark suite had at least one vulnerability. Context sensitivity, combined with improved object naming, proved instrumental in keeping the number of false positives low. Our approach yielded very few false positives in our experiments: in fact, only one of our benchmarks suffered from false alarms.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Safe Guard Anomalies against SQL Injection Attacks

TL;DR: Old practices which are vulnerable should be banned in organization, companies and govt.
Proceedings ArticleDOI

A state coverage tool for JUnit

Ken Koster
TL;DR: A JUnit test runner that informs users of missing behavior checks in their tests and tracks variable updates and definitions over the course of a test execution and determines which variables influence which assertions via dynamic taint analysis.
Book ChapterDOI

Catch & Release: An Approach to Debugging Distributed Full-Stack JavaScript Applications

TL;DR: This paper presents a novel approach to localizing bugs in distributed web applications, targeting the important domain of full-stack JavaScript applications, and shows how this approach can be used to catch bugs that include performance bottlenecks and memory leaks.
Proceedings Article

Scaling relational inference using proofs and refutations

TL;DR: This work presents an eager-lazy grounding algorithm that eagerly exploits proofs and lazily refutes counterexamples, and shows that the algorithm achieves significant speedup over existing approaches without sacrificing soundness for real-world applications from information retrieval and program analysis.
Book ChapterDOI

Context-Sensitive Relevancy Analysis for Efficient Symbolic Execution

TL;DR: A context-sensitive relevancy analysis algorithm based on weighted pushdown model checking is presented, which pinpoints memory locations in the program where symbolic values can flow into to help improve the efficiency of symbolic execution of Java programs.
References
More filters
Book

Principles of database and knowledge-base systems

TL;DR: This book goes into the details of database conception and use, it tells you everything on relational databases from theory to the actual used algorithms.
Proceedings Article

StackGuard: automatic adaptive detection and prevention of buffer-overflow attacks

TL;DR: StackGuard is described: a simple compiler technique that virtually eliminates buffer overflow vulnerabilities with only modest performance penalties, and a set of variations on the technique that trade-off between penetration resistance and performance.
Proceedings ArticleDOI

JFlow: practical mostly-static information flow control

TL;DR: The new language JFlow is described, an extension to the Java language that adds statically-checked information flow annotations and provides several new features that make information flow checking more flexible and convenient than in previous models.
Proceedings ArticleDOI

Points-to analysis in almost linear time

TL;DR: This is the asymptotically fastest non-trivial interprocedural points-to analysis algorithm yet described and is based on a non-standard type system for describing a universally valid storage shape graph for a program in linear space.
Related Papers (5)