dblp.uni-trier.dewww.uni-trier.de

Jürgen Giesl Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
71EEStephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp: Termination Analysis by Dependency Pairs and Inductive Theorem Proving. CADE 2009: 322-338
70EECarsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke: Proving Termination of Integer Term Rewriting. RTA 2009: 32-47
2008
69EECarsten 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
68EEBeatriz 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
67EECarsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl: Maximal Termination. RTA 2008: 110-125
66EERené Thiemann, Jürgen Giesl, Peter Schneider-Kamp: Deciding Innermost Loops. RTA 2008: 366-380
65EERené Thiemann, Hans Zantema, Jürgen Giesl, Peter Schneider-Kamp: Adding constants to string rewriting. Appl. Algebra Eng. Commun. Comput. 19(1): 27-38 (2008)
64EEPeter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann: Automated Termination Proofs for Logic Programs by Term Rewriting CoRR abs/0803.0014: (2008)
63EEJürgen Giesl: Preface. Electr. Notes Theor. Comput. Sci. 204: 1-2 (2008)
2007
62 Franz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis: Deduction and Decision Procedures, 30.09. - 05.10.2007 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
61EEJürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp: Proving Termination by Bounded Increase. CADE 2007: 443-459
60EEFranz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis: 07401 Abstracts Collection -- Deduction and Decision Procedures. Deduction and Decision Procedures 2007
59EEFranz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis: 07401 Executive Summary -- Deduction and Decision Procedures. Deduction and Decision Procedures 2007
58EERené Thiemann, Jürgen Giesl, Peter Schneider-Kamp: Decision Procedures for Loop Detection. Deduction and Decision Procedures 2007
57EEPeter 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
56EEJü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
55EEPeter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl: Proving Termination Using Recursive Path Orders and SAT Solving. FroCos 2007: 267-282
54EEManh Thang Nguyen, Jürgen Giesl, Peter Schneider-Kamp, Danny De Schreye: Termination Analysis of Logic Programs Based on Dependency Graphs. LOPSTR 2007: 8-22
53EECarsten 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
52EEJürgen Giesl: RTA 2005. Inf. Comput. 205(4): 417-418 (2007)
51EEJürgen Giesl, Armin Kühnemann, Janis Voigtländer: Deaccumulation techniques for improving provability. J. Log. Algebr. Program. 71(2): 79-113 (2007)
2006
50EEJürgen Giesl, Peter Schneider-Kamp, René Thiemann: Automatic Termination Proofs in the Dependency Pair Framework. IJCAR 2006: 281-286
49EEPeter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann: Automated Termination Analysis for Logic Programs by Term Rewriting. LOPSTR 2006: 177-193
48EEMichael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl: SAT Solving for Argument Filterings. LPAR 2006: 30-44
47EEJürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann: Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages. RTA 2006: 297-312
46EEMichael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl: SAT Solving for Argument Filterings CoRR abs/cs/0605074: (2006)
45EEJürgen Giesl, Deepak Kapur: Third Special Issue on Techniques for Automated Termination Proofs. J. Autom. Reasoning 37(3): 153-154 (2006)
44EEJürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke: Mechanizing and Improving Dependency Pairs. J. Autom. Reasoning 37(3): 155-203 (2006)
2005
43 Jürgen Giesl: Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings Springer 2005
42EEJürgen Giesl, René Thiemann, Peter Schneider-Kamp: Proving and Disproving Termination in the Dependency Pair Framework. Deduction and Applications 2005
41EEJürgen Giesl, René Thiemann, Peter Schneider-Kamp: Proving and Disproving Termination of Higher-Order Functions. FroCos 2005: 216-231
40EERené 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)
39EEJürgen Giesl, Deepak Kapur: Preface. J. Autom. Reasoning 34(2): 103-104 (2005)
38EEJürgen Giesl, Deepak Kapur: Preface. J. Autom. Reasoning 34(4): 323 (2005)
2004
37EERené Thiemann, Jürgen Giesl, Peter Schneider-Kamp: Improved Modular Termination Proofs Using Dependency Pairs. IJCAR 2004: 75-90
36EEJürgen Giesl, René Thiemann, Peter Schneider-Kamp: The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. LPAR 2004: 301-331
35EEJürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke: Automated Termination Proofs with AProVE. RTA 2004: 210-220
34EEJürgen Giesl, Aart Middeldorp: Transformation techniques for context-sensitive rewrite systems. J. Funct. Program. 14(4): 379-427 (2004)
2003
33EEJürgen Giesl, Armin Kühnemann, Janis Voigtländer: Deaccumulation - Improving Provability. ASIAN 2003: 146-160
32EEJürgen Giesl, Deepak Kapur: Deciding Inductive Validity of Equations. CADE 2003: 17-31
31EEJürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke: Improving Dependency Pairs. LPAR 2003: 167-182
30EERené Thiemann, Jürgen Giesl: Size-Change Termination for Term Rewriting. RTA 2003: 264-278
29EEJürgen Giesl, Hans Zantema: Liveness in Rewriting. RTA 2003: 321-336
28EEJürgen Giesl, Hans Zantema: Simulating liveness by reduction strategies. Electr. Notes Theor. Comput. Sci. 86(4): (2003)
2002
27EEJürgen Giesl, Aart Middeldorp: Innermost Termination of Context-Sensitive Rewriting. Developments in Language Theory 2002: 231-244
26EEJürgen Giesl, Thomas Arts, Enno Ohlebusch: Modular Termination Proofs for Rewriting Using Dependency Pairs. J. Symb. Comput. 34(1): 21-58 (2002)
2001
25EEJürgen Giesl, Deepak Kapur: Decidable Classes of Inductive Theorems. IJCAR 2001: 469-484
24EEJürgen Giesl, Deepak Kapur: Dependency Pairs for Equational Rewriting. RTA 2001: 93-108
23EEJürgen Giesl, Pierre Lescanne: Special Issue "Termination". Appl. Algebra Eng. Commun. Comput. 12(1/2): 1-2 (2001)
22EEJürgen Giesl, Thomas Arts: Verification of Erlang Processes by Dependency Pairs. Appl. Algebra Eng. Commun. Comput. 12(1/2): 39-72 (2001)
21 Jürgen Giesl: Induction Proofs with Partial Functions. J. Autom. Reasoning 26(1): 1-49 (2001)
2000
20EEJürgen Giesl, Aart Middeldorp: Eliminating Dummy Elimination. CADE 2000: 309-323
19EEHitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl: Equational Termination by Semantic Labelling. CSL 2000: 457-471
18EEDavid A. Duffy, Jürgen Giesl: Closure Induction in a Z-Like Language. ZB 2000: 471-490
17EEThomas Arts, Jürgen Giesl: Termination of term rewriting using dependency pairs. Theor. Comput. Sci. 236(1-2): 133-178 (2000)
1999
16EEThomas Arts, Jürgen Giesl: Applying Rewriting Techniques to the Verification of Erlang Processes. CSL 1999: 96-110
15 Jürgen Giesl: Context-Moving Transformations for Function Verification. LOPSTR 1999: 293-312
14EEJürgen Giesl, Aart Middeldorp: Transforming Context-Sensitive Rewrite Systems. RTA 1999: 271-287
13 Jürgen Brauburger, Jürgen Giesl: Approximating the Domains of Functional and Imperative Programs. Sci. Comput. Program. 35(2): 113-136 (1999)
1998
12EEJürgen Brauburger, Jürgen Giesl: Termination Analysis by Inductive Evaluation. CADE 1998: 254-269
11EEThomas Arts, Jürgen Giesl: Modularity of Termination Using Dependency pairs. RTA 1998: 226-240
1997
10EEThomas Arts, Jürgen Giesl: Proving Innermost Normalisation Automatically. RTA 1997: 157-171
9EEThomas Arts, Jürgen Giesl: Automatically Proving Termination Where Simplification Orderings Fail. TAPSOFT 1997: 261-272
8 Jürgen Giesl: Termination of Nested and Mutually Recursive Algorithms. J. Autom. Reasoning 19(1): 1-29 (1997)
1996
7EEThomas Arts, Jürgen Giesl: Termination of Constructor Systems. RTA 1996: 63-77
6 Jürgen Brauburger, Jürgen Giesl: Termination Analysis for Partial Functions. SAS 1996: 113-127
1995
5 Jürgen Giesl: Automated Termination Proofs with Measure Functions. KI 1995: 149-160
4EEJürgen Giesl: Generating Polynomial Orderings for Termination Proofs. RTA 1995: 426-431
3 Jürgen Giesl: Termination Analysis for Functional Programs using Term Orderings SAS 1995: 154-171
1994
2 Jürgen Giesl, Ingrid Neumann: Strategies for Semantical Contractions. KI 1994: 396
1993
1 Jürgen Giesl, Ingrid Neumann: The Semantics of Rational Contractions. EPIA 1993: 356

Coauthor Index

1Beatriz Alarcón [68]
2Elena Annov [55] [57]
3Thomas Arts [7] [9] [10] [11] [16] [17] [22] [26]
4Franz Baader [59] [60] [62]
5Jürgen Brauburger [6] [12] [13]
6Michael Codish [46] [48] [55] [57]
7Byron Cook [59] [60] [62]
8David A. Duffy [18]
9Fabian Emmes [68]
10Stephan Falke [31] [35] [44] [70]
11Carsten Fuhs [53] [57] [67] [68] [69] [70] [71]
12Raúl Gutiérrez [68]
13Deepak Kapur [24] [25] [32] [38] [39] [45]
14Armin Kühnemann [33] [51]
15Vitaly Lagoon [46] [48]
16Pierre Lescanne [23]
17Salvador Lucas [68] [69]
18Aart Middeldorp [14] [19] [20] [27] [34] [53] [57] [67]
19Rafael Navarro-Marset [69]
20Ingrid Neumann [1] [2]
21Manh Thang Nguyen [54] [56]
22Robert Nieuwenhuis [59] [60] [62]
23Enno Ohlebusch [26]
24Hitoshi Ohsaki [19]
25Carsten Otto [69]
26Michael Parting [71]
27Martin Plücker [70]
28Peter Schneider-Kamp [31] [35] [36] [37] [41] [42] [44] [46] [47] [48] [49] [50] [53] [54] [55] [56] [57] [58] [61] [64] [65] [66] [67] [68] [69] [70] [71]
29Danny De Schreye [54] [56]
30Alexander Serebrenik [49] [56] [64]
31Stephan Swiderski [47] [56] [61] [71]
32René Thiemann [30] [31] [35] [36] [37] [40] [41] [42] [44] [46] [47] [48] [49] [50] [53] [55] [56] [57] [58] [61] [64] [65] [66] [67] [68]
33Janis Voigtländer [33] [51]
34Harald Zankl [53] [57] [67]
35Hans Zantema [28] [29] [65]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)