Peter Schneider-Kamp

	2009
27		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
26		Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke: Proving Termination of Integer Term Rewriting. RTA 2009: 32-47
	2008
25		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
24		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
23		Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl: Maximal Termination. RTA 2008: 110-125
22		René Thiemann, Jürgen Giesl, Peter Schneider-Kamp: Deciding Innermost Loops. RTA 2008: 366-380
21		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)
20		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
19		Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp: Proving Termination by Bounded Increase. CADE 2007: 443-459
18		René Thiemann, Jürgen Giesl, Peter Schneider-Kamp: Decision Procedures for Loop Detection. Deduction and Decision Procedures 2007
17		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
16		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
15		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
14		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
13		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
	2006
12		Jürgen Giesl, Peter Schneider-Kamp, René Thiemann: Automatic Termination Proofs in the Dependency Pair Framework. IJCAR 2006: 281-286
11		Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann: Automated Termination Analysis for Logic Programs by Term Rewriting. LOPSTR 2006: 177-193
10		Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl: SAT Solving for Argument Filterings. LPAR 2006: 30-44
9		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
8		Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl: SAT Solving for Argument Filterings CoRR abs/cs/0605074: (2006)
7		Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke: Mechanizing and Improving Dependency Pairs. J. Autom. Reasoning 37(3): 155-203 (2006)
	2005
6		Jürgen Giesl, René Thiemann, Peter Schneider-Kamp: Proving and Disproving Termination in the Dependency Pair Framework. Deduction and Applications 2005
5		Jürgen Giesl, René Thiemann, Peter Schneider-Kamp: Proving and Disproving Termination of Higher-Order Functions. FroCos 2005: 216-231
	2004
4		René Thiemann, Jürgen Giesl, Peter Schneider-Kamp: Improved Modular Termination Proofs Using Dependency Pairs. IJCAR 2004: 75-90
3		Jürgen Giesl, René Thiemann, Peter Schneider-Kamp: The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. LPAR 2004: 301-331
2		Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke: Automated Termination Proofs with AProVE. RTA 2004: 210-220
	2003
1		Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke: Improving Dependency Pairs. LPAR 2003: 167-182

Coauthor Index

1	Beatriz Alarcón	[24]
2	Elena Annov	[15] [17]
3	Michael Codish	[8] [10] [15] [17]
4	Fabian Emmes	[24]
5	Stephan Falke	[1] [2] [7] [26]
6	Carsten Fuhs	[13] [17] [23] [24] [25] [26] [27]
7	Jürgen Giesl	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27]
8	Raúl Gutiérrez	[24]
9	Vitaly Lagoon	[8] [10]
10	Salvador Lucas	[24] [25]
11	Aart Middeldorp	[13] [17] [23]
12	Rafael Navarro-Marset	[25]
13	Manh Thang Nguyen	[14] [16]
14	Carsten Otto	[25]
15	Michael Parting	[27]
16	Martin Plücker	[26]
17	Danny De Schreye	[14] [16]
18	Alexander Serebrenik	[11] [16] [20]
19	Stephan Swiderski	[9] [16] [19] [27]
20	René Thiemann	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24]
21	Harald Zankl	[13] [17] [23]
22	Hans Zantema	[21]