69 citations · 153 across the 16 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.PL2012★ 69 cited
Ranking Functions for Linear-Constraint Loops
Amir M. Ben-Amram, Samir Genaim
In this paper we study the complexity of the problems: given a loop, described by linear constraints over a finite set of variables, is there a linear or lexicographical-linear ran…
cs.LO2012★ 3 cited
Bounded Termination of Monotonicity-Constraint Transition Systems
Amir M. Ben-Amram, Michael Vainer
Intuitively, if we can prove that a program terminates, we expect some conclusion regarding its complexity. But the passage from termination proofs to complexity bounds is not alwa…