Termination of term rewriting using dependency pairs T Arts, J Giesl Theoretical computer science 236 (1-2), 133-178, 2000 | 769 | 2000 |
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 | 322 | 2006 |
Mechanizing and improving dependency pairs J Giesl, R Thiemann, P Schneider-Kamp, S Falke Journal of Automated Reasoning 37 (3), 155-203, 2006 | 262 | 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 | 205 | 2005 |
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 | 175 | 2007 |
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 | 170 | 2017 |
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 | 155 | 2005 |
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 | 127 | 2014 |
Automated termination analysis of Java Bytecode by term rewriting C Otto, M Brockschmidt, C von Essen, J Giesl Proceedings of the 21st International Conference on Rewriting Techniques and …, 2010 | 104 | 2010 |
Modular termination proofs for rewriting using dependency pairs J Giesl, T Arts, E Ohlebusch Journal of symbolic computation 34 (1), 21-58, 2002 | 102 | 2002 |
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 | 100 | 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 |
Alternating runtime and size complexity analysis of integer programs M Brockschmidt, F Emmes, S Falke, C Fuhs, J Giesl Tools and Algorithms for the Construction and Analysis of Systems: 20th …, 2014 | 94 | 2014 |
Termination of nested and mutually recursive algorithms J Giesl Journal of automated reasoning 19, 1-29, 1997 | 89 | 1997 |
Analyzing runtime and size complexity of integer programs M Brockschmidt, F Emmes, S Falke, C Fuhs, J Giesl ACM Transactions on Programming Languages and Systems (TOPLAS) 38 (4), 1-50, 2016 | 87 | 2016 |
Transformation techniques for context-sensitive rewrite systems J Giesl, A Middeldorp Journal of Functional Programming 14 (4), 379-427, 2004 | 87 | 2004 |
Automatically proving termination where simplification orderings fail T Arts, J Giesl Colloquium on Trees in Algebra and Programming, 261-272, 1997 | 85 | 1997 |
Generating polynomial orderings for termination proofs J Giesl International Conference on Rewriting Techniques and Applications, 426-431, 1995 | 85 | 1995 |
Verification of Erlang processes by dependency pairs J Giesl, T Arts Applicable Algebra in Engineering, Communication and Computing 12, 39-72, 2001 | 84 | 2001 |