Eventual linear ranking functions - Université de La Réunion Access content directly
Conference Papers Year : 2013

Eventual linear ranking functions


Program termination is a hot research topic in program analysis. The last few years have witnessed the development of termination analyzers for programming languages such as C and Java with remarkable precision and performance. These systems are largely based on techniques and tools coming from the field of declarative constraint programming. In this paper, we first recall an algorithm based on Farkas’ Lemma for discovering linear ranking functions proving termination of a certain class of loops. Then we propose an extension of this method for showing the existence of eventual linear ranking functions, i.e., linear functions that become ranking functions after a finite unrolling of the loop. We show correctness and completeness of this algorithm.
Fichier principal
Vignette du fichier
Eventual_linear_ranking_functions.pdf (225.54 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01451694 , version 1 (16-11-2018)



Roberto Bagnara, Frédéric Mesnard. Eventual linear ranking functions. 15th International Symposium on Principles and Practice of Declarative Programming, PPDP '13, Sep 2013, Madrid, Spain. pp.229--238, ⟨10.1145/2505879.2505884⟩. ⟨hal-01451694⟩
86 View
182 Download



Gmail Mastodon Facebook X LinkedIn More