We present the design of Parfait, a static layered program analysis framework for bug checking, designed for scalability and precision by improving false positive rates and scale to millions of lines of code. The Parfait framework is inherently parallelizable and makes use of demand driven analyses. In this paper we provide an example of several layers of analyses for buffer overflow, summarize our initial implementation for C, and provide preliminary results. Results are quantified in terms of correctly-reported, false positive and false negative rates against the NIST SAMATE synthetic benchmarks for C code.
@InProceedings{cifuentes_et_al:DagSemProc.08161.5, author = {Cifuentes, Cristina and Scholz, Bernhard}, title = {{Parfait - Designing a Scalable Bug Checker}}, booktitle = {Scalable Program Analysis}, pages = {1--8}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8161}, editor = {Florian Martin and Hanne Riis Nielson and Claudio Riva and Markus Schordan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08161.5}, URN = {urn:nbn:de:0030-drops-15737}, doi = {10.4230/DagSemProc.08161.5}, annote = {Keywords: Static analysis, demand driven, parallelizable} }
Feedback for Dagstuhl Publishing