Eventual linear ranking functions

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

http://hal.univ-reunion.fr/hal-01451694
Contributor : Réunion Univ <>
Submitted on : Friday, November 16, 2018 - 9:45:56 AM
Last modification on : Thursday, March 28, 2019 - 11:24:10 AM
Long-term archiving on : Sunday, February 17, 2019 - 12:51:13 PM

File

Eventual_linear_ranking_functi...
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

93

Files downloads

68