中国科学院重庆绿色智能技术研究院机构知识库

QQ客服 官方微博 反馈留言

	SVM-based Method for Detecting Ranking Functions in Polynomial Loop Programs
	Li, Yi1; Cai, Tian-Xun2; Fan, Jian-Feng1,3; Wu, Wen-Yuan1; Feng, Yong1
	2019
摘要	Synthesizing ranking functions of polynomial loop programs is the dominant method for checking their termination. In this study, the synthesis of ranking functions of a class of polynomial loop program is reduced to the binary problem. The support vector machine (SVM) technique then is applied to solve such the binary problem. This naturally relates detection of ranking functions to SVM. Different from the CAD-based method for synthesizing ranking functions, the proposed method can get more expressive polynomial ranking functions in an acceptable time. © Copyright 2019, Institute of Software, the Chinese Academy of Sciences. All rights reserved.
DOI	10.13328/j.cnki.jos.005748
发表期刊	Ruan Jian Xue Bao/Journal of Software
ISSN	10009825
卷号	30期号:7页码:1903-1915
收录类别	EI
语种	中文