期刊文献+

多区间上非线性程序的终止性判定 被引量:3

Termination of Non-linear Programs over the Set of Intervals
下载PDF
导出
摘要 主要解决了如下形式的程序的终止性判定的问题:wh ile(x∈Ω)do{x:=f(x)}end,其中,x为程序变元,Ω(Ω=(a1,b1‖∪‖a2,b2‖∪…∪‖an,bn),其中,‖∈{(,),[,]},n∈N*)是间段并集,f是一个多项式函数。证明了:当φ(b1)φ(a2)>0,…,φ(bn-1)φ(an)>0(其中,φ(x)=f(x)-x)时,这类区间上的非线性程序不终止的必要条件是:在Ω内部或者边界上存在不动点。如果不动点仅仅在Ω内部,则上述结果是充要条件。通过添加一定的约束条件,对于仅区间边界有不动点的情况,也给出了判定的方法。对一类多项式函数的终止性给出了完备性的算法(TNPSI)。 The solution of the following programs:while(x∈Ω) do {x:=f(x)} end,which was called as Non-linear Programs over intervals,was presented,where x was a program variable,Ω(Ω=(a1,b1‖∪‖a2,b2‖∪…∪‖an,bn),while ‖∈{(,),[,]},n∈N) was a set of intervals,and f was a polynomial function.It was proved that,whenφ(b1)φ(a2)0,…,φ(bn-1)φ(an)0(φ(x)=f(x)-x),the necessary condition for non-termination of the above program was that there existed fixed point within Ω or on the boundaries of Ω.Furthermore,if there were fixed points within Ω,the above condition was not only necessary but also sufficient.When all fixed points were on the boundaries of Ω,the corresponding necessary and sufficient condition of nontermination was established by introducing more constraints,and a decision algorithm for continuous polynomial function was presented.
出处 《四川大学学报(工程科学版)》 EI CAS CSCD 北大核心 2011年第3期76-80,共5页 Journal of Sichuan University (Engineering Science Edition)
基金 国家重点基础研究发展计划资助项目(2004CB318003)
关键词 程序验证 计算机代数 非线性程序 不动点 program verification computer algebra nonlinear program fixed point
  • 相关文献

参考文献4

二级参考文献19

  • 1杨路,侯晓荣,夏壁灿.A complete algorithm for automated discovering of a class of inequality-type theorems[J].Science in China(Series F),2001,44(1):33-49. 被引量:24
  • 2梁松新,张景中.A complete discrimination system for polynomials with complex coefficients and its automatic generation[J].Science China(Technological Sciences),1999,42(2):113-128. 被引量:4
  • 3Podelski A, Rybalchenko A. A complete method for the synthesis of linear ranking functions. In: Steffen B, ed. Proc. of the Verification, Model Checking, and Abstract Interpretation. LNCS 2937, Heidelberg: Springer-Verlag, 2004. 239-251.
  • 4Dams D, Gerth R, Grumberg O. A heuristic for the automatic generation of ranking functions. In: Alur R, ed. Proc. of the Workshop on Advances in Verification. Chicago: University of Utah Press, 2000. 1-8.
  • 5Colon M, Sipma HB. Synthesis of linear ranking functions. In: Margaria T, ed. Proc. of the Tools and Algorithms for Construction and Analysis of Systems. LNCS 2031, Heidelberg: Springer-Verlag, 2001.67-81.
  • 6Chen YH, Xia BC, Yang L, Zhan N J, Zhou CC. Discovering non-linear ranking functions by solving semi-algebraic systems. In: John F, ed. Proe. of the Theoretical Aspects of Computing (ICTAC 2007). Heidelberg: Springer-Verlag, 2007.34-49.
  • 7Tiwari A. Termination of linear programs. In: Alur R, ed. Proc. of the Computer Aided Verification. LNCS 3114, Heidelberg: Springer-Verlag, 2004. 70-82.
  • 8Cousot P. Proving program invariance and termination by parametric abstraction, Lagrangian relaxation and semi-definite programming. In: Cousot R, ed. Proc. of the Verification, Model Checking, and Abstract Interpretation. LNCS 3385, Heidelberg: Springer-Verlag, 2005.61-81.
  • 9Bradley AR, Manna Z, Sipma HB. Termination of polynomial programs. In: Cousot R, ed. Proc. of the Verification, Model Checking, and Abstract Interpretation. LNCS 3385, Heidelberg: Springer-Verlag, 2005. 113-129.
  • 10Yang L, Zhan NJ, Xia BC, Zhou CC. Program verification by using DISCOVERER. In: Meyer B, ed. Proc. of the Verified Software. LNCS 4171, Heidelberg: Springer-Verlag, 2008. 528-538.

共引文献58

同被引文献52

  • 1李骏,李轶,冯勇.一类循环条件非线性的程序终止性[J].四川大学学报(工程科学版),2009,41(1):129-133. 被引量:4
  • 2李骏,李轶,冯勇,秦小林.线性程序的Ranking函数自动合成[J].四川大学学报(工程科学版),2009,41(5):176-181. 被引量:1
  • 3范年柏.程序正确性验证的几个问题.计算机应用,2005,25:10-20.
  • 4Alan Turing.On computable numbers,with all application to the ents-cheidungs problem[J].London Mathematical Society,1936,42(2):230-265.
  • 5Tiwari.Termination of linear programs[C] //Proceedings of the Com-puter Aided Verification,Lecture Notes in Computer Science,2004,Volume3114,2004:70-82.
  • 6Bican Xia,Lu Yang,Naijun Zhan,et al.Symbolic decision procedure for termination of linear programs[J].Formal Aspects of Computing,2011,23(2):171-190.
  • 7Babic D,Hu A J,Rakamaric Z,et al.Cook.Proving Termination by Divergence[C] //Proceedings of the fifth IEEE International Confer-ence on Software Engineering and Formal Methods.London,2007:93-102.
  • 8罗宾逊.动力系统导论[M].韩茂安,等译.北京:机械工业出版社,2007.
  • 9Bradley A,Manna Z,Sipma H.Termination analysis of integer linear loops[C] //Proceedings of the Concurrency Theory,Lecture Notes in Computer Science,2005,Volume3653,2005:488-502.
  • 10Yang L,Zhou C,Zhan N,et al.Recent advances in program verifica-tion through computer algebra[J].In Front.Comput.Sci.China,2010,4(1):1-16.

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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