Abstract

Termination of linear loop programs has received extensive attention in these years. In this paper, we focus on the termination of multi-path linear constraint loops. For a multi-path linear constraint loop which has no global linear ranking functions or lexicographic linear ranking functions, we present two complete methods to synthesize global eventual linear ranking functions and lexicographic eventual linear ranking functions of such loops, respectively.

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

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.