Jürgen Giesl
Jürgen Giesl
Professor of Computer Science, RWTH Aachen University
Verified email at informatik.rwth-aachen.de - Homepage
TitleCited byYear
Termination of term rewriting using dependency pairs
T Arts, J Giesl
Theoretical computer science 236 (1-2), 133-178, 2000
6812000
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
3152006
Mechanizing and improving dependency pairs
J Giesl, R Thiemann, P Schneider-Kamp, S Falke
Journal of Automated Reasoning 37 (3), 155-203, 2006
2282006
Automated Termination Proofs with AProVE
J Giesl, R Thiemann, P Schneider-Kamp, S Falke
International Conference on Rewriting Techniques and Applications, 210-220, 2004
1862004
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
1732005
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
1502007
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
1402005
Modular termination proofs for rewriting using dependency pairs
J Giesl, T Arts, E Ohlebusch
Journal of Symbolic Computation 34 (1), 21-58, 2002
932002
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
912010
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
902006
Automatically proving termination where simplification orderings fail
T Arts, J Giesl
Colloquium on Trees in Algebra and Programming, 261-272, 1997
901997
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
842014
Transformation techniques for context-sensitive rewrite systems
J Giesl, A Middeldorp
Journal of Functional Programming 14 (4), 379-427, 2004
842004
Termination of nested and mutually recursive algorithms
J Giesl
Journal of automated reasoning 19 (1), 1-29, 1997
841997
Generating polynomial orderings for termination proofs
J Giesl
International Conference on Rewriting Techniques and Applications, 426-431, 1995
831995
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), 7, 2011
792011
Verification of Erlang processes by dependency pairs
J Giesl, T Arts
Applicable Algebra in Engineering, Communication and Computing 12 (1-2), 39-72, 2001
742001
Proving innermost normalisation automatically
T Arts, J Giesl
International Conference on Rewriting Techniques and Applications, 157-171, 1997
741997
Termination analysis for functional programs using term orderings
J Giesl
International Static Analysis Symposium, 154-171, 1995
671995
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
622017
The system can't perform the operation now. Try again later.
Articles 1–20