{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T15:47:43Z","timestamp":1749570463877},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Ranking functions are a tool successfully used in termination analysis, complexity analysis, and program parallelization.<\/jats:p><jats:p>Among the different types of ranking functions and approaches to finding them, this talk will concentrate on<\/jats:p><jats:p>functions that are found by linear programming techniques.  The setting is that of<\/jats:p><jats:p>a loop that has been pre-abstracted so that<\/jats:p><jats:p>it is  described by linear constraints over a finite set of numeric variables.<\/jats:p><jats:p>I will review results (more or less recent) regarding the search for<\/jats:p><jats:p>ranking functions which are either linear or lexicographic-linear.<\/jats:p>","DOI":"10.29007\/rvs4","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T18:02:53Z","timestamp":1516730573000},"page":"1--8","source":"Crossref","is-referenced-by-count":1,"title":["Ranking Functions for Linear-Constraint Loops"],"prefix":"10.29007","volume":"16","author":[{"given":"Amir","family":"Ben-Amram","sequence":"first","affiliation":[]}],"member":"11545","event":{"name":"VPT 2013. First International Workshop on Verification and Program Transformation"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T18:03:56Z","timestamp":1516730636000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/kqj"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/rvs4","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}