Abstract
We present an algorithm to prove termination of programs. The method relies on the fact that the program loop can be represented by a non-trivial MSCS of the program's CFG, and we show that the program termination is equivalent to the existence of ranking function for each SCS of the program's CFG. We give an example to show the algorithm is feasible. It has a potential application to determine the program termination automatically.
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.
