69 citations · 153 across the 16 of their papers we have counts for
17 papers
Termination Analysis of Linear-Constraint Programs
Amir M. Ben-Amram, Samir Genaim, Joël Ouaknine +1
This paper provides an overview of techniques in termination analysis for programs with numerical variables and transitions defined by linear constraints. This subarea of program a…
On representations of real numbers and the computational complexity of converting between such representations
Amir M. Ben-Amram, Lars Kristiansen, Jakob Grue Simonsen
We study the computational complexity of converting one representation of real numbers into another representation. Typical examples of representations are Cauchy sequences, base-1…
Tight Polynomial Bounds for Loop Programs in Polynomial Space
A. M. Ben-Amram, G. W. Hamilton
We consider the following problem: given a program, find tight asymptotic bounds on the values of some variables at the end of the computation (or at any given program point) in te…
Tight Polynomial Worst-Case Bounds for Loop Programs
Amir M. Ben-Amram, Geoff Hamilton
In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple programming language - representing non-deterministic imperative programs with bounded loops, and arithmetics lim…
Multiphase-Linear Ranking Functions and their Relation to Recurrent Sets
Amir M. Ben-Amram, Jesús J. Doménech, Samir Genaim
Multiphase ranking functions (MRFs) are tuples of linear functions that are often used to prove termination of loops in which the computation pr…
On Multiphase-Linear Ranking Functions
Amir M. Ben-Amram, Samir Genaim
Multiphase ranking functions () were proposed as a means to prove the termination of a loop in which the computation progresses through a number of "phases", and th…