Ranking Functions for Linear-Constraint Loops

8 pages•Published: July 25, 2013

Abstract

Ranking functions are a tool successfully used in termination analysis, complexity analysis, and program parallelization.
Among the different types of ranking functions and approaches to finding them, this talk will concentrate on
functions that are found by linear programming techniques. The setting is that of
a loop that has been pre-abstracted so that
it is described by linear constraints over a finite set of numeric variables.
I will review results (more or less recent) regarding the search for
ranking functions which are either linear or lexicographic-linear.

In: Alexei Lisitsa and Andrei Nemytykh (editors). VPT 2013. First International Workshop on Verification and Program Transformation, vol 16, pages 1-8.

Links:	https://easychair.org/publications/paper/kqj
	https://doi.org/10.29007/rvs4

BibTeX entry

@inproceedings{VPT2013:Ranking_Functions_Linear_Constraint,
  author    = {Amir Ben-Amram},
  title     = {Ranking Functions for Linear-Constraint Loops},
  booktitle = {VPT 2013. First International Workshop on Verification and Program Transformation},
  editor    = {Alexei Lisitsa and Andrei Nemytykh},
  series    = {EPiC Series in Computing},
  volume    = {16},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/kqj},
  doi       = {10.29007/rvs4},
  pages     = {1-8},
  year      = {2013}}

Download PDF Open PDF in browser