arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1910.09744cs.PLcs.FLcs.LO
收藏

具有不可解释函数的程序的判定综合

Decidable Synthesis of Programs with Uninterpreted Functions

Paul Krogmeier, Umang Mathur, Adithya Murali, P. Madhusudan, Mahesh Viswanathan

摘要:

我们确定了一个可判定的合成问题的一类程序的无限大小的条件和迭代工作在无限的数据域。我们类中的程序使用未解释的函数和关系,并遵守最近确定的产生可判定验证的称为一致性的限制。我们制定了一个功能强大的语法限制(语法指导)的合成问题,连贯的未解释的程序,我们的问题是可判定的,确定其精确的复杂性,并研究了几个变种的问题。

英文摘要:

We identify a decidable synthesis problem for a class of programs of unbounded size with conditionals and iteration that work over infinite data domains. The programs in our class use uninterpreted functions and relations, and abide by a restriction called coherence that was recently identified to yield decidable verification. We formulate a powerful grammar-restricted (syntax-guided) synthesis problem for coherent uninterpreted programs, and we show the problem to be decidable, identify its precise complexity, and also study several variants of the problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑