@InProceedings{AlpuenteEI-RTA08,
  author    = {Mar\'{\i}a Alpuente and
               Santiago Escobar and
               Jos{\'e} Iborra},
  title     = {{Modular Termination of Basic Narrowing}},
  pages     = {1-16},
  crossref  = {RTA08},
}
@InProceedings{ArrighiD-RTA08,
  author    = {Pablo Arrighi and
               Gilles Dowek},
  title     = {{Linear-algebraic lambda-calculus: higher-order, encodings,
               and confluence}},
  pages     = {17-31},
  crossref  = {RTA08},
}
@InProceedings{BallandM-RTA08,
  author    = {Emilie Balland and
               Pierre-Etienne Moreau},
  title     = {{Term-Graph Rewriting Via Explicit Paths}},
  pages     = {32-47},
  crossref  = {RTA08},
}
@InProceedings{BoichutCHK-RTA08,
  author    = {Yohan Boichut and
               Rom{\'e}o Courbis and
               Pierre-Cyrille H{\'e}am and
               Olga Kouchnarenko},
  title     = {{Finer Is Better: Abstraction Refinement for Rewriting Approximations}},
  pages     = {48-62},
  crossref  = {RTA08},
}
@InProceedings{EchahedP-RTA08,
  author    = {Rachid Echahed and
               Nicolas Peltier},
  title     = {{A Needed Rewriting Strategy for Data-Structures with Pointers}},
  pages     = {63-78},
  crossref  = {RTA08},
}
@InProceedings{EscobarMS-RTA08,
  author    = {Santiago Escobar and
               Jos{\'e} Meseguer and
               Ralf Sasse},
  title     = {{Effectively Checking the Finite Variant Property}},
  pages     = {79-93},
  crossref  = {RTA08},
}
@InProceedings{FalkeK-RTA08,
  author    = {Stephan Falke and
               Deepak Kapur},
  title     = {{Dependency Pairs for Rewriting with Built-In Numbers and
               Semantic Data Structures}},
  pages     = {94-109},
  crossref  = {RTA08},
}
@InProceedings{FuhsGMSTZ-RTA08,
  author    = {Carsten Fuhs and
               J{\"u}rgen Giesl and
               Aart Middeldorp and
               Peter Schneider-Kamp and
               Ren{\'e} Thiemann and
               Harald Zankl},
  title     = {{Maximal Termination}},
  pages     = {110-125},
  crossref  = {RTA08},
}
@InProceedings{GutierrezLU-RTA08,
  author    = {Ra{\'u}l Guti{\'e}rrez and
               Salvador Lucas and
               Xavier Urbain},
  title     = {{Usable Rules for Context-Sensitive Rewrite Systems}},
  pages     = {126-141},
  crossref  = {RTA08},
}
@InProceedings{HendrixO-RTA08,
  author    = {Joe Hendrix and
               Hitoshi Ohsaki},
  title     = {{Combining Equational Tree Automata over AC and ACI Theories}},
  pages     = {142-156},
  crossref  = {RTA08},
}
@InProceedings{JacquemardR-RTA08,
  author    = {Florent Jacquemard and
               Micha{\"e}l Rusinowitch},
  title     = {{Closure of Hedge-Automata Languages by Hedge Rewriting}},
  pages     = {157-171},
  crossref  = {RTA08},
}
@InProceedings{Ketema-RTA08,
  author    = {Jeroen Ketema},
  title     = {{On Normalisation of Infinitary Combinatory Reduction Systems}},
  pages     = {172-186},
  crossref  = {RTA08},
}
@InProceedings{KojimaS-RTA08,
  author    = {Yoshiharu Kojima and
               Masahiko Sakai},
  title     = {{Innermost Reachability and Context Sensitive Reachability
               Properties Are Decidable for Linear Right-Shallow Term Rewriting
               Systems}},
  pages     = {187-201},
  crossref  = {RTA08},
}
@InProceedings{KoprowskiW-RTA08,
  author    = {Adam Koprowski and
               Johannes Waldmann},
  title     = {{Arctic Termination ...Below Zero}},
  pages     = {202-216},
  crossref  = {RTA08},
}
@InProceedings{KuhlmannN-RTA08,
  author    = {Marco Kuhlmann and
               Joachim Niehren},
  title     = {{Logics and Automata for Totally Ordered Trees}},
  pages     = {217-231},
  crossref  = {RTA08},
}
@InProceedings{LafontR-RTA08,
  author    = {Yves Lafont and
               Pierre Rannou},
  title     = {{Diagram Rewriting for Orthogonal Matrices: A Study of Critical
               Peaks}},
  pages     = {232-245},
  crossref  = {RTA08},
}
@InProceedings{LevyV-RTA08,
  author    = {Jordi Levy and
               Mateu Villaret},
  title     = {{Nominal Unification from a Higher-Order Perspective}},
  pages     = {246-260},
  crossref  = {RTA08},
}
@InProceedings{MazanekM-RTA08,
  author    = {Steffen Mazanek and
               Mark Minas},
  title     = {{Functional-Logic Graph Parser Combinators}},
  pages     = {261-275},
  crossref  = {RTA08},
}
@InProceedings{MoserS-RTA08,
  author    = {Georg Moser and
               Andreas Schnabl},
  title     = {{Proving Quadratic Derivational Complexities Using Context
               Dependent Interpretations}},
  pages     = {276-290},
  crossref  = {RTA08},
}
@InProceedings{KobayashiO-RTA08,
  author    = {Naoki Kobayashi and
               Hitoshi Ohsaki},
  title     = {{Tree Automata for Non-linear Arithmetic}},
  pages     = {291-305},
  crossref  = {RTA08},
}
@InProceedings{Oostrom-RTA08,
  author    = {Vincent van Oostrom},
  title     = {{Confluence by Decreasing Diagrams}},
  pages     = {306-320},
  crossref  = {RTA08},
}
@InProceedings{Schmidt-SchaussM-RTA08,
  author    = {Manfred Schmidt-Schau{\ss} and
               Elena Machkasova},
  title     = {{A Finite Simulation Method in a Non-deterministic Call-by-Need
               Lambda-Calculus with Letrec, Constructors, and Case}},
  pages     = {321-335},
  crossref  = {RTA08},
}
@InProceedings{SternagelM-RTA08,
  author    = {Christian Sternagel and
               Aart Middeldorp},
  title     = {{Root-Labeling}},
  pages     = {336-350},
  crossref  = {RTA08},
}
@InProceedings{Stratulat-RTA08,
  author    = {Sorin Stratulat},
  title     = {{Combining Rewriting with Noetherian Induction to Reason
               on Non-orientable Equalities}},
  pages     = {351-365},
  crossref  = {RTA08},
}
@InProceedings{ThiemannGS-RTA08,
  author    = {Ren{\'e} Thiemann and
               J{\"u}rgen Giesl and
               Peter Schneider-Kamp},
  title     = {{Deciding Innermost Loops}},
  pages     = {366-380},
  crossref  = {RTA08},
}
@InProceedings{Toyama-RTA08,
  author    = {Yoshihito Toyama},
  title     = {{Termination Proof of S-Expression Rewriting Systems with
               Recursive Path Relations}},
  pages     = {381-391},
  crossref  = {RTA08},
}
@InProceedings{Ueda-RTA08,
  author    = {Kazunori Ueda},
  title     = {{Encoding the Pure Lambda Calculus into Hierarchical Graph
               Rewriting}},
  pages     = {392-408},
  crossref  = {RTA08},
}
@InProceedings{UrbanZ-RTA08,
  author    = {Christian Urban and
               Bozhi Zhu},
  title     = {{Revisiting Cut-Elimination: One Difficult Proof Is Really
               a Proof}},
  pages     = {409-424},
  crossref  = {RTA08},
}
@InProceedings{EndrullisV-RTA08,
  author    = {J{\"o}rg Endrullis and
               Roel C. de Vrijer},
  title     = {{Reduction Under Substitution}},
  pages     = {425-440},
  crossref  = {RTA08},
}
@InProceedings{Zantema-RTA08,
  author    = {Hans Zantema},
  title     = {{Normalization of Infinite Terms}},
  pages     = {441-455},
  crossref  = {RTA08},
}

% CROSSREFERENCES
% These must remain at the end of this file.

@Proceedings{RTA08,
  editor    = {Andrei Voronkov},
  title     = {{Rewriting Techniques and Applications, 19th International
               Conference, RTA 2008}},
  address   = {Hagenberg, Austria},
  booktitle = {{Rewriting Techniques and Applications, 19th International
               Conference, RTA 2008}},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {5117},
  year      = {2008},
  month     = jul # {~15-17,},
  isbn      = {978-3-540-70588-8},
}