1 citations · 1 across the 2 of their papers we have counts for
2 papers
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.DM2010
Optimal Base Encodings for Pseudo-Boolean Constraints
Michael Codish, Yoav Fekete, Carsten Fuhs +1
This paper formalizes the optimal base problem, presents an algorithm to solve it, and describes its application to the encoding of Pseudo-Boolean constraints to SAT. We demonstrat…