Proving termination using recursive path orders and SAT solving

Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

21 Scopus citations

Fingerprint

Dive into the research topics of 'Proving termination using recursive path orders and SAT solving'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science