Abstract
Termination of loop programs is a hot research in these years. In this paper, we focus on the termination of multi-path linear assignment (MPLA) loop programs. A sufficient criterion is presented to check that such a MAPL loop will terminate. Experimental results show that the proposed method can prove certain MPLA loop will terminate, which cannot be proven by existing approach that tries to find global linear ranking functions or lexicographic linear ranking functions.
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.
