Follow
Jürgen Giesl
Jürgen Giesl
Professor of Computer Science, RWTH Aachen University
Verified email at informatik.rwth-aachen.de - Homepage
Title
Cited by
Cited by
Year
Termination of term rewriting using dependency pairs
T Arts, J Giesl
Theoretical computer science 236 (1-2), 133-178, 2000
7362000
AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework
J Giesl, P Schneider-Kamp, R Thiemann
Automated Reasoning: Third International Joint Conference, IJCAR 2006 …, 2006
3252006
Mechanizing and improving dependency pairs
J Giesl, R Thiemann, P Schneider-Kamp, S Falke
Journal of automated reasoning 37 (3), 155-203, 2006
2502006
Automated Termination Proofs with AProVE
J Giesl, R Thiemann, P Schneider-Kamp, S Falke
Rewriting Techniques and Applications: 15th International Conference, RTA …, 2004
2062004
The dependency pair framework: Combining techniques for automated termination proofs
J Giesl, R Thiemann, P Schneider-Kamp
Logic for Programming, Artificial Intelligence, and Reasoning: 11th …, 2005
1912005
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
1732007
Proving and disproving termination of higher-order functions
J Giesl, R Thiemann, P Schneider-Kamp
Frontiers of Combining Systems: 5th International Workshop, FroCoS 2005 …, 2005
1512005
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
1432017
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
1142014
Modular termination proofs for rewriting using dependency pairs
J Giesl, T Arts, E Ohlebusch
Journal of symbolic computation 34 (1), 21-58, 2002
992002
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
982010
Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
J Giesl, S Swiderski, P Schneider-Kamp, R Thiemann
Term Rewriting and Applications: 17th International Conference, RTA 2006 …, 2006
982006
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
922011
Termination of nested and mutually recursive algorithms
J Giesl
Journal of automated reasoning 19, 1-29, 1997
891997
Transformation techniques for context-sensitive rewrite systems
J Giesl, A Middeldorp
Journal of Functional Programming 14 (4), 379-427, 2004
882004
Automatically proving termination where simplification orderings fail
T Arts
Utrecht University: Information and Computing Sciences, 1996
881996
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
862014
Generating polynomial orderings for termination proofs
J Giesl
Rewriting Techniques and Applications: 6th International Conference, RTA-95 …, 1995
841995
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
812016
Verification of Erlang processes by dependency pairs
J Giesl, T Arts
Applicable Algebra in Engineering, Communication and Computing 12, 39-72, 2001
762001
The system can't perform the operation now. Try again later.
Articles 1–20