Lecture Notes in Computer Science 5117

Transcription

1 Lecture Notes in Computer Science 5117 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen University of Dortmund, Germany Madhu Sudan Massachusetts Institute of Technology, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max-Planck Institute of Computer Science, Saarbruecken, Germany

2 Andrei Voronkov (Ed.) Rewriting Techniques and Applications 19th International Conference, RTA 2008 Hagenberg, Austria, July 15-17, 2008 Proceedings 13

3 Volume Editor Andrei Voronkov The University of Manchester School of Computer Science Kilburn Building, Oxford Road, Manchester M13 9PL, UK Library of Congress Control Number: CR Subject Classification (1998): F.4, F.3.2, D.3, I.2.2-3, I.1 LNCS Sublibrary: SL 1 Theoretical Computer Science and General Issues ISSN ISBN Springer Berlin Heidelberg New York ISBN Springer Berlin Heidelberg New York This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. Springer is a part of Springer Science+Business Media springer.com Springer-Verlag Berlin Heidelberg 2008 Printed in Germany Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper SPIN: /

4 Preface This volume contains the papers presented at RTA 2008: 19th International Conference on Rewriting Techniques and Applications held July 15 17th in Hagenberg, Austria and organised by the Research Institute on Symbolic Computation. There were 57 submissions. Each submission was reviewed by at least four Programme Committee members. The committee decided to accept 30 papers. The submission and Programme Committee work was organised through the EasyChair system. I thank the Programme Committee members for their very efficient work. My special thanks to Temur Kutsia, Aart Middeldorp, Robert Nieuwenhuis and Maribel Fernandez for their help and advice on many aspects of the RTA organisation and traditions. I would also like to thank RTA General Chair Bruno Buchberger. April 2008 Andrei Voronkov

5 Conference Organisation General Chair Bruno Buchberger (Johannes Kepler University Linz) Programme Chair Andrei Voronkov (University of Manchester) Organising Committee Chair Temur Kutsia (Johannes Kepler University Linz) Programme Committee Maribel Fernández (King s College London) Neil Ghani (University of Nottingham) Jürgen Giesl (RWTH Aachen) Guillem Godoy (Universidad Politécnica de Cataluña) Jean Goubault-Larrecq (ENS Cachan) Tetsuo Ida (University of Tsukuba) Claude Kirchner (INRIA) Konstantin Korovin (University of Manchester) Temur Kutsia (Johannes Kepler University Linz) Aart Middeldorp (University of Innsbruck) Paliath Narendran (University at Albany - SUNY) Robert Nieuwenhuis (Universidad Politécnica de Cataluña) Michaël Rusinowitch (LORIA-INRIA) Aaron Stump (Washington University in St. Louis) Jean-Marc Talbot (Université de Provence) Yoshihito Toyama (Tohoku University) Ralf Treinen (Université Paris Diderot) Hans Zantema (Technische Universiteit Eindhoven) External Reviewers Markus Aderhold Maria Alpuente Thorsten Altenkirch Takahito Aoto Emilie Balland Richard Banach Peter Baumgartner Clara Bertolissi

6 VIII Organisation Hariolf Betz Gavin Bierman Stefan Blom Yohan Boichut Iovka Boneva Guillaume Bonfante Thierry Boy de la Tour Sander Bruggink Serge Burckel Sergiu Bursuc Christophe Calves Benjamin Carle Jacques Chabin Jeremie Chalopin Witold Charatonik James Cheney Yannick Chevalier Yuki Chiba Olaf Chitil Horatiu Cirstea Evelyne Contejean Veronique Cortier Vincent Danos Jeremy Dawson Philippe de Groote Fer-Jan de Vries Stephanie Delaune Kevin Donnelly Dan Dougherty Daniel Dougherty Rachid Echahed Steven Eker Jörg Endrullis Emmanuel Filiot Severine Fratani Laurent Fribourg Carsten Fuhs Thomas Genet Clemens Grabmayer Bernhard Gramlich Yves Guiraud Andrew Haas Makoto Hamana Michael Hanus Hugo Herbelin Nao Hirokawa Clement Houtmann Florent Jacquemard Hélène Kirchner Stefan Kahrs Yukiyoshi Kameyama Yevgeny Kazakov Jeroen Ketema Zurab Khasidashvili Kentaro Kikuchi Vladimir Klebanov Adam Koprowski Martin Korp Sébastien Limet Luigi Liquori Francisco Javier Lopez-Fraguas Salvador Lucas Denis Lugiez Wolfgang Lux Ian Mackie Michael Maher Yitzhak Mandelbaum Claude Marché Mircea Marin Narciso Marti-Oliet Robert McNaughton Catherine Meadows Yasuhiko Minamide Jean-François Monin Pierre-Etienne Moreau Georg Moser Frantisek Mraz Masaki Nakamura Enrica Nicolini Joachim Niehren Naoki Nishida Kazuhiro Ogata Luke Ong David Pichardie Brigitte Pientka Detlef Plump Romain Péchoux Yves RooS Matthias Raffelsieper Pierre Rety

7 Organisation IX Christophe Ringeissen Enric Rodriguez-Carbonell Grigore Rosu Grigore Rosu David Rydeheard Didier Rémy Masahiko Sakai John Sasso Alexis Saurin Manfred Schmidt-Schauss Peter Schneider-Kamp Helmut Seidl Paula Severi Francois-Regis Sinot Christian Sternagel Christoph Sticksel Stephan Swiderski Luc Ségoufin Géraud Sénizergues Toshinori Takai Carolyn Talcott Hendrik Tews René Thiemann Rene Thiemann Wolfgang Thomas Sophie Tison Ashish Tiwari Christian Urban Camille Vacher Steffen van Bakel Vincent van Oostrom Femke van Raamsdonk Lionel Vaux Alicia Villanueva Eelco Visser Uwe Waldmann Johannes Waldmann Christoph Weidenbach Edwin Westbrook Freek Wiedijk Toshiyuki Yamada

8 Table of Contents Modular Termination of Basic Narrowing... 1 María Alpuente, Santiago Escobar, and José Iborra Linear-Algebraic λ-calculus: Higher-Order, Encodings, and Confluence Pablo Arrighi and Gilles Dowek Term-Graph Rewriting Via Explicit Paths Emilie Balland and Pierre-Etienne Moreau Finer Is Better: Abstraction Refinement for Rewriting Approximations Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, and Olga Kouchnarenko A Needed Rewriting Strategy for Data-Structures with Pointers Rachid Echahed and Nicolas Peltier Effectively Checking the Finite Variant Property Santiago Escobar, José Meseguer, and Ralf Sasse Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures Stephan Falke and Deepak Kapur Maximal Termination Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, and Harald Zankl Usable Rules for Context-Sensitive Rewrite Systems Raúl Gutiérrez, Salvador Lucas, and Xavier Urbain Combining Equational Tree Automata over AC and ACI Theories Joe Hendrix and Hitoshi Ohsaki Closure of Hedge-Automata Languages by Hedge Rewriting Florent Jacquemard and Michael Rusinowitch On Normalisation of Infinitary Combinatory Reduction Systems Jeroen Ketema Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems Yoshiharu Kojima and Masahiko Sakai

9 XII Table of Contents Arctic Termination... Below Zero Adam Koprowski and Johannes Waldmann Logics and Automata for Totally Ordered Trees Marco Kuhlmann and Joachim Niehren Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks Yves Lafont and Pierre Rannou Nominal Unification from a Higher-Order Perspective Jordi Levy and Mateu Villaret Functional-Logic Graph Parser Combinators Steffen Mazanek and Mark Minas Proving Quadratic Derivational Complexities Using Context Dependent Interpretations Georg Moser and Andreas Schnabl Tree Automata for Non-linear Arithmetic Naoki Kobayashi and Hitoshi Ohsaki Confluence by Decreasing Diagrams Converted Vincent van Oostrom A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case Manfred Schmidt-Schauss and Elena Machkasova Root-Labeling Christian Sternagel and Aart Middeldorp Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities Sorin Stratulat Deciding Innermost Loops René Thiemann, Jürgen Giesl, and Peter Schneider-Kamp Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations Yoshihito Toyama Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting Kazunori Ueda Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof Christian Urban and Bozhi Zhu

10 Table of Contents XIII Reduction Under Substitution Jörg Endrullis and Roel de Vrijer Normalization of Infinite Terms Hans Zantema Author Index