Publications in 2008

Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations
Georg Moser, Andreas Schnabl, and Johannes Waldmann
Proceedings of the 28th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2008),   pp. 304 – 315, 2008.

Uncurrying for Termination
Nao Hirokawa, Aart Middeldorp, and Harald Zankl
Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2008), Lecture Notes in Artificial Intelligence 5330, pp. 667 – 681, 2008.

Complexity, Graphs, and the Dependency Pair Method
Nao Hirokawa and Georg Moser
Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2008), Lecture Notes in Artificial Intelligence 5330, pp. 652 – 666, 2008.

Improving Context-Sensitive Dependency Pairs
Beatriz Alarcón, Fabian Emmes, Carsten Fuhs, Jürgen Giesl, Raúl Gutiérrez, Salvador Lucas, Peter Schneider-Kamp, and René Thiemann
Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2008), Lecture Notes in Artificial Intelligence 5330, pp. 636 – 651, 2008.

Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
Martin Korp and Aart Middeldorp
Proceedings of the 2nd International Conference on Language and Automata Theory and Application (LATA 2008), Lecture Notes in Computer Science 5196, pp. 321 – 332, 2008.

Multi-Completion with Termination Tools (System Description)
Haruhiko Sato, Sarah Winkler, Masahito Kurihara, and Aart Middeldorp
Proceedings of the 4th International Joint Conference on Automated Reasoning (IJCAR 2008), Lecture Notes in Artificial Intelligence 5195, pp. 306 – 312, 2008.

Automated Implicit Computational Complexity Analysis (System Description)
Martin Avanzini, Georg Moser, and Andreas Schnabl
Proceedings of the 4th International Joint Conference on Automated Reasoning (IJCAR 2008), Lecture Notes in Artificial Intelligence 5195, pp. 132 – 139, 2008.

Automated Complexity Analysis Based on the Dependency Pair Method
Nao Hirokawa and Georg Moser
Proceedings of the 4th International Joint Conference on Automated Reasoning (IJCAR 2008), Lecture Notes in Artificial Intelligence 5195, pp. 364 – 380, 2008.

Increasing Interpretations
Harald Zankl and Aart Middeldorp
Proceedings of the 9th International Conference on Artificial Intelligence and Symbolic Computation (AISC 2008), Lecture Notes in Artificial Intelligence 5144, pp. 191 – 205, 2008.

Proving Quadratic Derivational Complexities using Context Dependent Interpretations
Georg Moser and Andreas Schnabl
Proceedings of the 19th International Conference on Rewriting Techniques and Applications (RTA 2008), Lecture Notes in Computer Science 5117, pp. 276 – 290, 2008.

Deciding Innermost Loops
René Thiemann, Jürgen Giesl, and Peter Schneider-Kamp
Proceedings of the 19th International Conference on Rewriting Techniques and Applications (RTA 2008), Lecture Notes in Computer Science 5117, pp. 366 – 380, 2008.

Root-Labeling
Christian Sternagel and Aart Middeldorp
Proceedings of the 19th International Conference on Rewriting Techniques and Applications (RTA 2008), Lecture Notes in Computer Science 5117, pp. 336 – 350, 2008.

Maximal Termination
Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, and Harald Zankl
Proceedings of the 19th International Conference on Rewriting Techniques and Applications (RTA 2008), Lecture Notes in Computer Science 5117, pp. 110 – 125, 2008.

Complexity Analysis by Rewriting
Martin Avanzini and Georg Moser
Proceedings of the 9th International Symposium on Functional and Logic Programming (FLOPS 2008), Lecture Notes in Computer Science 4989, pp. 130 – 146, 2008.

Innermost Termination of Rewrite Systems by Labeling
René Thiemann and Aart Middeldorp
Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2007), Electronic Notes in Theoretical Computer Science 204, pp. 3 – 19, 2008.

A Database Approach to Distributed State Space Generation
Stefan Blom, Bert Lisser, Jaco van de Pol, and Michael Weber
Proceedings of the 6th International Workshop on Parallel and Distributed Methods in Verification (PDMC 2007), Electronic Notes in Theoretical Computer Science 198(1), pp. 17 – 32, 2008.

Adding Constants to String Rewriting
René Thiemann, Hans Zantema, Jürgen Giesl, and Peter Schneider-Kamp
Applicable Algebra in Engineering, Communication and Computing 19(1), pp. 27 – 38, 2008.

A Mechanized Proof of the Basic Perturbation Lemma
Jesús Aransay, Clemens Ballarin, and Julio Rubio
Journal of Automated Reasoning 40(4), pp. 271 – 292, 2008.