期刊文献+

单分支线性约束循环程序的终止性分析

Termination Analysis of Single-path Linear Constraint Loops
下载PDF
导出
摘要 秩函数法是循环终止性分析的主要方法,秩函数的存在表明了循环程序是可终止的.针对单分支线性约束循环程序,提出一种方法对此类循环的终止性进行分析.基于增函数法向空间的计算,该方法将原程序空间上的秩函数计算问题归结为其子空间上的秩函数计算问题.实验结果表明,该方法能有效验证现有文献中大部分循环程序的终止性. The ranking function method is the main method for the termination analysis of loops,and it indicates that loop programs can be terminated.In view of single-path linear constraint loop programs,this study presents a method to analyze the termination of the loops.Based on the calculation of the normal space of the increasing function,this method considers the calculation of the ranking function in the original program space as that in the subspace.Experimental results show that the method can effectively verify the termination of most loop programs in the existing literature.
作者 李轶 唐桐 LI Yi;TANG Tong(Automated Reasoning and Cognition Center,Chongqing Institute of Green and Intelligent Technology,Chinese Academy of Sciences,Chongqing 400714,China;University of Chinese Academy of Sciences,Beijing 100049,China)
出处 《软件学报》 EI CSCD 北大核心 2024年第3期1307-1320,共14页 Journal of Software
基金 重庆市自然科学基金(cstc2019jcyj-msxmX0638) 国家自然科学基金(11771421) 中国科学院“西部之光”人才培养计划。
关键词 循环程序 线性秩函数 增函数 终止性 多阶段秩函数 loop program linear ranking function increasing function termination multiphase ranking function
  • 相关文献

参考文献2

二级参考文献22

  • 1Deepak KAPUR.A QUANTIFIER-ELIMINATION BASED HEURISTIC FOR AUTOMATICALLY GENERATING INDUCTIVE ASSERTIONS FOR PROGRAMS[J].Journal of Systems Science & Complexity,2006,19(3):307-330. 被引量:3
  • 2Turing A, On computable numbers, with an application to the entscheidungsproblem, Proc. of the London Mathematical Society, 1937, $2-42(1): 230-265.
  • 3Tiwari A, Termination of linear programs, Computer Aided Verification (ed. by Alur R and Peled D), Springer-Verlag, Lecture Notes in Computer Science, 2004, 3114: 70-82.
  • 4Braverman M, Termination of integer linear programs, Computer Aided Verification (ed. by Ball T and Jones R B), Springer-Verlag, Lecture Notes in Computer Science, 2006 4144: 372-385.
  • 5Bradley A R, Manna Z, and Sipma H B, Termination of polynomial programs, Verification, Model Checking, and Abstract Interpretation (ed. by Cousot R), Springer, Lecture Notes in Computer Science, 2005, 3385:113 129.
  • 6Babic D, Hu A J, Rakamaric Z, and Cook engineering and formal methods, IEEE, 2007, B, Proving termination by divergence: Software 93-102.
  • 7ColSn M and Sipma H B, Synthesis of linear ranking functions, Tools and Algorithms for the Construction and Analysis of Systems (ed. by Margaria T and Yi W), Springer-Verlag, Lecture Notes in Computer Science, 2001, 2031: 67-81.
  • 8Col6n M and Sipma H B, Practical methods for proving program termination, Computer Aided Verification (ed. by Brinksma E and Larsen K G), Springer-Verlag, Lecture Notes in Computer Science, 2002, 2404: 442-454.
  • 9Podelski A and Rybalchenko A, A complete method for the synthesis of linear ranking functions, Verification, Model Checking, and Abstract Interpretation (ed. by Steffen B and Levi G), Springer, Lecture Notes in Computer Science, 2004, 2937:239- 251.
  • 10Bradley A R, Manna Z, and Sipma H B, Termination analysis of integer linear loops, Concurrency Theory, 16th International Conference, Springer-Verlag, Lecture Notes in Computer Science, 2005, 3653: 488-502.

共引文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部