Scalable error detection using boolean satisfiability

We describe a software error-detection tool that exploits re-cent advances in boolean satisfiability (SAT) solvers. Our analysis is path sensitive, precise down to the bit level, and models pointers and heap data. Our approach is also highly scalable, which we achieve using two techniques. First, for each program function, several optimizations compress the size of the boolean formulas that model the control- and data-flow and the heap locations accessed by a function. Second, summaries in the spirit of type signatures are com-puted for each function, allowing inter-procedural analysis without a dramatic increase in the size of the boolean con-straints to be solved. We demonstrate the effectiveness of our approach by con-structing a lock interface inference and checking tool. In an interprocedural analysis of more than 23,000 lock related functions in the latest Linux kernel, the checker generated 300 warnings, of which 179 were unique locking errors, a false positive rate of only 40%