| No. |
Title |
Author |
Year |
| 1 |
Certifying the Weighted Path Order (Invited Talk) |
Thiemann, René et al. |
2020 |
| 2 |
AC Dependency Pairs Revisited |
Yamada, Akihisa et al. |
2016 |
| 3 |
Certification of Complexity Proofs using CeTA |
Avanzini, Martin et al. |
2015 |
| 4 |
Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion |
Sternagel, Christian et al. |
2013 |
| 5 |
On the Formalization of Termination Techniques based on Multiset Orderings |
Thiemann, René et al. |
2012 |
| 6 |
Modular and Certified Semantic Labeling and Unlabeling |
Sternagel, Christian et al. |
2011 |
| 7 |
Certified Subterm Criterion and Certified Usable Rules |
Sternagel, Christian et al. |
2010 |
| 8 |
Decision Procedures for Loop Detection |
Thiemann, René et al. |
2007 |
| 9 |
Implementing RPO and POLO using SAT |
Schneider-Kamp, Peter et al. |
2007 |
| 10 |
Termination of Programs using Term Rewriting and SAT Solving |
Giesl, Jürgen et al. |
2007 |
| 11 |
Proving and Disproving Termination in the Dependency Pair Framework |
Giesl, Jürgen et al. |
2006 |
