34 citations · 39 across the 3 of their papers we have counts for
Showing cs.LOShow all
2 papers · 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…
cs.LO2010★ 34 cited
Automated Termination Analysis for Logic Programs with Cut
Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder +2
Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, wherea…