arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.09909cs.PL
收藏

学习归纳不变量的边界

Learning the Boundary of Inductive Invariants

Yotam M. Y. Feldman, Mooly Sagiv, Sharon Shoham, James R. Wilcox

摘要:

我们研究了不变推理的复杂性及其与精确概念学习的联系。我们定义了一个条件的不变量和它们的几何形状,称为栅栏条件,它允许应用精确概念学习的理论结果来回答不变量推理理论中的开放问题。该条件要求不变量的边界-状态的汉明距离不变的是一-是向后可达的坏状态在一个小的步骤。使用这个条件,我们获得了第一个多项式的复杂性结果的插值为基础的不变的推理算法,有效地推断单调DNF不变量与访问SAT求解器作为一个预言。我们进一步利用Bshouty的开创性成果,在概念学习,有效地推断出一个更大的语法类的不变量超越单调DNF的不变量。最后,我们考虑的鲁棒性推理下的程序转换。我们表明,一些简单的变换保持栅栏条件,它是敏感的更复杂的变换。

英文摘要:

We study the complexity of invariant inference and its connections to exact concept learning. We define a condition on invariants and their geometry, called the fence condition, which permits applying theoretical results from exact concept learning to answer open problems in invariant inference theory. The condition requires the invariant's boundary---the states whose Hamming distance from the invariant is one---to be backwards reachable from the bad states in a small number of steps. Using this condition, we obtain the first polynomial complexity result for an interpolation-based invariant inference algorithm, efficiently inferring monotone DNF invariants with access to a SAT solver as an oracle. We further harness Bshouty's seminal result in concept learning to efficiently infer invariants of a larger syntactic class of invariants beyond monotone DNF. Lastly, we consider the robustness of inference under program transformations. We show that some simple transformations preserve the fence condition, and that it is sensitive to more complex transformations.

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

↑