René Thiemann

	2012
46		René Thiemann: Executable Transitive Closures. Archive of Formal Proofs 2012: (2012)
45		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
44		Christian Sternagel, René Thiemann: Generalized and Formalized Uncurrying. FroCos 2011: 243-258
43		Alexander Krauss, Christian Sternagel, René Thiemann, Carsten Fuhs, Jürgen Giesl: Termination of Isabelle Functions via Termination of Rewriting. ITP 2011: 152-167
42		Christian Sternagel, René Thiemann: Modular and Certified Semantic Labeling and Unlabeling. RTA 2011: 329-344
41		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)
40		Christian Sternagel, René Thiemann: Executable Transitive Closures of Finite Relations. Archive of Formal Proofs 2011: (2011)
	2010
39		Christian Sternagel, René Thiemann: Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs. CSL 2010: 514-528
38		René Thiemann, Christian Sternagel, Jürgen Giesl, Peter Schneider-Kamp: Loops under Strategies ... Continued IWS 2010: 51-65
37		Christian Sternagel, René Thiemann: Certified Subterm Criterion and Certified Usable Rules. RTA 2010: 325-340
36		Christian Sternagel, René Thiemann: Abstract Rewriting. Archive of Formal Proofs 2010: (2010)
35		Christian Sternagel, René Thiemann: Executable Matrix Operations on Matrices of Arbitrary Dimensions. Archive of Formal Proofs 2010: (2010)
34		Christian Sternagel, René Thiemann: Executable Multivariate Polynomials. Archive of Formal Proofs 2010: (2010)
33		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)
32		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
31		René Thiemann, Christian Sternagel: Loops under Strategies. RTA 2009: 17-31
30		René Thiemann: From Outermost Termination to Innermost Termination. SOFSEM 2009: 533-545
29		René Thiemann, Christian Sternagel: Certification of Termination Proofs Using CeTA. TPHOLs 2009: 452-468
28		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)
	2008
27		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
26		Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl: Maximal Termination. RTA 2008: 110-125
25		René Thiemann, Jürgen Giesl, Peter Schneider-Kamp: Deciding Innermost Loops. RTA 2008: 366-380
24		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)
23		Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann: Automated Termination Proofs for Logic Programs by Term Rewriting CoRR abs/0803.0014: (2008)
22		René Thiemann, Aart Middeldorp: Innermost Termination of Rewrite Systems by Labeling. Electr. Notes Theor. Comput. Sci. 204: 3-19 (2008)
	2007
21		Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp: Proving Termination by Bounded Increase. CADE 2007: 443-459
20		René Thiemann, Jürgen Giesl, Peter Schneider-Kamp: Decision Procedures for Loop Detection. Deduction and Decision Procedures 2007
19		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
18		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
17		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
16		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
15		René Thiemann: The DP framework for proving termination of term rewriting. RWTH Aachen University 2007: 1-211
	2006
14		Jürgen Giesl, Peter Schneider-Kamp, René Thiemann: Automatic Termination Proofs in the Dependency Pair Framework. IJCAR 2006: 281-286
13		Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann: Automated Termination Analysis for Logic Programs by Term Rewriting. LOPSTR 2006: 177-193
12		Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl: SAT Solving for Argument Filterings. LPAR 2006: 30-44
11		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
10		Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl: SAT Solving for Argument Filterings CoRR abs/cs/0605074: (2006)
9		Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke: Mechanizing and Improving Dependency Pairs. J. Autom. Reasoning 37(3): 155-203 (2006)
	2005
8		Jürgen Giesl, René Thiemann, Peter Schneider-Kamp: Proving and Disproving Termination in the Dependency Pair Framework. Deduction and Applications 2005
7		Jürgen Giesl, René Thiemann, Peter Schneider-Kamp: Proving and Disproving Termination of Higher-Order Functions. FroCos 2005: 216-231
6		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)
	2004
5		René Thiemann, Jürgen Giesl, Peter Schneider-Kamp: Improved Modular Termination Proofs Using Dependency Pairs. IJCAR 2004: 75-90
4		Jürgen Giesl, René Thiemann, Peter Schneider-Kamp: The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. LPAR 2004: 301-331
3		Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke: Automated Termination Proofs with AProVE. RTA 2004: 210-220
	2003
2		Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke: Improving Dependency Pairs. LPAR 2003: 167-182
1		René Thiemann, Jürgen Giesl: Size-Change Termination for Term Rewriting. RTA 2003: 264-278

Coauthor Index

1	Beatriz Alarcón	[27]
2	Elena Annov	[17] [19]
3	Michael Codish	[10] [12] [17] [19] [45]
4	Fabian Emmes	[27]
5	Stephan Falke	[2] [3] [9]
6	Carsten Fuhs	[16] [19] [26] [27] [43]
7	Jürgen Giesl	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [16] [17] [18] [19] [20] [21] [23] [24] [25] [26] [27] [28] [32] [33] [38] [41] [43] [45]
8	Raúl Gutiérrez	[27]
9	Alexander Krauss	[43]
10	Vitaly Lagoon	[10] [12]
11	Salvador Lucas	[27]
12	Aart Middeldorp	[16] [19] [22] [26]
13	Manh Thang Nguyen	[18]
14	Matthias Raffelsieper	[41]
15	Peter Schneider-Kamp	[2] [3] [4] [5] [7] [8] [9] [10] [11] [12] [13] [14] [16] [17] [18] [19] [20] [21] [23] [24] [25] [26] [27] [28] [32] [33] [38] [41] [45]
16	Danny De Schreye	[18]
17	Alexander Serebrenik	[13] [18] [23] [28] [32] [33]
18	Christian Sternagel	[29] [31] [34] [35] [36] [37] [38] [39] [40] [42] [43] [44]
19	Thomas Ströder	[32] [33]
20	Stephan Swiderski	[11] [18] [21] [41]
21	Harald Zankl	[16] [19] [26]
22	Hans Zantema	[24]

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