| Certification of termination proofs using CeTA R Thiemann, C Sternagel International Conference on Theorem Proving in Higher Order Logics, 452-468, 2009 | 227 | 2009 |
| Tyrolean termination tool 2 M Korp, C Sternagel, H Zankl, A Middeldorp Rewriting Techniques and Applications: 20th International Conference, RTA …, 2009 | 185 | 2009 |
| The termination and complexity competition J Giesl, A Rubio, C Sternagel, J Waldmann, A Yamada International Conference on Tools and Algorithms for the Construction and …, 2019 | 74 | 2019 |
| The certification problem format C Sternagel, R Thiemann 11th Workshop on User Interfaces for Theorem Provers, 2014 | 40 | 2014 |
| Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion C Sternagel, R Thiemann 24th International Conference on Rewriting Techniques and Applications (RTA), 2013 | 39 | 2013 |
| Root-labeling C Sternagel, A Middeldorp Rewriting Techniques and Applications: 19th International Conference, RTA …, 2008 | 38 | 2008 |
| Termination of Isabelle functions via termination of rewriting A Krauss, C Sternagel, R Thiemann, C Fuhs, J Giesl Interactive Theorem Proving: Second International Conference, ITP 2011, Berg …, 2011 | 28 | 2011 |
| Finding and certifying loops H Zankl, C Sternagel, D Hofbauer, A Middeldorp International Conference on Current Trends in Theory and Practice of …, 2010 | 28 | 2010 |
| Signature extensions preserve termination C Sternagel, R Thiemann EACSL Annual Conference on Computer Science Logic, 514-528, 2010 | 26* | 2010 |
| Generalized and formalized uncurrying C Sternagel, R Thiemann International Symposium on Frontiers of Combining Systems, 243-258, 2011 | 22 | 2011 |
| Reachability analysis for termination and confluence of rewriting C Sternagel, A Yamada Tools and Algorithms for the Construction and Analysis of Systems: 25th …, 2019 | 20 | 2019 |
| Foundational (co) datatypes and (co) recursion for higher-order logic J Biendarra, JC Blanchette, A Bouzy, M Desharnais, M Fleury, J Hölzl, ... Frontiers of Combining Systems: 11th International Symposium, FroCoS 2017 …, 2017 | 20 | 2017 |
| Certifying Confluence of Almost Orthogonal CTRSs via Exact Tree Automata Completion C Sternagel, T Sternagel 1st International Conference on Formal Structures for Computation and Deduction, 2016 | 20 | 2016 |
| Proof pearl—A mechanized proof of GHC’s mergesort C Sternagel Journal of Automated Reasoning 51 (4), 357-370, 2013 | 19 | 2013 |
| AC Dependency Pairs Revisited A Yamada, C Sternagel, R Thiemann, K Kusakari 25th EACSL Annual Conference on Computer Science Logic, 2016 | 17 | 2016 |
| Infinite runs in abstract completion N Hirokawa, A Middeldorp, C Sternagel, S Winkler 2nd International Conference on Formal Structures for Computation and …, 2017 | 14 | 2017 |
| Certification of complexity proofs using CeTA M Avanzini, C Sternagel, R Thiemann 26th International Conference on Rewriting Techniques and Applications, 2015 | 14 | 2015 |
| Loops under strategies R Thiemann, C Sternagel International Conference on Rewriting Techniques and Applications, 17-31, 2009 | 14 | 2009 |
| Functional Algorithms, Verified T Nipkow, J Blanchette, M Eberl, A Gómez-Londoño, P Lammich, ... | 13 | 2021 |
| Formalizing Monotone Algebras for Certification of Termination and Complexity Proofs C Sternagel, R Thiemann 1st Joint International Conference on Rewriting and Typed Lambda Calculi …, 2014 | 12 | 2014 |
Aart MiddeldorpUniversity of InnsbruckVerified email at uibk.ac.at
