SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs

Michael Codish, Jürgen Giesl, Peter Schneider-Kamp, and René Thiemann
Journal of Automated Reasoning 49(1), pp. 53 – 93, 2012.

abstract   BibTeX   PDF   doi:10.1007/s10817-010-9211-0  
© 2010, Springer Science + Business Media B.V.