activity
20032025
most citedProving Termination Starting from the End

16 citations · 32 across the 12 of their papers we have counts for

collaborators

14 papers

cs.PL2025

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…

cs.PL2021

Termination Analysis of Programs with Multiphase Control-Flow

Jesús J. Domenech, Samir Genaim

Programs with multiphase control-flow are programs where the execution passes through several (possibly implicit) phases. Proving termination of such programs (or inferring corresp…

cs.PL2019

A Transformational Approach to Resource Analysis with Typed-norms Inference

Elvira Albert, Samir Genaim, Raúl Gutiérrez +1

In order to automatically infer the resource consumption of programs, analyzers track how data sizes change along program's execution. Typically, analyzers measure the sizes of dat…

cs.PL2019

Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis

Jesús J. Doménech, John P. Gallagher, Samir Genaim

Control-flow refinement refers to program transformations whose purpose is to make implicit control-flow explicit, and is used in the context of program analysis to increase precis…

cs.PL2018

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…

cs.PL2017★ 2 cited

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…