Synthesis Modulo Recursive Functions
SPLASH(2013)
摘要
We describe techniques for synthesis and verification of recursive functional programs over unbounded domains. Our techniques build on top of an algorithm for satisfiability modulo recursive functions, a framework for deductive synthesis, and complete synthesis procedures for algebraic data types. We present new counterexample-guided algorithms for constructing verified programs. We have implemented these algorithms in an integrated environment for interactive verification and synthesis from relational specifications. Our system was able to synthesize a number of useful recursive functions that manipulate unbounded numbers and data structures.
更多查看译文
关键词
software synthesis,inductive learning,satisfiability modulo theories
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络