| AProVE 1.2: Automatic termination proofs in the dependency pair framework J Giesl, P Schneider-Kamp, R Thiemann International Joint Conference on Automated Reasoning, 281-286, 2006 | 324 | 2006 |
| Mechanizing and improving dependency pairs J Giesl, R Thiemann, P Schneider-Kamp, S Falke Journal of Automated Reasoning 37 (3), 155-203, 2006 | 266 | 2006 |
| Automated termination proofs with AProVE J Giesl, R Thiemann, P Schneider-Kamp, S Falke International Conference on Rewriting Techniques and Applications, 210-220, 2004 | 217 | 2004 |
| The dependency pair framework: Combining techniques for automated termination proofs J Giesl, R Thiemann, P Schneider-Kamp International Conference on Logic for Programming Artificial Intelligence …, 2005 | 207 | 2005 |
| Analyzing Program Termination and Complexity Automatically with AProVE J Giesl, C Aschermann, M Brockschmidt, F Emmes, F Frohn, C Fuhs, ... Journal of Automated Reasoning 58, 3-31, 2017 | 177 | 2017 |
| SAT solving for termination analysis with polynomial interpretations C Fuhs, J Giesl, A Middeldorp, P Schneider-Kamp, R Thiemann, H Zankl Theory and Applications of Satisfiability Testing–SAT 2007: 10th …, 2007 | 177 | 2007 |
| Proving and disproving termination of higher-order functions J Giesl, R Thiemann, P Schneider-Kamp International Workshop on Frontiers of Combining Systems, 216-231, 2005 | 156 | 2005 |
| Efficient certified RAT verification L Cruz-Filipe, MJH Heule, WA Hunt, M Kaufmann, P Schneider-Kamp Automated Deduction–CADE 26: 26th International Conference on Automated …, 2017 | 132 | 2017 |
| Proving Termination of Programs Automatically with AProVE J Giesl, M Brockschmidt, F Emmes, F Frohn, C Fuhs, C Otto, M Plücker, ... Automated Reasoning: 7th International Joint Conference, IJCAR 2014, Held as …, 2014 | 128 | 2014 |
| Automated termination proofs for Haskell by term rewriting J Giesl, M Raffelsieper, P Schneider-Kamp, S Swiderski, R Thiemann ACM Transactions on Programming Languages and Systems (TOPLAS) 33 (2), 1-39, 2011 | 105 | 2011 |
| Automated termination analysis for Haskell: From term rewriting to programming languages J Giesl, S Swiderski, P Schneider-Kamp, R Thiemann International Conference on Rewriting Techniques and Applications, 297-312, 2006 | 100 | 2006 |
| Efficient certified resolution proof checking L Cruz-Filipe, J Marques-Silva, P Schneider-Kamp Tools and Algorithms for the Construction and Analysis of Systems: 23rd …, 2017 | 67 | 2017 |
| Proving termination of integer term rewriting C Fuhs, J Giesl, M Plücker, P Schneider-Kamp, S Falke Rewriting Techniques and Applications: 20th International Conference, RTA …, 2009 | 67 | 2009 |
| Automated termination proofs for logic programs by term rewriting P Schneider-Kamp, J Giesl, A Serebrenik, R Thiemann ACM Transactions on Computational Logic (TOCL) 11 (1), 1-52, 2009 | 64 | 2009 |
| Termination analysis of logic programs based on dependency graphs MT Nguyen, J Giesl, P Schneider-Kamp, D De Schreye Logic-Based Program Synthesis and Transformation: 17th International …, 2008 | 57 | 2008 |
| Improving dependency pairs J Giesl, R Thiemann, P Schneider-Kamp, S Falke Logic for Programming, Artificial Intelligence, and Reasoning: 10th …, 2003 | 57 | 2003 |
| Twenty-five comparators is optimal when sorting nine inputs (and twenty-nine for ten) M Codish, L Cruz-Filipe, M Frank, P Schneider-Kamp 2014 IEEE 26th International Conference on Tools with Artificial …, 2014 | 53 | 2014 |
| Maximal termination C Fuhs, J Giesl, A Middeldorp, P Schneider-Kamp, R Thiemann, H Zankl Rewriting Techniques and Applications: 19th International Conference, RTA …, 2008 | 53 | 2008 |
| Improved modular termination proofs using dependency pairs R Thiemann, J Giesl, P Schneider-Kamp Automated Reasoning: Second International Joint Conference, IJCAR 2004, Cork …, 2004 | 51 | 2004 |
| Proving termination using recursive path orders and SAT solving P Schneider-Kamp, R Thiemann, E Annov, M Codish, J Giesl International Symposium on Frontiers of Combining Systems, 267-282, 2007 | 49 | 2007 |
