Program analysis for bug detection using parfait: invited talk

Authors:
Cristina Cifuentes;Nathan Keynes;Lian Li;Bernhard Scholz
Affiliations:
Sun Microsystems Laboratories, Brisbane, Australia;Sun Microsystems Laboratories, Brisbane, Australia;Sun Microsystems Laboratories, Brisbane, Australia;Sun Microsystems Laboratories, Brisbane, Australia
Venue:
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Year:
2009

Citing 4
Cited 0

LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation

Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
Testing static analysis tools using exploitable buffer overflows from open source code

Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
Symbolic Evaluation and the Analysis of Programs

IEEE Transactions on Software Engineering
Parfait: designing a scalable bug checker

Proceedings of the 2008 workshop on Static analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

The goal of the Parfait project is to find bugs in C source code in a scalable and precise way. To this end, Parfait was designed as a framework with layers of sound program analyses, multiple layers per bug type, to identify bugs in a program more quickly and accurately. Parfait also aims to identify security bugs, i.e., bugs that may be exploited by a malicious user. To this end, an optional pre-processing step is available to reduce the scope of potential bugs of interest. To evaluate Parfait's precision and recall, we have developed BegBunch, a bug benchmarking suite that contains existing synthetic benchmarks and samples of bugs ("bug kernels") taken from open source code.