Continuously Reasoning about Programs via Differential Bayesian Inference

Abstract

Programs often evolve continuously by integrating changes from multiple programmers. The effective adoption of program analysis tools in this continuous integration setting is hindered by the need to only report alarms relevant to a particular program change. We present a probabilistic framework, Drake, to apply program analyses to continuously evolving programs. Drake is applicable to a broad range of analyses that are based on deductive reasoning. The key insight underlying Drake is to compute a graph that concisely and precisely captures differences between the derivations of alarms produced by the given analysis on the program before and after the change. Performing Bayesian inference on the graph thereby enables to rank alarms by likelihood of relevance to the change. We evaluate Drake using Sparrow – a static analyzer that targets buffer-overrun, format-string, and integer-overflow errors—on a suite of ten widely-used C programs each comprising 13k–112k lines of code. Drake enables to discover all true bugs by inspecting only 30 alarms per benchmark on average, compared to 85 (3X more) alarms by the same ranking approach in batch mode, and 118 (4X more) alarms by a differential approach based on syntactic masking of alarms which also misses 4 of the 26 bugs overall.

Publication
In The ACM SIGPLAN conference on Programming Language Design and Implementation
Date