34 citations · 39 across the 3 of their papers we have counts for
3 papers
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…
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…
Polytool: polynomial interpretations as a basis for termination analysis of Logic programs
Manh Thang Nguyen, Danny De Schreye, Jürgen Giesl +1
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt term…