most citedSAT-Based Termination Analysis Using Monotonicity Constraints over the Integers

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

collaborators
Showing cs.LOShow all

2 papers · 1 filter

cs.LO2012★ 4 cited

Polynomial Interpretations for Higher-Order Rewriting

Carsten Fuhs, Cynthia Kop

The termination method of weakly monotonic algebras, which has been defined for higher-order rewriting in the HRS formalism, offers a lot of power, but has seen little use in recen…

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…