【24h】

Synthesizing Nested Ranking Functions for Loop Programs via SVM

机译:通过SVM合成循环程序的嵌套排名函数

获取原文

摘要

Termination of programs is probably the most famous unde-cidable problem in computer science. Despite this undecidability result, a lot of effort has been spent on improving algorithms that prove termination of loops, which is one of the building blocks of software reliability analysis. These algorithms are usually focused on finding an appropriate ranking function for the loop, which proves its termination. In this paper, we consider nested ranking functions for loop programs and show that the existence problem of a nested ranking function is equivalent to the existence problem of a hyperplane separating classes of data. This allows us to leverage Support-Vector Machines (SVM) techniques for the synthesis of nested ranking functions. SVM are supervised learning algorithms that are used to classify data; they work by finding a hyperplane separating data points parted into two classes. We show how to carefully define the data points so that the separating hyperplane gives rise to a nested ranking function for the loop. Experimental results confirm the effectiveness of our SVM-based synthesis of nested ranking functions.
机译:程序终止可能是计算机科学中最著名的无法解决的问题。尽管有这种不确定性的结果,但仍在改进算法上花费了大量精力,这些算法证明了循环的终止,这是软件可靠性分析的基础之一。这些算法通常专注于为循环找到合适的排名函数,以证明其终止。在本文中,我们考虑了循环程序的嵌套排序函数,并表明嵌套排序函数的存在问题等同于分离数据类的超平面的存在问题。这使我们能够利用支持向量机(SVM)技术来综合嵌套排名功能。 SVM是用于对数据进行分类的监督学习算法;他们通过找到一个将数据点分成两类的超平面来工作。我们展示了如何仔细定义数据点,以使分离的超平面产生循环的嵌套排名函数。实验结果证实了我们基于SVM的嵌套排名函数综合的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号