Abstract
Proving termination of program loops is necessary in many applications, especially those safety critical software. Discovering ranking function is a classical method to prove the termination, but the existence of ranking function is a sufficient condition on the termination of a loop program. In this paper, we present an algorithm to remedy the limitation of ranking function for analyzing the termination of linear programs with conditionals. We transform the linear loop programs with conditionals into the nested linear loop programs, and then check whether the inner loop terminates or not by positive eigenvalues and their corresponding eigenvectors. If one of the inner loop in the nested linear loop is nonterminating, then the linear loop is nonterminating. Otherwise, we use discovering ranking functions based on qualifier elimination to analyze the termination of the linear loop. To illustrate the main idea of the algorithm, we perform it on some examples.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
