A Complete Method for the Synthesis of Linear Ranking Functions

  • Andreas Podelski
  • Andrey Rybalchenko
Conference paper

DOI: 10.1007/978-3-540-24622-0_20

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2937)
Cite this paper as:
Podelski A., Rybalchenko A. (2004) A Complete Method for the Synthesis of Linear Ranking Functions. In: Steffen B., Levi G. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2004. Lecture Notes in Computer Science, vol 2937. Springer, Berlin, Heidelberg

Abstract

We present an automated method for proving the termination of an unnested program loop by synthesizing linear ranking functions. The method is complete. Namely, if a linear ranking function exists then it will be discovered by our method. The method relies on the fact that we can obtain the linear ranking functions of the program loop as the solutions of a system of linear inequalities that we derive from the program loop. The method is used as a subroutine in a method for proving termination and other liveness properties of more general programs via transition invariants; see [PR03].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Andreas Podelski
    • 1
  • Andrey Rybalchenko
    • 1
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations