Proving Termination Using Recursive Path Orders and SAT Solving - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl. Proving Termination Using Recursive Path Orders and SAT Solving. In Boris Konev, Frank Wolter, editors, Frontiers of Combining Systems, 6th International Symposium, FroCoS 2007, Liverpool, UK, September 10-12, 2007, Proceedings. Volume 4720 of Lecture Notes in Computer Science, pages 267-282, Springer, 2007. [doi]

This author has not been identified. Look up 'Peter Schneider-Kamp' in GoogleThis author has not been identified. Look up 'René Thiemann' in GoogleThis author has not been identified. Look up 'Elena Annov' in GoogleThis author has not been identified. Look up 'Michael Codish' in GoogleIdentified as Jürgen Giesl

runs on WebDSL