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

Horn-ICE学习用于合成不变量和契约

Horn-ICE Learning for Synthesizing Invariants and Contracts

Indian Institute of Science(印度科学学院);Amazon India(亚马逊印度);University of Illinois, Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);Max Planck Institute for Software Systems(马克斯·普朗克软件系统研究所)

Deepak D'Souza, P. Ezudheen, Pranav Garg, P. Madhusudan, Daniel Neider

摘要:

我们设计了学习算法合成不变量使用霍恩蕴涵反例(霍恩ICE),扩展ICE学习模型。特别是,我们描述了一个决策树学习算法,学习霍恩ICE样本,工作在多项式时间,并使用统计算法来学习小树,满足样本。由于大多数验证证明可以使用Horn子句建模,Horn-ICE学习是一种更强大的技术,可以学习证明程序正确的归纳注释。我们的实验表明,我们的算法的实现是能够学习足够的归纳不变量和合同有效地为各种顺序和并发程序。

英文摘要:

We design learning algorithms for synthesizing invariants using Horn implication counterexamples (Horn-ICE), extending the ICE-learning model. In particular, we describe a decision-tree learning algorithm that learns from Horn-ICE samples, works in polynomial time, and uses statistical heuristics to learn small trees that satisfy the samples. Since most verification proofs can be modeled using Horn clauses, Horn-ICE learning is a more robust technique to learn inductive annotations that prove programs correct. Our experiments show that an implementation of our algorithm is able to learn adequate inductive invariants and contracts efficiently for a variety of sequential and concurrent programs.

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

↑