Open AccessProceedings Article
Finding security vulnerabilities in java applications with static analysis
V. Benjamin Livshits,Monica S. Lam +1 more
- pp 18-18
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
Citations
More filters
Book ChapterDOI
Modularity in Lattices: A Case Study on the Correspondence Between Top-Down and Bottom-Up Analysis
TL;DR: Interprocedural analyses are compositional when they compute over-approximations of procedures in a bottom-up fashion, which are usually more scalable than top-down analyses, which compute a different procedure summary for every calling context.
Proceedings ArticleDOI
Static Analysis Alert Audits: Lexicon & Rules
TL;DR: A suggested set of auditing rules and a lexicon is provided, detailing rationales based on modern software engineering practices for each rule and each lexicon term, and it is hoped that this suggested framework will motivate community discussion leading to agreed-upon standards.
Journal ArticleDOI
Programming languages and program analysis for security: a three-year retrospective
Marco Pistoia,Úlfar Erlingsson +1 more
TL;DR: This paper is a three-year survey of PLAS papers that discusses the progress made in the area of language-based security, which has become very active with the advent of Web applications.
Patent
Security testing framework including virtualized server-side platform
TL;DR: In this article, a web application security testing framework includes a HTTP browser engine replaying recorded sessions to identify candidate traces indicative of attack and a mutation engine changes values in the attack candidate traces to generate additional traces posed against a virtualized server-side platform.
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
Crispin Cowan,Calton Pu,Dave Maier,Heather Hintony,Jonathan Walpole,Peat Bakke,Steve Beattie,Aaron Grier,Perry Wagle,Qian Zhang +9 more
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.