Using program synthesis for program analysis

Conference item

In this paper, we propose a unified framework for designing static analysers based on program synthesis. For this purpose, we identify a fragment of second-order logic with restricted quantification that is expressive enough to capture numerous static analysis problems (e.g. safety proving, bug finding, termination and non-termination proving, superoptimisation). We call this fragment the synthesis fragment. We build a decision procedure for the synthesis fragment over finite domains in the form of a program synthesiser. Given our initial motivation to solve static analysis problems, this synthesiser is specialised for such analyses. Our experimental results show that, on benchmarks capturing static analysis problems, our program synthesiser compares positively with other general purpose synthesisers.

Authors: David, C; Kroening, D; Lewis, M

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Springer
• Host title: Lecture Notes in Computer Science: LPAR: Logic for Programming, Artificial Intelligence, and Reasoning
• Journal: Lecture Notes in Computer Science: LPAR: Logic for Programming, Artificial Intelligence, and Reasoning
• Volume: 9450
• Pages: 483-498
• Publication date: 2015-11-22
• DOI: 10.1007/978-3-662-48899-7_34
• ISSN: 0302-9743 and 1611-3349
• ISBN: 9783662488980
• Keywords: SBTMR