Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jürgen Giesl
2010 – today
- 2013
[j29]Lars Noschinski, Fabian Emmes, Jürgen Giesl: Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs. J. Autom. Reasoning 51(1): 27-56 (2013)- [c65]Jürgen Giesl: Automated Termination Analysis: From Term Rewriting to Programming Languages. Software Engineering (Workshops) 2013: 21-22
- 2012
- [j28]Michael Codish, Jürgen Giesl, Peter Schneider-Kamp, René Thiemann: SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs. J. Autom. Reasoning 49(1): 53-93 (2012)
- [c64]Fabian Emmes, Tim Enger, Jürgen Giesl: Proving Non-looping Non-termination Automatically. IJCAR 2012: 225-240
- [c63]Marc Brockschmidt, Richard Musiol, Carsten Otto, Jürgen Giesl: Automated Termination Proofs for Java Programs with Cyclic Data. CAV 2012: 105-122
- [c62]Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp, Fabian Emmes, Carsten Fuhs: Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic Programs. LOPSTR 2012: 1
- [c61]Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp, Fabian Emmes, Carsten Fuhs: Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs. PPDP 2012: 1-12
- 2011
- [j27]Carsten Fuhs, Jürgen Giesl, Michael Parting, Peter Schneider-Kamp, Stephan Swiderski: Proving Termination by Dependency Pairs and Inductive Theorem Proving. J. Autom. Reasoning 47(2): 133-160 (2011)
- [j26]Jürgen Giesl, Reiner Hähnle: Preface: Special Issue of Selected Extended Papers of IJCAR 2010. J. Autom. Reasoning 47(4): 337-339 (2011)
- [j25]Jürgen Giesl, Matthias Raffelsieper, Peter Schneider-Kamp, Stephan Swiderski, René Thiemann: Automated termination proofs for haskell by term rewriting. ACM Trans. Program. Lang. Syst. 33(2): 7 (2011)
- [j24]Manh Thang Nguyen, Danny De Schreye, Jürgen Giesl, Peter Schneider-Kamp: Polytool: Polynomial interpretations as a basis for termination analysis of logic programs. TPLP 11(1): 33-63 (2011)
- [j23]Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl: SAT-based termination analysis using monotonicity constraints over the integers. TPLP 11(4-5): 503-520 (2011)
- [c60]Lars Noschinski, Fabian Emmes, Jürgen Giesl: A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems. CADE 2011: 422-438
- [c59]Marc Brockschmidt, Thomas Ströder, Carsten Otto, Jürgen Giesl: Automated Detection of Non-termination and NullPointerExceptions for Java Bytecode. FoVeOOS 2011: 123-141
- [c58]Alexander Krauss, Christian Sternagel, René Thiemann, Carsten Fuhs, Jürgen Giesl: Termination of Isabelle Functions via Termination of Rewriting. ITP 2011: 152-167
- [c57]Thomas Ströder, Fabian Emmes, Peter Schneider-Kamp, Jürgen Giesl, Carsten Fuhs: A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog. LOPSTR 2011: 237-252
- [c56]Marc Brockschmidt, Carsten Otto, Jürgen Giesl: Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting. RTA 2011: 155-170
- [i5]Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl: SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers. CoRR abs/1107.5980 (2011)
- 2010
- [j22]
- [j21]
- [j20]Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann: Automated termination analysis for logic programs with cut. TPLP 10(4-6): 365-381 (2010)
- [c55]Marc Brockschmidt, Carsten Otto, Christian von Essen, Jürgen Giesl: Termination Graphs for Java Bytecode. Verification, Induction, Termination Analysis 2010: 17-37
- [c54]Thomas Ströder, Peter Schneider-Kamp, Jürgen Giesl: Dependency Triples for Improving Termination Analysis of Logic Programs with Cut. LOPSTR 2010: 184-199
- [c53]Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp: Lazy Abstraction for Size-Change Termination. LPAR (Yogyakarta) 2010: 217-232
- [c52]Carsten Otto, Marc Brockschmidt, Christian von Essen, Jürgen Giesl: Automated Termination Analysis of Java Bytecode by Term Rewriting. RTA 2010: 259-276
- [c51]René Thiemann, Christian Sternagel, Jürgen Giesl, Peter Schneider-Kamp: Loops under Strategies ... Continued. IWS 2010: 51-65
- [e3]Jürgen Giesl, Reiner Hähnle (Eds.): Automated Reasoning, 5th International Joint Conference, IJCAR 2010, Edinburgh, UK, July 16-19, 2010. Proceedings. Lecture Notes in Computer Science 6173, Springer 2010, ISBN 978-3-642-14202-4
- [i4]Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann: Automated Termination Analysis for Logic Programs with Cut. CoRR abs/1007.4908 (2010)
2000 – 2009
- 2009
- [j19]Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann: Automated termination proofs for logic programs by term rewriting. ACM Trans. Comput. Log. 11(1) (2009)
- [c50]Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp: Termination Analysis by Dependency Pairs and Inductive Theorem Proving. CADE 2009: 322-338
- [c49]Peter Schneider-Kamp, Jürgen Giesl, Manh Thang Nguyen: The Dependency Triple Framework for Termination of Logic Programs. LOPSTR 2009: 37-51
- [c48]Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke: Proving Termination of Integer Term Rewriting. RTA 2009: 32-47
- [i3]Manh Thang Nguyen, Danny De Schreye, Jürgen Giesl, Peter Schneider-Kamp: Polytool: polynomial interpretations as a basis for termination analysis of Logic programs. CoRR abs/0912.4360 (2009)
- 2008
- [j18]René Thiemann, Hans Zantema, Jürgen Giesl, Peter Schneider-Kamp: Adding constants to string rewriting. Appl. Algebra Eng. Commun. Comput. 19(1): 27-38 (2008)
- [j17]
- [c47]Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto, Jürgen Giesl, Salvador Lucas, Peter Schneider-Kamp: Search Techniques for Rational Polynomial Orders. AISC/MKM/Calculemus 2008: 109-124
- [c46]Beatriz Alarcón, Fabian Emmes, Carsten Fuhs, Jürgen Giesl, Raúl Gutiérrez, Salvador Lucas, Peter Schneider-Kamp, René Thiemann: Improving Context-Sensitive Dependency Pairs. LPAR 2008: 636-651
- [c45]Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl: Maximal Termination. RTA 2008: 110-125
- [c44]
- [i2]Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann: Automated Termination Proofs for Logic Programs by Term Rewriting. CoRR abs/0803.0014 (2008)
- 2007
- [j16]
- [j15]Jürgen Giesl, Armin Kühnemann, Janis Voigtländer: Deaccumulation techniques for improving provability. J. Log. Algebr. Program. 71(2): 79-113 (2007)
- [c43]Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp: Proving Termination by Bounded Increase. CADE 2007: 443-459
- [c42]Franz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis: 07401 Executive Summary -- Deduction and Decision Procedures. Deduction and Decision Procedures 2007
- [c41]Franz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis: 07401 Abstracts Collection -- Deduction and Decision Procedures. Deduction and Decision Procedures 2007
- [c40]Jürgen Giesl, Peter Schneider-Kamp, René Thiemann, Stephan Swiderski, Manh Thang Nguyen, Danny De Schreye, Alexander Serebrenik: Termination of Programs using Term Rewriting and SAT Solving. Deduction and Decision Procedures 2007
- [c39]Peter Schneider-Kamp, Carsten Fuhs, René Thiemann, Jürgen Giesl, Elena Annov, Michael Codish, Aart Middeldorp, Harald Zankl: Implementing RPO and POLO using SAT. Deduction and Decision Procedures 2007
- [c38]René Thiemann, Jürgen Giesl, Peter Schneider-Kamp: Decision Procedures for Loop Detection. Deduction and Decision Procedures 2007
- [c37]Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl: Proving Termination Using Recursive Path Orders and SAT Solving. FroCoS 2007: 267-282
- [c36]Manh Thang Nguyen, Jürgen Giesl, Peter Schneider-Kamp, Danny De Schreye: Termination Analysis of Logic Programs Based on Dependency Graphs. LOPSTR 2007: 8-22
- [c35]Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl: SAT Solving for Termination Analysis with Polynomial Interpretations. SAT 2007: 340-354
- [e2]Franz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis (Eds.): Deduction and Decision Procedures, 30.09. - 05.10.2007. Dagstuhl Seminar Proceedings 07401, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
- 2006
- [j14]Jürgen Giesl, Deepak Kapur: Third Special Issue on Techniques for Automated Termination Proofs. J. Autom. Reasoning 37(3): 153-154 (2006)
- [j13]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke: Mechanizing and Improving Dependency Pairs. J. Autom. Reasoning 37(3): 155-203 (2006)
- [c34]Jürgen Giesl, Peter Schneider-Kamp, René Thiemann: Automatic Termination Proofs in the Dependency Pair Framework. IJCAR 2006: 281-286
- [c33]Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann: Automated Termination Analysis for Logic Programs by Term Rewriting. LOPSTR 2006: 177-193
- [c32]Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl: SAT Solving for Argument Filterings. LPAR 2006: 30-44
- [c31]Jürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann: Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages. RTA 2006: 297-312
- [i1]Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl: SAT Solving for Argument Filterings. CoRR abs/cs/0605074 (2006)
- 2005
- [j12]René Thiemann, Jürgen Giesl: The size-change principle and dependency pairs for termination of term rewriting. Appl. Algebra Eng. Commun. Comput. 16(4): 229-270 (2005)
- [j11]
- [j10]
- [c30]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp: Proving and Disproving Termination in the Dependency Pair Framework. Deduction and Applications 2005
- [c29]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp: Proving and Disproving Termination of Higher-Order Functions. FroCoS 2005: 216-231
- [e1]Jürgen Giesl (Ed.): Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings. Lecture Notes in Computer Science 3467, Springer 2005, ISBN 3-540-25596-6
- 2004
- [j9]Jürgen Giesl, Aart Middeldorp: Transformation techniques for context-sensitive rewrite systems. J. Funct. Program. 14(4): 379-427 (2004)
- [c28]René Thiemann, Jürgen Giesl, Peter Schneider-Kamp: Improved Modular Termination Proofs Using Dependency Pairs. IJCAR 2004: 75-90
- [c27]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp: The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. LPAR 2004: 301-331
- [c26]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke: Automated Termination Proofs with AProVE. RTA 2004: 210-220
- 2003
- [j8]Jürgen Giesl, Hans Zantema: Simulating liveness by reduction strategies. Electr. Notes Theor. Comput. Sci. 86(4): 641-656 (2003)
- [c25]Jürgen Giesl, Armin Kühnemann, Janis Voigtländer: Deaccumulation - Improving Provability. ASIAN 2003: 146-160
- [c24]
- [c23]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke: Improving Dependency Pairs. LPAR 2003: 167-182
- [c22]
- [c21]
- 2002
- [j7]Jürgen Giesl, Thomas Arts, Enno Ohlebusch: Modular Termination Proofs for Rewriting Using Dependency Pairs. J. Symb. Comput. 34(1): 21-58 (2002)
- [c20]Jürgen Giesl, Aart Middeldorp: Innermost Termination of Context-Sensitive Rewriting. Developments in Language Theory 2002: 231-244
- 2001
- [j6]Jürgen Giesl, Pierre Lescanne: Special Issue "Termination". Appl. Algebra Eng. Commun. Comput. 12(1/2): 1-2 (2001)
- [j5]Jürgen Giesl, Thomas Arts: Verification of Erlang Processes by Dependency Pairs. Appl. Algebra Eng. Commun. Comput. 12(1/2): 39-72 (2001)
- [j4]
- [c19]
- [c18]
- 2000
- [j3]Thomas Arts, Jürgen Giesl: Termination of term rewriting using dependency pairs. Theor. Comput. Sci. 236(1-2): 133-178 (2000)
- [c17]
- [c16]Hitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl: Equational Termination by Semantic Labelling. CSL 2000: 457-471
- [c15]
1990 – 1999
- 1999
- [j2]Jürgen Brauburger, Jürgen Giesl: Approximating the Domains of Functional and Imperative Programs. Sci. Comput. Program. 35(2): 113-136 (1999)
- [c14]Thomas Arts, Jürgen Giesl: Applying Rewriting Techniques to the Verification of Erlang Processes. CSL 1999: 96-110
- [c13]
- [c12]
- 1998
- [c11]
- [c10]
- 1997
- [j1]Jürgen Giesl: Termination of Nested and Mutually Recursive Algorithms. J. Autom. Reasoning 19(1): 1-29 (1997)
- [c9]
- [c8]Thomas Arts, Jürgen Giesl: Automatically Proving Termination Where Simplification Orderings Fail. TAPSOFT 1997: 261-272
- 1996
- [c7]
- [c6]
- 1995
- [b1]Jürgen Giesl: Automatisierung von Terminierungsbeweisen für rekursiv definierte Algorithmen. DISKI 96, Infix 1995, ISBN 978-3-89601-096-4, pp. 1-306
- [c5]
- [c4]
- [c3]
- 1994
- [c2]
- 1993
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:16 CEST by the dblp team