The Polyranking Principle

Although every terminating loop has a ranking function, not every loop has a ranking function of a restricted form, such as a lexicographic tuple of polynomials over program variables. The polyranking principle is proposed as a generalization of polynomial ranking for analyzing termination of loops. We define lexicographic polyranking functions in the context of loops with parallel transitions consisting of polynomial assertions, including inequalities, over primed and unprimed variables. Next, we address synthesis of these functions with a complete and automatic method for synthesizing lexicographic linear polyranking functions with supporting linear invariants over linear loops.

• Type: Conference
• Year: 2005
• Where: ICALP
• Authors: Aaron R. Bradley, Zohar Manna, Henny B. Sipma
• Keywords: ICALP 2005, Lexicographic, Lexicographic Polyranking Functions, Ranking Function, Theoretical Computer Science