微信服务号

微信订阅号

2025-4-24- 9
Home > Archive>Volume 30, Issue 7, 2019 >1903-1915. DOI:10.13328/j.cnki.jos.005748
PDF HTML XML Export Cite reminder
SVM-based Method for Detecting Ranking Functions in Polynomial Loop Programs
Author:
Affiliation:

Clc Number:

TP301

Fund Project:

National Natural Science Foundation of China (61572024, 61103110, 11471307)

  • Article
    • | |
  • Metrics
    • |
  • Reference
    • |
  • Related
    • |
  • Cited by
    • | |
  • Comments
    Abstract:

    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.

    Reference
    Related
    Cited by
Get Citation

李轶,蔡天训,樊建峰,吴文渊,冯勇.基于SVM的多项式循环程序秩函数生成.软件学报,2019,30(7):1903-1915

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 10,2018
  • Revised:September 28,2018
  • Online: April 03,2019
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063