In this article, 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 model numerous static analysis problems (e.g., safety proving, bug finding, termination and non-termination proving, refactoring). As our focus is on programs that use bit-vectors, we build a decision procedure for this fragment over finite domains in the form of a program synthesiser. We provide instantiations of our framework for solving a diverse range of program verification tasks such as termination, non-termination, safety and bug finding, superoptimisation, and refactoring. Our experimental results show that our program synthesiser compares positively with specialised tools in each area as well as with general-purpose synthesisers.

@article{paperbot320,
  title = {Program Synthesis for Program Analysis},
  author = {Cristina David and Pascal Kesseli and Daniel Kroening and Matt Lewis},
  journal = {ACM Transactions on Programming Languages and Systems},
  volume = {40},
  number = {2},
  year = {2018},
  doi = {10.1145/3174802}
}