Termination of Single-Path Polynomial Loop Programs

Termination analysis of polynomial programs plays a very important role in applications of safety critical software. In this paper, we investigate the termination problem of single-path polynomial loop programs (SPLPs) over the reals. For such a loop program, we first assume that the set characterized by its loop guards is closed, bounded and connected. And then, we give some conditions and prove that under such conditions, the termination of single-path loop programs is decidable over the reals.

[1]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[2]  Ashish Tiwari,et al.  Synthesis for Polynomial Lasso Programs , 2013, VMCAI.

[3]  Changbo Chen,et al.  Quantifier elimination by cylindrical algebraic decomposition based on regular chains , 2014, J. Symb. Comput..

[4]  Matthias Heizmann,et al.  Ranking Templates for Linear Loops , 2014, Log. Methods Comput. Sci..

[5]  Ashish Tiwari,et al.  Termination of Linear Programs , 2004, CAV.

[6]  Jochen Hoenicke,et al.  Linear Ranking for Linear Lasso Programs , 2013, ATVA.

[7]  Amir M. Ben-Amram,et al.  Ranking Functions for Linear-Constraint Loops , 2012, JACM.

[8]  Seth Pettie,et al.  Linear-Time Approximation for Maximum Weight Matching , 2014, JACM.

[9]  Henny B. Sipma,et al.  The Polyranking Principle , 2005, ICALP.

[10]  Allen Van Gelder,et al.  Termination detection in logic programs using argument sizes (extended abstract) , 1991, PODS.

[11]  Johannes J. Duistermaat,et al.  Multidimensional real analysis , 2004 .

[12]  Supratik Mukhopadhyay,et al.  Termination Proofs for Linear Simple Loops , 2012, SAS.

[13]  Amir M. Ben-Amram.  The Hardness of Finding Linear Ranking Functions for Lasso Programs , 2014, GandALF.

[14]  Frédéric Mesnard,et al.  A new look at the automatic synthesis of linear ranking functions , 2012, Inf. Comput..

[15]  Chaochen Zhou,et al.  Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems , 2007, ICTAC.

[16]  Henny B. Sipma,et al.  Termination of Polynomial Programs , 2005, VMCAI.

[17]  Bican Xia,et al.  Termination of linear programs with nonlinear constraints , 2010, J. Symb. Comput..

[18]  Frédéric Mesnard,et al.  Eventual linear ranking functions , 2013, PPDP.

[19]  Sumit Gulwani,et al.  Proving Conditional Termination , 2008, CAV.

[20]  Andreas Podelski,et al.  A Complete Method for the Synthesis of Linear Ranking Functions , 2004, VMCAI.

[21]  Henny B. Sipma,et al.  Linear Ranking with Reachability , 2005, CAV.

[22]  Pierre Ganty,et al.  Proving Termination Starting from the End , 2013, CAV.

[23]  Henny B. Sipma,et al.  Synthesis of Linear Ranking Functions , 2001, TACAS.

[24]  Ming Xu,et al.  Discovering non-terminating inputs for multi-path polynomial programs , 2014, J. Syst. Sci. Complex..

[25]  Mark Braverman,et al.  Termination of Integer Linear Programs , 2006, CAV.

[26]  Florian Zuleger,et al.  Ramsey vs. Lexicographic Termination Proving , 2013, TACAS.

[27]  Samir Genaim,et al.  On the linear ranking problem for integer linear-constraint loops , 2012, POPL.