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


DROPS-Home | Fulltext Search | Imprint Published by LZI