Jürgen Giesl

	2012
95		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)
	2011
94		Lars Noschinski, Fabian Emmes, Jürgen Giesl: A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems. CADE 2011: 422-438
93		Alexander Krauss, Christian Sternagel, René Thiemann, Carsten Fuhs, Jürgen Giesl: Termination of Isabelle Functions via Termination of Rewriting. ITP 2011: 152-167
92		Marc Brockschmidt, Carsten Otto, Jürgen Giesl: Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting. RTA 2011: 155-170
91		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)
90		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)
89		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)
88		Jürgen Giesl, Reiner Hähnle: Preface: Special Issue of Selected Extended Papers of IJCAR 2010. J. Autom. Reasoning 47(4): 337-339 (2011)
87		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)
86		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)
	2010
85		Jürgen Giesl, Reiner Hähnle: Automated Reasoning, 5th International Joint Conference, IJCAR 2010, Edinburgh, UK, July 16-19, 2010. Proceedings Springer 2010
84		René Thiemann, Christian Sternagel, Jürgen Giesl, Peter Schneider-Kamp: Loops under Strategies ... Continued IWS 2010: 51-65
83		Thomas Ströder, Peter Schneider-Kamp, Jürgen Giesl: Dependency Triples for Improving Termination Analysis of Logic Programs with Cut. LOPSTR 2010: 184-199
82		Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp: Lazy Abstraction for Size-Change Termination. LPAR (Yogyakarta) 2010: 217-232
81		Carsten Otto, Marc Brockschmidt, Christian von Essen, Jürgen Giesl: Automated Termination Analysis of Java Bytecode by Term Rewriting. RTA 2010: 259-276
80		Marc Brockschmidt, Carsten Otto, Christian von Essen, Jürgen Giesl: Termination Graphs for Java Bytecode. Verification, Induction, Termination Analysis 2010: 17-37
79		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)
78		Jürgen Giesl: Current Trends in Automated Deduction. KI 24(1): 11-13 (2010)
77		Jürgen Giesl: Special Issue on Automated Deduction. KI 24(1): 7-9 (2010)
76		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)
	2009
75		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
74		Peter Schneider-Kamp, Jürgen Giesl, Manh Thang Nguyen: The Dependency Triple Framework for Termination of Logic Programs. LOPSTR 2009: 37-51
73		Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke: Proving Termination of Integer Term Rewriting. RTA 2009: 32-47
72		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)
71		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
70		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
69		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
68		Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl: Maximal Termination. RTA 2008: 110-125
67		René Thiemann, Jürgen Giesl, Peter Schneider-Kamp: Deciding Innermost Loops. RTA 2008: 366-380
66		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)
65		Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann: Automated Termination Proofs for Logic Programs by Term Rewriting CoRR abs/0803.0014: (2008)
64		Jürgen Giesl: Preface. Electr. Notes Theor. Comput. Sci. 204: 1-2 (2008)
	2007
63		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
62		Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp: Proving Termination by Bounded Increase. CADE 2007: 443-459
61		Franz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis: 07401 Abstracts Collection -- Deduction and Decision Procedures. Deduction and Decision Procedures 2007
60		Franz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis: 07401 Executive Summary -- Deduction and Decision Procedures. Deduction and Decision Procedures 2007
59		René Thiemann, Jürgen Giesl, Peter Schneider-Kamp: Decision Procedures for Loop Detection. Deduction and Decision Procedures 2007
58		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
57		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
56		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
55		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
54		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
53		Jürgen Giesl: RTA 2005. Inf. Comput. 205(4): 417-418 (2007)
52		Jürgen Giesl, Armin Kühnemann, Janis Voigtländer: Deaccumulation techniques for improving provability. J. Log. Algebr. Program. 71(2): 79-113 (2007)
	2006
51		Jürgen Giesl, Peter Schneider-Kamp, René Thiemann: Automatic Termination Proofs in the Dependency Pair Framework. IJCAR 2006: 281-286
50		Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann: Automated Termination Analysis for Logic Programs by Term Rewriting. LOPSTR 2006: 177-193
49		Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl: SAT Solving for Argument Filterings. LPAR 2006: 30-44
48		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
47		Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl: SAT Solving for Argument Filterings CoRR abs/cs/0605074: (2006)
46		Jürgen Giesl, Deepak Kapur: Third Special Issue on Techniques for Automated Termination Proofs. J. Autom. Reasoning 37(3): 153-154 (2006)
45		Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke: Mechanizing and Improving Dependency Pairs. J. Autom. Reasoning 37(3): 155-203 (2006)
	2005
44		Jürgen Giesl: Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings Springer 2005
43		Jürgen Giesl, René Thiemann, Peter Schneider-Kamp: Proving and Disproving Termination in the Dependency Pair Framework. Deduction and Applications 2005
42		Jürgen Giesl, René Thiemann, Peter Schneider-Kamp: Proving and Disproving Termination of Higher-Order Functions. FroCos 2005: 216-231
41		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)
40		Jürgen Giesl, Deepak Kapur: Preface. J. Autom. Reasoning 34(2): 103-104 (2005)
39		Jürgen Giesl, Deepak Kapur: Preface. J. Autom. Reasoning 34(4): 323 (2005)
	2004
38		René Thiemann, Jürgen Giesl, Peter Schneider-Kamp: Improved Modular Termination Proofs Using Dependency Pairs. IJCAR 2004: 75-90
37		Jürgen Giesl, René Thiemann, Peter Schneider-Kamp: The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. LPAR 2004: 301-331
36		Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke: Automated Termination Proofs with AProVE. RTA 2004: 210-220
35		Jürgen Giesl, Aart Middeldorp: Transformation techniques for context-sensitive rewrite systems. J. Funct. Program. 14(4): 379-427 (2004)
	2003
34		Jürgen Giesl, Armin Kühnemann, Janis Voigtländer: Deaccumulation - Improving Provability. ASIAN 2003: 146-160
33		Jürgen Giesl, Deepak Kapur: Deciding Inductive Validity of Equations. CADE 2003: 17-31
32		Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke: Improving Dependency Pairs. LPAR 2003: 167-182
31		René Thiemann, Jürgen Giesl: Size-Change Termination for Term Rewriting. RTA 2003: 264-278
30		Jürgen Giesl, Hans Zantema: Liveness in Rewriting. RTA 2003: 321-336
29		Jürgen Giesl, Hans Zantema: Simulating liveness by reduction strategies. Electr. Notes Theor. Comput. Sci. 86(4): 641-656 (2003)
	2002
28		Jürgen Giesl, Aart Middeldorp: Innermost Termination of Context-Sensitive Rewriting. Developments in Language Theory 2002: 231-244
27		Jürgen Giesl, Thomas Arts, Enno Ohlebusch: Modular Termination Proofs for Rewriting Using Dependency Pairs. J. Symb. Comput. 34(1): 21-58 (2002)
	2001
26		Jürgen Giesl, Deepak Kapur: Decidable Classes of Inductive Theorems. IJCAR 2001: 469-484
25		Jürgen Giesl, Deepak Kapur: Dependency Pairs for Equational Rewriting. RTA 2001: 93-108
24		Jürgen Giesl, Pierre Lescanne: Special Issue "Termination". Appl. Algebra Eng. Commun. Comput. 12(1/2): 1-2 (2001)
23		Jürgen Giesl, Thomas Arts: Verification of Erlang Processes by Dependency Pairs. Appl. Algebra Eng. Commun. Comput. 12(1/2): 39-72 (2001)
22		Jürgen Giesl: Induction Proofs with Partial Functions. J. Autom. Reasoning 26(1): 1-49 (2001)
	2000
21		Jürgen Giesl, Aart Middeldorp: Eliminating Dummy Elimination. CADE 2000: 309-323
20		Hitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl: Equational Termination by Semantic Labelling. CSL 2000: 457-471
19		David A. Duffy, Jürgen Giesl: Closure Induction in a Z-Like Language. ZB 2000: 471-490
18		Thomas Arts, Jürgen Giesl: Termination of term rewriting using dependency pairs. Theor. Comput. Sci. 236(1-2): 133-178 (2000)
	1999
17		Thomas Arts, Jürgen Giesl: Applying Rewriting Techniques to the Verification of Erlang Processes. CSL 1999: 96-110
16		Jürgen Giesl: Context-Moving Transformations for Function Verification. LOPSTR 1999: 293-312
15		Jürgen Giesl, Aart Middeldorp: Transforming Context-Sensitive Rewrite Systems. RTA 1999: 271-287
14		Jürgen Brauburger, Jürgen Giesl: Approximating the Domains of Functional and Imperative Programs. Sci. Comput. Program. 35(2): 113-136 (1999)
	1998
13		Jürgen Brauburger, Jürgen Giesl: Termination Analysis by Inductive Evaluation. CADE 1998: 254-269
12		Thomas Arts, Jürgen Giesl: Modularity of Termination Using Dependency pairs. RTA 1998: 226-240
	1997
11		Thomas Arts, Jürgen Giesl: Proving Innermost Normalisation Automatically. RTA 1997: 157-171
10		Thomas Arts, Jürgen Giesl: Automatically Proving Termination Where Simplification Orderings Fail. TAPSOFT 1997: 261-272
9		Jürgen Giesl: Termination of Nested and Mutually Recursive Algorithms. J. Autom. Reasoning 19(1): 1-29 (1997)
	1996
8		Thomas Arts, Jürgen Giesl: Termination of Constructor Systems. RTA 1996: 63-77
7		Jürgen Brauburger, Jürgen Giesl: Termination Analysis for Partial Functions. SAS 1996: 113-127
	1995
6		Jürgen Giesl: Automatisierung von Terminierungsbeweisen für rekursiv definierte Algorithmen. Infix 1995: 1-306
5		Jürgen Giesl: Automated Termination Proofs with Measure Functions. KI 1995: 149-160
4		Jü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

1	Beatriz Alarcón	[69]
2	Elena Annov	[56] [58]
3	Thomas Arts	[8] [10] [11] [12] [17] [18] [23] [27]
4	Franz Baader	[60] [61] [63]
5	Amir M. Ben-Amram	[86] [90]
6	Jürgen Brauburger	[7] [13] [14]
7	Marc Brockschmidt	[80] [81] [92]
8	Michael Codish	[47] [49] [56] [58] [82] [86] [90] [95]
9	Byron Cook	[60] [61] [63]
10	David A. Duffy	[19]
11	Fabian Emmes	[69] [94]
12	Christian von Essen	[80] [81]
13	Stephan Falke	[32] [36] [45] [73]
14	Carsten Fuhs	[54] [58] [68] [69] [70] [73] [75] [82] [86] [89] [90] [93]
15	Igor Gonopolskiy	[86] [90]
16	Raúl Gutiérrez	[69]
17	Reiner Hähnle	[85] [88]
18	Deepak Kapur	[25] [26] [33] [39] [40] [46]
19	Alexander Krauss	[93]
20	Armin Kühnemann	[34] [52]
21	Vitaly Lagoon	[47] [49]
22	Pierre Lescanne	[24]
23	Salvador Lucas	[69] [70]
24	Aart Middeldorp	[15] [20] [21] [28] [35] [54] [58] [68]
25	Rafael Navarro-Marset	[70]
26	Ingrid Neumann	[1] [2]
27	Manh Thang Nguyen	[55] [57] [71] [74] [87]
28	Robert Nieuwenhuis	[60] [61] [63]
29	Lars Noschinski	[94]
30	Enno Ohlebusch	[27]
31	Hitoshi Ohsaki	[20]
32	Carsten Otto	[70] [80] [81] [92]
33	Michael Parting	[75] [89]
34	Martin Plücker	[73]
35	Matthias Raffelsieper	[91]
36	Peter Schneider-Kamp	[32] [36] [37] [38] [42] [43] [45] [47] [48] [49] [50] [51] [54] [55] [56] [57] [58] [59] [62] [65] [66] [67] [68] [69] [70] [71] [72] [73] [74] [75] [76] [79] [82] [83] [84] [87] [89] [91] [95]
37	Danny De Schreye	[55] [57] [71] [87]
38	Alexander Serebrenik	[50] [57] [65] [72] [76] [79]
39	Christian Sternagel	[84] [93]
40	Thomas Ströder	[76] [79] [83]
41	Stephan Swiderski	[48] [57] [62] [75] [89] [91]
42	René Thiemann	[31] [32] [36] [37] [38] [41] [42] [43] [45] [47] [48] [49] [50] [51] [54] [56] [57] [58] [59] [62] [65] [66] [67] [68] [69] [72] [76] [79] [84] [91] [93] [95]
43	Janis Voigtländer	[34] [52]
44	Harald Zankl	[54] [58] [68]
45	Hans Zantema	[29] [30] [66]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page