On abstraction refinement for program analyses in Datalog

Conference item

A central task for a program analysis concerns how to efficiently find a program abstraction that keeps only information relevant for proving properties of interest. We present a new approach for finding such abstractions for program analyses written in Datalog. Our approach is based on counterexample-guided abstraction refinement: when a Datalog analysis run fails using an abstraction, it seeks to generalize the cause of the failure to other abstractions, and pick a new abstraction that avoids a similar failure. Our solution uses a boolean satisfiability formulation that is general, complete, and optimal: it is independent of the Datalog solver, it generalizes the failure of an abstraction to as many other abstractions as possible, and it identifies the cheapest refined abstraction to try next. We show the performance of our approach on a pointer analysis and a typestate analysis, on eight real-world Java benchmark programs.

Authors: Zhang, X; Mangal, R; Grigore, R; Naik, M; Yang, H

• Publication status: Published
• Peer review status: Reviewed (other)
• Publisher: Association for Computing Machinery
• Host title: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation
• Journal: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation
• Pages: 239-248
• Publication date: 2014-09-06
• Acceptance date: 2014-02-05
• DOI: 10.1145/2594291.2594327
• EISSN: 1558-1160
• ISBN: 9781450327848