Parf: An Adaptive Abstraction-Strategy Tuner for Static Analysis

Abstract

We launch Parf – a toolkit for adaptively tuning abstraction strategies of static program analyzers in a fully automated manner. Parf models various types of external parameters (encoding abstraction strategies) as random variables subject to probability distributions over latticed parameter spaces. It incrementally refines the probability distributions based on accumulated intermediate results generated by repeatedly sampling and analyzing, thereby ultimately yielding a set of highly accurate abstraction strategies. Parf is implemented on top of Frama-C/Eva – an off-the-shelf open-source static analyzer for c programs. Parf provides a web-based user interface facilitating the intuitive configuration of static analyzers and visualization of dynamic distribution refinement of the abstraction strategies. It further supports the identification of dominant parameters in Frama-C/Eva analysis. Benchmark experiments and a case study demonstrate the competitive performance of Parf for analyzing complex, large-scale real-world programs.

Publication
Journal of Computer Science and Technology, xx
Zhongyi Wang
Zhongyi Wang
Ph.D. Candidate

My research interests include formal verification and programming analysis.

Mingshuai Chen
Mingshuai Chen
ZJU100 Young Professor

My research interests include formal verification, programming theory, and logical aspects of computer science.

Tengjie Lin
Tengjie Lin
M.Sc. Candidate

My research interests include formal methods and programming analysis.

Linyu Yang
Linyu Yang
Ph.D. Candidate

My research interests include formal verification, programming analysis, and type theory.