Integrating Answer Literals with AVATAR for Program Synthesis

Abstract

We recently introduced a framework for program synthesis based on functional specifications using a saturation-based theorem prover.To make our synthesis technique efficient, we need to incorporate it into the prover's architecture.In this paper, we describe the considerations of integrating our synthesis technique with the AVATAR splitting framework used in first-order theorem proving.We present an example that illustrates the issues accompanying the integration and describe our solution: constraining the splitting and adding an additional inference rule replacing certain clauses with AVATAR assertions by assertion-free clauses.Our experimental results indicate that the integration significantly improves the synthesis performance on some benchmarks.