Edit Profile (opens in new tab) Giesl, Jürgen Co-Author Distance Author ID: giesl.jurgen Published as: Giesl, Jürgen; Giesl, J. External Links: MGP Documents Indexed: 81 Publications since 1995 7 Contributions as Editor Co-Authors: 54 Co-Authors with 79 Joint Publications 559 Co-Co-Authors all top 5 Co-Authors 7 single-authored 32 Schneider-Kamp, Peter 24 Thiemann, René 16 Fuhs, Carsten 15 Frohn, Florian 11 Ströder, Thomas 9 Brockschmidt, Marc 8 Hensel, Jera 7 Emmes, Fabian 6 Middeldorp, Aart 6 Otto, Carsten 5 Codish, Michael 4 Aschermann, Cornelius 4 Kapur, Deepak 4 Swiderski, Stephan 3 Arts, Thomas 3 Brauburger, Jürgen 3 Falke, Stephan 3 Hark, Marcel 3 Nguyen, Manh Thang 3 Plücker, Martin 3 Serebrenik, Alexander 3 Zantema, Hans 2 De Schreye, Danny 2 Hähnle, Reiner 2 Kühnemann, Armin 2 Lucas, Salvador 2 Meyer, Fabian 2 Naaf, Matthias 2 Noschinski, Lars 2 Parting, Michael 2 Swiderski, Stephanie 2 Voigtlander, Janis 2 von Essen, Christian 2 Zankl, Harald 1 Alarcón, Beatriz 1 Annov, Elena 1 Ben-Amram, Amir M. 1 Enger, Tim 1 Giesl, Peter 1 Gonopolskiy, Igor 1 Gutiérrez, Raúl 1 Hoffmann, Jan-Philipp 1 Krauss, Alexander 1 Lagoon, Vitaly 1 Lescanne, Pierre 1 Lommen, Nils 1 Mesnard, Frédéric 1 Navarro-Marset, Rafael 1 Ohlebusch, Enno 1 Ohsaki, Hitoshi 1 Rubio, Albert 1 Sternagel, Christian 1 Subramaniam, Mahadevan 1 Waldmann, Johannes 1 Walther, Christoph all top 5 Serials 11 Journal of Automated Reasoning 4 Applicable Algebra in Engineering, Communication and Computing 3 Theory and Practice of Logic Programming 2 Lecture Notes in Computer Science 1 Information Processing Letters 1 Theoretical Computer Science 1 Science of Computer Programming 1 Information and Computation 1 Journal of Functional Programming 1 The Journal of Logic and Algebraic Programming 1 RACSAM. Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A: Matemáticas 1 ACM Transactions on Computational Logic 1 Electronic Notes in Theoretical Computer Science 1 Journal of Logical and Algebraic Methods in Programming Fields 87 Computer science (68-XX) 7 General and overarching topics; collections (00-XX) 6 Mathematical logic and foundations (03-XX) 2 Operations research, mathematical programming (90-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 71 Publications have been cited 606 times in 253 Documents Cited by ▼ Year ▼ Termination of term rewriting using dependency pairs. Zbl 0938.68051Arts, T.; Giesl, J. 148 2000 Mechanizing and improving dependency pairs. Zbl 1113.68088Giesl, Jürgen; Thiemann, René; Schneider-Kamp, Peter; Falke, Stephan 61 2006 The dependency pair framework: Combining techniques for automated termination proofs. Zbl 1108.68477Giesl, Jürgen; Thiemann, René; Schneider-Kamp, Peter 51 2005 SAT solving for termination analysis with polynomial interpretations. Zbl 1214.68352Fuhs, Carsten; Giesl, Jürgen; Middeldorp, Aart; Schneider-Kamp, Peter; Thiemann, René; Zankl, Harald 33 2007 Proving and disproving termination of higher-order functions. Zbl 1171.68714Giesl, Jürgen; Thiemann, René; Schneider-Kamp, Peter 31 2005 Proving termination of programs automatically with AProVE. Zbl 1409.68256Giesl, Jürgen; Brockschmidt, Marc; Emmes, Fabian; Frohn, Florian; Fuhs, Carsten; Otto, Carsten; Plücker, Martin; Schneider-Kamp, Peter; Ströder, Thomas; Swiderski, Stephanie; Thiemann, René 22 2014 Analyzing program termination and complexity automatically with AProVE. Zbl 1409.68255Giesl, Jürgen; Aschermann, Cornelius; Brockschmidt, Marc; Emmes, Fabian; Frohn, Florian; Fuhs, Carsten; Hensel, Jera; Otto, Carsten; Plücker, Martin; Schneider-Kamp, Peter; Ströder, Thomas; Swiderski, Stephanie; Thiemann, René 22 2017 Automated termination analysis for Haskell: from term rewriting to programming languages. Zbl 1151.68444Giesl, Jürgen; Swiderski, Stephan; Schneider-Kamp, Peter; Thiemann, René 22 2006 Transformation techniques for context-sensitive rewrite systems. Zbl 1104.68056Giesl, Jürgen; Middeldorp, Aart 19 2004 Verification of Erlang processes by dependency pairs. Zbl 0973.68101Giesl, Jürgen; Arts, Thomas 16 2001 Proving innermost normalisation automatically. Zbl 1379.68191Arts, Thomas; Giesl, Jürgen 14 1997 Maximal termination. Zbl 1145.68446Fuhs, Carsten; Giesl, Jürgen; Middeldorp, Aart; Schneider-Kamp, Peter; Thiemann, René; Zankl, Harald 13 2008 Automated termination proofs for logic programs by term rewriting. Zbl 1351.68054Schneider-Kamp, Peter; Giesl, Jürgen; Serebrenik, Alexander; Thiemann, René 13 2009 Analyzing innermost runtime complexity of term rewriting by dependency pairs. Zbl 1314.68174Noschinski, Lars; Emmes, Fabian; Giesl, Jürgen 13 2013 Automated termination analysis of Java bytecode by term rewriting. Zbl 1236.68145Otto, Carsten; Brockschmidt, Marc; Von Essen, Christian; Giesl, Jürgen 13 2010 Dependency pairs for equational rewriting. Zbl 0981.68063Giesl, Jürgen; Kapur, Deepak 12 2001 The size-change principle and dependency pairs for termination of term rewriting. Zbl 1101.68640Thiemann, René; Giesl, Jürgen 11 2005 Proving termination by bounded increase. Zbl 1213.68347Giesl, Jürgen; Thiemann, René; Swiderski, Stephan; Schneider-Kamp, Peter 10 2007 Proving termination of integer term rewriting. Zbl 1242.68131Fuhs, Carsten; Giesl, Jürgen; Plücker, Martin; Schneider-Kamp, Peter; Falke, Stephan 10 2009 Improved modular termination proofs using dependency pairs. Zbl 1126.68582Thiemann, René; Giesl, Jürgen; Schneider-Kamp, Peter 10 2004 Termination of nested and mutually recursive algorithms. Zbl 0882.68019Giesl, Jürgen 10 1997 Proving termination using recursive path orders and SAT solving. Zbl 1148.68393Schneider-Kamp, Peter; Thiemann, René; Annov, Elena; Codish, Michael; Giesl, Jürgen 10 2007 Automated termination analysis for logic programs with cut. Zbl 1209.68098Schneider-Kamp, Peter; Giesl, Jürgen; Ströder, Thomas; Serebrenik, Alexander; Thiemann, René 10 2010 Improving dependency pairs. Zbl 1273.68320Giesl, Jürgen; Thiemann, René; Schneider-Kamp, Peter; Falke, Stephan 10 2003 Lower runtime bounds for integer programs. Zbl 1475.68134Frohn, F.; Naaf, M.; Hensel, J.; Brockschmidt, M.; Giesl, J. 9 2016 Automated termination analysis for logic programs by term rewriting. Zbl 1196.68036Schneider-Kamp, Peter; Giesl, Jürgen; Serebrenik, Alexander; Thiemann, René 9 2007 Improving context-sensitive dependency pairs. Zbl 1182.68092Alarcón, Beatriz; Emmes, Fabian; Fuhs, Carsten; Giesl, Jürgen; Gutiérrez, Raúl; Lucas, Salvador; Schneider-Kamp, Peter; Thiemann, René 8 2008 Polytool: polynomial interpretations as a basis for termination analysis of logic programs. Zbl 1222.68064Nguyen, Manh Thang; De Schreye, Danny; Giesl, Jürgen; Schneider-Kamp, Peter 8 2011 Search techniques for rational polynomial orders. Zbl 1166.68354Fuhs, Carsten; Navarro-Marset, Rafael; Otto, Carsten; Giesl, Jürgen; Lucas, Salvador; Schneider-Kamp, Peter 7 2008 Proving termination by dependency pairs and inductive theorem proving. Zbl 1243.68267Fuhs, Carsten; Giesl, Jürgen; Parting, Michael; Schneider-Kamp, Peter; Swiderski, Stephan 7 2011 Innermost termination of context-sensitive rewriting. Zbl 1015.68106Giesl, Jürgen; Middeldorp, Aart 6 2003 Termination Competition (termCOMP 2015). Zbl 1465.68282Giesl, Jürgen; Mesnard, Frédéric; Rubio, Albert; Thiemann, René; Waldmann, Johannes 6 2015 Termination analysis of logic programs based on dependency graphs. Zbl 1179.68040Nguyen, Manh Thang; Giesl, Jürgen; Schneider-Kamp, Peter; De Schreye, Danny 6 2008 SAT solving for termination proofs with recursive path orders and dependency pairs. Zbl 1276.68140Codish, Michael; Giesl, Jürgen; Schneider-Kamp, Peter; Thiemann, René 6 2012 Termination of polynomial loops. Zbl 1474.68049Frohn, Florian; Hark, Marcel; Giesl, Jürgen 6 2020 Generating polynomial orderings for termination proofs. Zbl 1503.68110Giesl, Jürgen 5 1995 Inferring expected runtimes of probabilistic integer programs using expected sizes. Zbl 1467.68066Meyer, Fabian; Hark, Marcel; Giesl, Jürgen 4 2021 Proving termination and memory safety for programs with pointer arithmetic. Zbl 1423.68110Ströder, Thomas; Giesl, Jürgen; Brockschmidt, Marc; Frohn, Florian; Fuhs, Carsten; Hensel, Jera; Schneider-Kamp, Peter 4 2014 Induction proofs with partial functions. Zbl 0971.03016Giesl, Jürgen 4 2001 Deaccumulation techniques for improving provability. Zbl 1116.68077Giesl, Jürgen; Kühnemann, Armin; Voigtländer, Janis 4 2007 Size-change termination for term rewriting. Zbl 1038.68072Thiemann, René; Giesl, Jürgen 4 2003 Inferring lower bounds for runtime complexity. Zbl 1366.68116Frohn, Florian; Giesl, Jürgen; Hensel, Jera; Aschermann, Cornelius; Ströder, Thomas 4 2015 A linear operational semantics for termination and complexity analysis of ISO prolog. Zbl 1377.68068Ströder, Thomas; Emmes, Fabian; Schneider-Kamp, Peter; Giesl, Jürgen; Fuhs, Carsten 4 2012 Modular termination proofs of recursive Java bytecode programs by term rewriting. Zbl 1236.68036Brockschmidt, Marc; Otto, Carsten; Giesl, Jürgen 4 2011 Computing expected runtimes for constant probability programs. Zbl 07178981Giesl, Jürgen; Giesl, Peter; Hark, Marcel 4 2019 SAT solving for argument filterings. Zbl 1165.68484Codish, Michael; Schneider-Kamp, Peter; Lagoon, Vitaly; Thiemann, René; Giesl, Jürgen 3 2006 Context-moving transformations for function verification. Zbl 0964.68020Giesl, Jürgen 3 2000 Liveness in rewriting. Zbl 1038.68067Giesl, Jürgen; Zantema, Hans 3 2003 Proving termination of programs with bitvector arithmetic by symbolic execution. Zbl 1390.68181Hensel, Jera; Giesl, Jürgen; Frohn, Florian; Ströder, Thomas 3 2016 Termination graphs for Java bytecode. Zbl 1309.68038Brockschmidt, Marc; Otto, Carsten; von Essen, Christian; Giesl, Jürgen 3 2010 Proving non-looping non-termination automatically. Zbl 1358.68157Emmes, Fabian; Enger, Tim; Giesl, Jürgen 3 2012 Deciding innermost loops. Zbl 1145.68457Thiemann, René; Giesl, Jürgen; Schneider-Kamp, Peter 2 2008 Automatically proving termination and memory safety for programs with pointer arithmetic. Zbl 1409.68077Ströder, Thomas; Giesl, Jürgen; Brockschmidt, Marc; Frohn, Florian; Fuhs, Carsten; Hensel, Jera; Schneider-Kamp, Peter; Aschermann, Cornelius 2 2017 Lower bounds for runtime complexity of term rewriting. Zbl 1409.68254Frohn, Florian; Giesl, Jürgen; Hensel, Jera; Aschermann, Cornelius; Ströder, Thomas 2 2017 Equational termination by semantic labelling. Zbl 0973.68094Ohsaki, Hitoshi; Middeldorp, Aart; Giesl, Jürgen 2 2000 Eliminating dummy elimination. Zbl 0963.68181Giesl, Jürgen; Middeldorp, Aart 2 2000 Decidable classes of inductive theorems. Zbl 0988.03017Giesl, Jürgen; Kapur, Deepak 2 2001 Pushing the frontiers of combining rewrite systems farther outwards. Zbl 1004.68081Giesl, Jürgen; Ohlebusch, Enno 2 2000 A dependency pair framework for innermost complexity analysis of term rewrite systems. Zbl 1314.68173Noschinski, Lars; Emmes, Fabian; Giesl, Jürgen 2 2011 Lazy abstraction for size-change termination. Zbl 1306.68022Codish, Michael; Fuhs, Carsten; Giesl, Jürgen; Schneider-Kamp, Peter 2 2010 The dependency triple framework for termination of logic programs. Zbl 1284.68119Schneider-Kamp, Peter; Giesl, Jürgen; Nguyen, Manh Thang 2 2010 Dependency triples for improving termination analysis of logic programs with cut. Zbl 1326.68063Ströder, Thomas; Schneider-Kamp, Peter; Giesl, Jürgen 2 2011 Complexity analysis for Java with AProVE. Zbl 1498.68065Frohn, Florian; Giesl, Jürgen 2 2017 Termination of constructor systems. Zbl 1503.68085Arts, Thomas; Giesl, Jürgen 2 1996 Approximating the domains of functional and imperative programs. Zbl 0948.68040Brauburger, Jürgen; Giesl, Jürgen 1 1999 Preface: Special issue on automatic resource bound analysis. Zbl 1368.00054 1 2017 Termination analysis by dependency pairs and inductive theorem proving. Zbl 1237.68181Swiderski, Stephan; Parting, Michael; Giesl, Jürgen; Fuhs, Carsten; Schneider-Kamp, Peter 1 2009 Termination analysis for functional programs. Zbl 0972.68031Giesl, Jürgen; Walther, Christoph; Brauburger, Jürgen 1 1998 Deaccumulation – improving provability. Zbl 1215.68128Giesl, Jürgen; Kühnemann, Armin; Voigtländer, Janis 1 2003 Automated reasoning. 5th international joint conference, IJCAR 2010, Edinburgh, UK, July 16–19, 2010. Proceedings. Zbl 1195.68005 1 2010 Deciding inductive validity of equations. Zbl 1278.68262Giesl, Jürgen; Kapur, Deepak 1 2003 Inferring expected runtimes of probabilistic integer programs using expected sizes. Zbl 1467.68066Meyer, Fabian; Hark, Marcel; Giesl, Jürgen 4 2021 Termination of polynomial loops. Zbl 1474.68049Frohn, Florian; Hark, Marcel; Giesl, Jürgen 6 2020 Computing expected runtimes for constant probability programs. Zbl 07178981Giesl, Jürgen; Giesl, Peter; Hark, Marcel 4 2019 Analyzing program termination and complexity automatically with AProVE. Zbl 1409.68255Giesl, Jürgen; Aschermann, Cornelius; Brockschmidt, Marc; Emmes, Fabian; Frohn, Florian; Fuhs, Carsten; Hensel, Jera; Otto, Carsten; Plücker, Martin; Schneider-Kamp, Peter; Ströder, Thomas; Swiderski, Stephanie; Thiemann, René 22 2017 Automatically proving termination and memory safety for programs with pointer arithmetic. Zbl 1409.68077Ströder, Thomas; Giesl, Jürgen; Brockschmidt, Marc; Frohn, Florian; Fuhs, Carsten; Hensel, Jera; Schneider-Kamp, Peter; Aschermann, Cornelius 2 2017 Lower bounds for runtime complexity of term rewriting. Zbl 1409.68254Frohn, Florian; Giesl, Jürgen; Hensel, Jera; Aschermann, Cornelius; Ströder, Thomas 2 2017 Complexity analysis for Java with AProVE. Zbl 1498.68065Frohn, Florian; Giesl, Jürgen 2 2017 Preface: Special issue on automatic resource bound analysis. Zbl 1368.00054 1 2017 Lower runtime bounds for integer programs. Zbl 1475.68134Frohn, F.; Naaf, M.; Hensel, J.; Brockschmidt, M.; Giesl, J. 9 2016 Proving termination of programs with bitvector arithmetic by symbolic execution. Zbl 1390.68181Hensel, Jera; Giesl, Jürgen; Frohn, Florian; Ströder, Thomas 3 2016 Termination Competition (termCOMP 2015). Zbl 1465.68282Giesl, Jürgen; Mesnard, Frédéric; Rubio, Albert; Thiemann, René; Waldmann, Johannes 6 2015 Inferring lower bounds for runtime complexity. Zbl 1366.68116Frohn, Florian; Giesl, Jürgen; Hensel, Jera; Aschermann, Cornelius; Ströder, Thomas 4 2015 Proving termination of programs automatically with AProVE. Zbl 1409.68256Giesl, Jürgen; Brockschmidt, Marc; Emmes, Fabian; Frohn, Florian; Fuhs, Carsten; Otto, Carsten; Plücker, Martin; Schneider-Kamp, Peter; Ströder, Thomas; Swiderski, Stephanie; Thiemann, René 22 2014 Proving termination and memory safety for programs with pointer arithmetic. Zbl 1423.68110Ströder, Thomas; Giesl, Jürgen; Brockschmidt, Marc; Frohn, Florian; Fuhs, Carsten; Hensel, Jera; Schneider-Kamp, Peter 4 2014 Analyzing innermost runtime complexity of term rewriting by dependency pairs. Zbl 1314.68174Noschinski, Lars; Emmes, Fabian; Giesl, Jürgen 13 2013 SAT solving for termination proofs with recursive path orders and dependency pairs. Zbl 1276.68140Codish, Michael; Giesl, Jürgen; Schneider-Kamp, Peter; Thiemann, René 6 2012 A linear operational semantics for termination and complexity analysis of ISO prolog. Zbl 1377.68068Ströder, Thomas; Emmes, Fabian; Schneider-Kamp, Peter; Giesl, Jürgen; Fuhs, Carsten 4 2012 Proving non-looping non-termination automatically. Zbl 1358.68157Emmes, Fabian; Enger, Tim; Giesl, Jürgen 3 2012 Polytool: polynomial interpretations as a basis for termination analysis of logic programs. Zbl 1222.68064Nguyen, Manh Thang; De Schreye, Danny; Giesl, Jürgen; Schneider-Kamp, Peter 8 2011 Proving termination by dependency pairs and inductive theorem proving. Zbl 1243.68267Fuhs, Carsten; Giesl, Jürgen; Parting, Michael; Schneider-Kamp, Peter; Swiderski, Stephan 7 2011 Modular termination proofs of recursive Java bytecode programs by term rewriting. Zbl 1236.68036Brockschmidt, Marc; Otto, Carsten; Giesl, Jürgen 4 2011 A dependency pair framework for innermost complexity analysis of term rewrite systems. Zbl 1314.68173Noschinski, Lars; Emmes, Fabian; Giesl, Jürgen 2 2011 Dependency triples for improving termination analysis of logic programs with cut. Zbl 1326.68063Ströder, Thomas; Schneider-Kamp, Peter; Giesl, Jürgen 2 2011 Automated termination analysis of Java bytecode by term rewriting. Zbl 1236.68145Otto, Carsten; Brockschmidt, Marc; Von Essen, Christian; Giesl, Jürgen 13 2010 Automated termination analysis for logic programs with cut. Zbl 1209.68098Schneider-Kamp, Peter; Giesl, Jürgen; Ströder, Thomas; Serebrenik, Alexander; Thiemann, René 10 2010 Termination graphs for Java bytecode. Zbl 1309.68038Brockschmidt, Marc; Otto, Carsten; von Essen, Christian; Giesl, Jürgen 3 2010 Lazy abstraction for size-change termination. Zbl 1306.68022Codish, Michael; Fuhs, Carsten; Giesl, Jürgen; Schneider-Kamp, Peter 2 2010 The dependency triple framework for termination of logic programs. Zbl 1284.68119Schneider-Kamp, Peter; Giesl, Jürgen; Nguyen, Manh Thang 2 2010 Automated reasoning. 5th international joint conference, IJCAR 2010, Edinburgh, UK, July 16–19, 2010. Proceedings. Zbl 1195.68005 1 2010 Automated termination proofs for logic programs by term rewriting. Zbl 1351.68054Schneider-Kamp, Peter; Giesl, Jürgen; Serebrenik, Alexander; Thiemann, René 13 2009 Proving termination of integer term rewriting. Zbl 1242.68131Fuhs, Carsten; Giesl, Jürgen; Plücker, Martin; Schneider-Kamp, Peter; Falke, Stephan 10 2009 Termination analysis by dependency pairs and inductive theorem proving. Zbl 1237.68181Swiderski, Stephan; Parting, Michael; Giesl, Jürgen; Fuhs, Carsten; Schneider-Kamp, Peter 1 2009 Maximal termination. Zbl 1145.68446Fuhs, Carsten; Giesl, Jürgen; Middeldorp, Aart; Schneider-Kamp, Peter; Thiemann, René; Zankl, Harald 13 2008 Improving context-sensitive dependency pairs. Zbl 1182.68092Alarcón, Beatriz; Emmes, Fabian; Fuhs, Carsten; Giesl, Jürgen; Gutiérrez, Raúl; Lucas, Salvador; Schneider-Kamp, Peter; Thiemann, René 8 2008 Search techniques for rational polynomial orders. Zbl 1166.68354Fuhs, Carsten; Navarro-Marset, Rafael; Otto, Carsten; Giesl, Jürgen; Lucas, Salvador; Schneider-Kamp, Peter 7 2008 Termination analysis of logic programs based on dependency graphs. Zbl 1179.68040Nguyen, Manh Thang; Giesl, Jürgen; Schneider-Kamp, Peter; De Schreye, Danny 6 2008 Deciding innermost loops. Zbl 1145.68457Thiemann, René; Giesl, Jürgen; Schneider-Kamp, Peter 2 2008 SAT solving for termination analysis with polynomial interpretations. Zbl 1214.68352Fuhs, Carsten; Giesl, Jürgen; Middeldorp, Aart; Schneider-Kamp, Peter; Thiemann, René; Zankl, Harald 33 2007 Proving termination by bounded increase. Zbl 1213.68347Giesl, Jürgen; Thiemann, René; Swiderski, Stephan; Schneider-Kamp, Peter 10 2007 Proving termination using recursive path orders and SAT solving. Zbl 1148.68393Schneider-Kamp, Peter; Thiemann, René; Annov, Elena; Codish, Michael; Giesl, Jürgen 10 2007 Automated termination analysis for logic programs by term rewriting. Zbl 1196.68036Schneider-Kamp, Peter; Giesl, Jürgen; Serebrenik, Alexander; Thiemann, René 9 2007 Deaccumulation techniques for improving provability. Zbl 1116.68077Giesl, Jürgen; Kühnemann, Armin; Voigtländer, Janis 4 2007 Mechanizing and improving dependency pairs. Zbl 1113.68088Giesl, Jürgen; Thiemann, René; Schneider-Kamp, Peter; Falke, Stephan 61 2006 Automated termination analysis for Haskell: from term rewriting to programming languages. Zbl 1151.68444Giesl, Jürgen; Swiderski, Stephan; Schneider-Kamp, Peter; Thiemann, René 22 2006 SAT solving for argument filterings. Zbl 1165.68484Codish, Michael; Schneider-Kamp, Peter; Lagoon, Vitaly; Thiemann, René; Giesl, Jürgen 3 2006 The dependency pair framework: Combining techniques for automated termination proofs. Zbl 1108.68477Giesl, Jürgen; Thiemann, René; Schneider-Kamp, Peter 51 2005 Proving and disproving termination of higher-order functions. Zbl 1171.68714Giesl, Jürgen; Thiemann, René; Schneider-Kamp, Peter 31 2005 The size-change principle and dependency pairs for termination of term rewriting. Zbl 1101.68640Thiemann, René; Giesl, Jürgen 11 2005 Transformation techniques for context-sensitive rewrite systems. Zbl 1104.68056Giesl, Jürgen; Middeldorp, Aart 19 2004 Improved modular termination proofs using dependency pairs. Zbl 1126.68582Thiemann, René; Giesl, Jürgen; Schneider-Kamp, Peter 10 2004 Improving dependency pairs. Zbl 1273.68320Giesl, Jürgen; Thiemann, René; Schneider-Kamp, Peter; Falke, Stephan 10 2003 Innermost termination of context-sensitive rewriting. Zbl 1015.68106Giesl, Jürgen; Middeldorp, Aart 6 2003 Size-change termination for term rewriting. Zbl 1038.68072Thiemann, René; Giesl, Jürgen 4 2003 Liveness in rewriting. Zbl 1038.68067Giesl, Jürgen; Zantema, Hans 3 2003 Deaccumulation – improving provability. Zbl 1215.68128Giesl, Jürgen; Kühnemann, Armin; Voigtländer, Janis 1 2003 Deciding inductive validity of equations. Zbl 1278.68262Giesl, Jürgen; Kapur, Deepak 1 2003 Verification of Erlang processes by dependency pairs. Zbl 0973.68101Giesl, Jürgen; Arts, Thomas 16 2001 Dependency pairs for equational rewriting. Zbl 0981.68063Giesl, Jürgen; Kapur, Deepak 12 2001 Induction proofs with partial functions. Zbl 0971.03016Giesl, Jürgen 4 2001 Decidable classes of inductive theorems. Zbl 0988.03017Giesl, Jürgen; Kapur, Deepak 2 2001 Termination of term rewriting using dependency pairs. Zbl 0938.68051Arts, T.; Giesl, J. 148 2000 Context-moving transformations for function verification. Zbl 0964.68020Giesl, Jürgen 3 2000 Equational termination by semantic labelling. Zbl 0973.68094Ohsaki, Hitoshi; Middeldorp, Aart; Giesl, Jürgen 2 2000 Eliminating dummy elimination. Zbl 0963.68181Giesl, Jürgen; Middeldorp, Aart 2 2000 Pushing the frontiers of combining rewrite systems farther outwards. Zbl 1004.68081Giesl, Jürgen; Ohlebusch, Enno 2 2000 Approximating the domains of functional and imperative programs. Zbl 0948.68040Brauburger, Jürgen; Giesl, Jürgen 1 1999 Termination analysis for functional programs. Zbl 0972.68031Giesl, Jürgen; Walther, Christoph; Brauburger, Jürgen 1 1998 Proving innermost normalisation automatically. Zbl 1379.68191Arts, Thomas; Giesl, Jürgen 14 1997 Termination of nested and mutually recursive algorithms. Zbl 0882.68019Giesl, Jürgen 10 1997 Termination of constructor systems. Zbl 1503.68085Arts, Thomas; Giesl, Jürgen 2 1996 Generating polynomial orderings for termination proofs. Zbl 1503.68110Giesl, Jürgen 5 1995 all cited Publications top 5 cited Publications all top 5 Cited by 285 Authors 31 Giesl, Jürgen 31 Lucas, Salvador 19 Middeldorp, Aart 17 Thiemann, René 14 Vidal, Germán 13 Gutiérrez, Raúl 13 Schneider-Kamp, Peter 12 Moser, Georg 11 Fuhs, Carsten 11 Nishida, Naoki 10 Meseguer Guaita, José 9 Frohn, Florian 9 Zankl, Harald 9 Zantema, Hans 8 Winkler, Sarah 7 Sternagel, Christian 7 Yamada, Akihisa 6 Endrullis, Jörg 6 Hensel, Jera 6 Hirokawa, Nao 6 Ströder, Thomas 5 Alarcón, Beatriz 5 Brockschmidt, Marc 5 Durán, Francisco 5 Falke, Stephan 5 Iborra, José 5 Kirchner, Hélène 5 Payet, Étienne 5 Rubio, Albert 5 Urbain, Xavier 5 Zuleger, Florian 4 Ábrahám, Erika 4 Alpuente, María 4 Avanzini, Martin 4 Ben-Amram, Amir M. 4 Blanqui, Frédéric 4 Cimatti, Alessandro 4 Codish, Michael 4 De Schreye, Danny 4 Escobar, Santiago 4 Gnaedig, Isabelle 4 Griggio, Alberto 4 Kremer, Gereon 4 Mesnard, Fred 4 Sakai, Masahiko 4 Waldmann, Johannes 3 Aoto, Takahito 3 Aschermann, Cornelius 3 Borralleras, Cristina 3 Drabent, Włodzimierz 3 Emmes, Fabian 3 Gramlich, Bernhard 3 Greco, Sergio 3 Kapur, Deepak 3 Katoen, Joost-Pieter 3 Kop, Cynthia 3 Koprowski, Adam 3 Korp, Martin 3 Krauss, Alexander 3 Leutgeb, Lorenz 3 Magnago, Enrico 3 Navarro-Marset, Rafael 3 Otto, Carsten 3 Rodríguez-Carbonell, Enric 3 Sabel, David 3 Trubitsyna, Irina 2 Albert, Elvira 2 Batz, Kevin 2 Calautti, Marco 2 Corzilius, Florian 2 Falaschi, Moreno 2 Fernández, Mirtha-Lina 2 Fissore, Olivier 2 Geuvers, Jan Herman 2 Hamilton, Geoff W. 2 Hark, Marcel 2 Hendriks, Dimitri 2 Hoffmann, Jan-Philipp 2 Hu, Zhenjiang 2 Kaminski, Benjamin Lucien 2 Kovács, Laura Ildikó 2 Marché, Claude 2 Matsuda, Kazutaka 2 Merayo, Alicia 2 Meyer, Fabian 2 Molinaro, Cristian 2 Monin, François 2 Moreau, Pierre-Etienne 2 Noschinski, Lars 2 Oliveras, Albert 2 Parting, Michael 2 Plücker, Martin 2 Sakabe, Toshiki 2 Schernhammer, Felix 2 Schnabl, Andreas 2 Swiderski, Stephan 2 Toyama, Yoshihito 2 Voets, Dean 2 Voigtlander, Janis 1 Aaronson, Scott ...and 185 more Authors all top 5 Cited in 22 Serials 24 Journal of Automated Reasoning 14 Theoretical Computer Science 13 Information and Computation 10 Theory and Practice of Logic Programming 8 Journal of Logical and Algebraic Methods in Programming 6 Applicable Algebra in Engineering, Communication and Computing 5 Information Processing Letters 5 Logical Methods in Computer Science 4 Journal of Symbolic Computation 4 Journal of Functional Programming 4 The Journal of Logic and Algebraic Programming 3 Formal Aspects of Computing 3 MSCS. Mathematical Structures in Computer Science 3 Higher-Order and Symbolic Computation 3 ACM Transactions on Computational Logic 2 Annals of Mathematics and Artificial Intelligence 2 RAIRO. Theoretical Informatics and Applications 1 Acta Informatica 1 Journal of Computer and System Sciences 1 Formal Methods in System Design 1 Fundamenta Informaticae 1 Acta Universitatis Sapientiae. Informatica all top 5 Cited in 11 Fields 250 Computer science (68-XX) 32 Mathematical logic and foundations (03-XX) 3 Order, lattices, ordered algebraic structures (06-XX) 3 Operations research, mathematical programming (90-XX) 2 Combinatorics (05-XX) 1 Number theory (11-XX) 1 Field theory and polynomials (12-XX) 1 Commutative algebra (13-XX) 1 Algebraic geometry (14-XX) 1 Category theory; homological algebra (18-XX) 1 Information and communication theory, circuits (94-XX) Citations by Year