| Certification of Termination Proofs Using CeTA R Thiemann, C Sternagel Theorem Proving in Higher Order Logics: 22nd International Conference …, 2009 | 206 | 2009 |
| Tyrolean termination tool 2 M Korp, C Sternagel, H Zankl, A Middeldorp Rewriting Techniques and Applications: 20th International Conference, RTA …, 2009 | 164 | 2009 |
| The termination and complexity competition J Giesl, A Rubio, C Sternagel, J Waldmann, A Yamada Tools and Algorithms for the Construction and Analysis of Systems: 25 Years …, 2019 | 43 | 2019 |
| Root-labeling C Sternagel, A Middeldorp Rewriting Techniques and Applications: 19th International Conference, RTA …, 2008 | 39 | 2008 |
| The certification problem format C Sternagel, R Thiemann 11th Workshop on User Interfaces for Theorem Provers, 2014 | 34 | 2014 |
| Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion C Sternagel, R Thiemann 24th International Conference on Rewriting Techniques and Applications (RTA), 2013 | 34 | 2013 |
| Finding and certifying loops H Zankl, C Sternagel, D Hofbauer, A Middeldorp SOFSEM 2010: Theory and Practice of Computer Science: 36th Conference on …, 2010 | 27 | 2010 |
| Signature extensions preserve termination C Sternagel, R Thiemann EACSL Annual Conference on Computer Science Logic, 514-528, 2010 | 25* | 2010 |
| 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 | 21 | 2011 |
| Generalized and formalized uncurrying C Sternagel, R Thiemann Frontiers of Combining Systems: 8th International Symposium, FroCoS 2011 …, 2011 | 19 | 2011 |
| 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 | 18 | 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 | 17 | 2016 |
| Reachability analysis for termination and confluence of rewriting C Sternagel, A Yamada Tools and Algorithms for the Construction and Analysis of Systems: 25th …, 2019 | 16 | 2019 |
| Proof pearl—A mechanized proof of GHC’s mergesort C Sternagel Journal of Automated Reasoning 51 (4), 357-370, 2013 | 16 | 2013 |
| Infinite runs in abstract completion N Hirokawa, A Middeldorp, C Sternagel, S Winkler 2nd International Conference on Formal Structures for Computation and …, 2017 | 15 | 2017 |
| AC Dependency Pairs Revisited A Yamada, C Sternagel, R Thiemann, K Kusakari 25th EACSL Annual Conference on Computer Science Logic, 2016 | 15 | 2016 |
| Certification of complexity proofs using CeTA M Avanzini, C Sternagel, R Thiemann 26th International Conference on Rewriting Techniques and Applications, 2015 | 14 | 2015 |
| CeTA - A Tool for Certified Termination Analysis C Sternagel, R Thiemann, S Winkler, H Zankl 10th International Workshop on Termination (WST), 2009 | 12 | 2009 |
| Certifying confluence of quasi-decreasing strongly deterministic conditional term rewrite systems C Sternagel, T Sternagel Automated Deduction–CADE 26: 26th International Conference on Automated …, 2017 | 11 | 2017 |
| Loops under strategies R Thiemann, C Sternagel Rewriting Techniques and Applications: 20th International Conference, RTA …, 2009 | 11 | 2009 |
Aart MiddeldorpUniversity of InnsbruckVerified email at uibk.ac.at
