| SAT solving for termination analysis with polynomial interpretations C Fuhs, J Giesl, A Middeldorp, P Schneider-Kamp, R Thiemann, H Zankl International Conference on Theory and Applications of Satisfiability …, 2007 | 176 | 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 (1), 3-31, 2017 | 173 | 2017 |
| Proving termination of programs automatically with AProVE J Giesl, M Brockschmidt, F Emmes, F Frohn, C Fuhs, C Otto, M Plücker, ... International Joint Conference on Automated Reasoning, 184-191, 2014 | 127 | 2014 |
| Better termination proving through cooperation M Brockschmidt, B Cook, C Fuhs International Conference on Computer Aided Verification, 413-429, 2013 | 105 | 2013 |
| Alternating runtime and size complexity analysis of integer programs M Brockschmidt, F Emmes, S Falke, C Fuhs, J Giesl International Conference on Tools and Algorithms for the Construction and …, 2014 | 94 | 2014 |
| Alternating runtime and size complexity analysis of integer programs M Brockschmidt, F Emmes, S Falke, C Fuhs, J Giesl International Conference on Tools and Algorithms for the Construction and …, 2014 | 94 | 2014 |
| A decision procedure for satisfiability in separation logic with inductive predicates J Brotherston, C Fuhs, JAN Pérez, N Gorogiannis Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014 | 91 | 2014 |
| 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), 13, 2016 | 90 | 2016 |
| Proving nontermination via safety HY Chen, B Cook, C Fuhs, K Nimkar, P O’Hearn International Conference on Tools and Algorithms for the Construction and …, 2014 | 83 | 2014 |
| Proving termination of integer term rewriting C Fuhs, J Giesl, M Plücker, P Schneider-Kamp, S Falke International Conference on Rewriting Techniques and Applications, 32-47, 2009 | 66 | 2009 |
| Maximal termination C Fuhs, J Giesl, A Middeldorp, P Schneider-Kamp, R Thiemann, H Zankl International Conference on Rewriting Techniques and Applications, 110-125, 2008 | 52 | 2008 |
| Synthesizing shortest linear straight-line programs over GF (2) using SAT C Fuhs, P Schneider-Kamp International Conference on Theory and Applications of Satisfiability …, 2010 | 46 | 2010 |
| Synthesizing shortest linear straight-line programs over GF (2) using SAT C Fuhs, P Schneider-Kamp International Conference on Theory and Applications of Satisfiability …, 2010 | 46 | 2010 |
| Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs J Giesl, T Ströder, P Schneider-Kamp, F Emmes, C Fuhs Proceedings of the 14th symposium on Principles and practice of declarative …, 2012 | 41 | 2012 |
| Dagstuhl Reports, Vol. 7, Issue 9 ISSN 2192-5283 A Dawar, E Grädel, PG Kolaitis, T Schwentick, JC Blanchette, C Fuhs, ... | 40* | 2018 |
| Verifying procedural programs via constrained rewriting induction C Fuhs, C Kop, N Nishida ACM Transactions on Computational Logic (TOCL) 18 (2), 14, 2017 | 40 | 2017 |
| Automatically proving termination and memory safety for programs with pointer arithmetic T Ströder, J Giesl, M Brockschmidt, F Frohn, C Fuhs, J Hensel, ... Journal of Automated Reasoning 58 (1), 33-65, 2017 | 35 | 2017 |
| Disproving termination with overapproximation B Cook, C Fuhs, K Nimkar, P O'Hearn Proceedings of the 14th Conference on Formal Methods in Computer-Aided …, 2014 | 35 | 2014 |
| Improving context-sensitive dependency pairs B Alarcón, F Emmes, C Fuhs, J Giesl, R Gutiérrez, S Lucas, ... International Conference on Logic for Programming Artificial Intelligence …, 2008 | 34 | 2008 |
| Polynomial Interpretations for Higher-Order Rewriting C Fuhs, C Kop Arxiv preprint arXiv:1203.5754, 2012 | 29 | 2012 |
Jürgen GieslProfessor of Computer Science, RWTH Aachen University在 informatik.rwth-aachen.de 的电子邮件经过验证
