Termination proofs for linear simple loops

Autor: Supratik Mukhopadhyay, Hong Yi Chen, Shaked Flur
Rok vydání: 2013
Předmět:
Zdroj: International Journal on Software Tools for Technology Transfer. 17:47-57
ISSN: 1433-2787
1433-2779
Popis: Analysis of termination and other liveness properties of a program can be reduced to termination proof synthesis for simple loops, i.e., loops with only variable updates in the loop body. Among simple loops, the subset of linear simple loops (LSLs) is particularly interesting because it is common in practice and expressive in theory. Existing techniques can successfully synthesize a linear ranking function for an LSL if there exists one. However, when a terminating LSL does not have a linear ranking function, these techniques fail. In this paper, we describe an automatic method that generates proofs of (universal) termination for LSLs based on the synthesis of disjunctive ranking relations. The method repeatedly finds linear ranking functions on partitions of the state space and checks whether the transitive closure of the transition relation is included in the union of the ranking relations. Our method extends the work of Podelski and Rybalchenko (A complete method for the synthesis of linear ranking functions. In: Proceedings of the 5th international conference on VMCAI, Jan 2004, Venice, Italy, pp 239---251, 2004). We have implemented a prototype of the method and have shown experimental evidence of the effectiveness of our method.
Databáze: OpenAIRE
Externí odkaz: