most citedComplexity of Bradley-Manna-Sipma Lexicographic Ranking Functions

3 citations · 4 across the 2 of their papers we have counts for

collaborators
Showing cs.LOShow all

1 paper · 1 filter

cs.LO2011★ 1 cited

SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers

Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram +2

We describe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial ext…