On the Linear Ranking Problem for Simple Floating-Point Loops

Abstract : Termination of loops can be inferred from the existence of linear ranking functions. We already know that the existence of thesefunctions is PTIME decidable for simple rational loops. Since very recently, we know that the problem is coNP-complete for simple integer loops. We continue along this path by investigating programs dealing with floating-point computations. First, we show that the problem is at least in coNP for simple floating-point loops. Then, in order to work around that theoretical limitation we present an algorithm which remains polynomial by sacrificing completeness. The algorithm, based on the Podelski-Rybalchenko algorithm, can also synthesize in polynomial time the linear ranking functions it detects. To our knowledge, our work is the first adaptation of this well-known algorithm to floating-points.
Document type :
Conference papers
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

http://hal.univ-reunion.fr/hal-01451688
Contributor : Réunion Univ <>
Submitted on : Monday, November 5, 2018 - 11:04:45 AM
Last modification on : Monday, September 2, 2019 - 9:41:20 AM
Long-term archiving on : Wednesday, February 6, 2019 - 2:43:46 PM

File

sas16.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Etienne Payet, Fonenantsoa Maurica, Frédéric Mesnard. On the Linear Ranking Problem for Simple Floating-Point Loops. 23rd International Symposium on Static Analysis (SAS), Sep 2016, Edinburgh, United Kingdom. pp.300-316, ⟨10.1007/978-3-662-53413-7_15⟩. ⟨hal-01451688⟩

Share

Metrics

Record views

52

Files downloads

67