Termination of Loop Programs with Polynomial Guards

Bin Wu,Zhongqin Bi,Liyong Shen,Zhenbing Zeng

doi:10.1007/978-3-642-12189-0_42

Termination of Loop Programs with Polynomial Guards

Bin Wu, Zhongqin Bi + Show 2 more

https://doi.org/10.1007/978-3-642-12189-0_42

Copy DOI

Publication Date: Jan 1, 2010

Citations: 22

Affiliation: Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, University of Chinese Academy of Sciences

#Termination Of Programs #Linear Assignments + Show 8 more

Abstract
Full-Text
Similar Papers

Abstract

Termination analysis of loop programs is very important in many applications, especially in those of safety critical software. In this paper, the termination of programs with polynomial guards and linear assignments is simplified to decide solvability of semi-algebraic systems(SAS). If the number of functions are finite or the functions are integer periodic, then the termination of programs is decidable. The discussion is based on simplifying the linear loops by its Jordan form. And then the process to find the nonterminating points for general polynomial guards is proposed. For avoiding floating point computations in the process, a symbolic algorithm is given to compute the Jordan form of a matrix.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.