Open AccessRanking Functions for Linear-Constraint Loops
Author(s) -
Amir M. Ben-Amram,
Samir Genaim
Publication year - 2018
Publication title -
epic series in computing
Language(s) - English
Resource type - Conference proceedings
ISSN - 2398-7340
DOI - 10.29007/rvs4
Subject(s) - lexicographical order , ranking (information retrieval) , linear programming , computer science , set (abstract data type) , constraint (computer aided design) , mathematical optimization , algorithm , theoretical computer science , mathematics , artificial intelligence , programming language , combinatorics , geometry
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.