LIPIcs, Volume 10, RTA 2011

• Manfred Schmidt-Schauß LIPIcs, Volume 10, RTA'11, Complete Volume 10.4230/LIPIcs.RTA.2011
• Manfred Schmidt-Schauss Frontmatter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.RTA.2011.i
• Sophie Tison Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's New? 10.4230/LIPIcs.RTA.2011.1
• Ashish Tiwari Rewriting in Practice 10.4230/LIPIcs.RTA.2011.3
• Stephanie Weirich Combining Proofs and Programs 10.4230/LIPIcs.RTA.2011.9
• Bruno Conchinha, David A. Basin, and Carlos Caleiro FAST: An Efficient Decision Procedure for Deduction and Static Equivalence 10.4230/LIPIcs.RTA.2011.11
• Évelyne Contejean, Pierre Courtieu, Julien Forest, Olivier Pons, and Xavier Urbain Automated Certified Proofs with CiME3 10.4230/LIPIcs.RTA.2011.21
• Francisco Duran, Steven Eker, Santiago Escobar, Jose Meseguer, and Carolyn Talcott Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6 10.4230/LIPIcs.RTA.2011.31
• Stephan Falke, Deepak Kapur, and Carsten Sinz Termination Analysis of C Programs Using Compiler Intermediate Languages 10.4230/LIPIcs.RTA.2011.41
• Adrià Gascón, Sebastian Maneth, and Lander Ramos First-Order Unification on Compressed Terms 10.4230/LIPIcs.RTA.2011.51
• Niels Bjørn Bugge Grathwohl, Jeroen Ketema, Jens Duelund Pallesen, and Jakob Grue Simonsen Anagopos: A Reduction Graph Visualizer for Term Rewriting and Lambda Calculus 10.4230/LIPIcs.RTA.2011.61
• Dominik Klein and Nao Hirokawa Maximal Completion 10.4230/LIPIcs.RTA.2011.71
• Kristoffer H. Rose CRSX - Combinatory Reduction Systems with Extensions 10.4230/LIPIcs.RTA.2011.81
• Takahito Aoto and Yoshihito Toyama A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems 10.4230/LIPIcs.RTA.2011.91
• Takahito Aoto, Toshiyuki Yamada, and Yuki Chiba Natural Inductive Theorems for Higher-Order Rewriting 10.4230/LIPIcs.RTA.2011.107
• Martin Avanzini, Naohi Eguchi, and Georg Moser A Path Order for Rewrite Systems that Compute Exponential Time Functions 10.4230/LIPIcs.RTA.2011.123
• Patrick Bahr Modes of Convergence for Term Graph Rewriting 10.4230/LIPIcs.RTA.2011.139
• Marc Brockschmidt, Carsten Otto, and Jürgen Giesl Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting 10.4230/LIPIcs.RTA.2011.155
• Roberto Bruttomesso, Silvio Ghilardi, and Silvio Ranise Rewriting-based Quantifier-free Interpolation for a Theory of Arrays 10.4230/LIPIcs.RTA.2011.171
• Jonathan Kochems and C.H. Luke Ong Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars 10.4230/LIPIcs.RTA.2011.187
• Cynthia Kop and Femke van Raamsdonk Higher Order Dependency Pairs for Algebraic Functional Systems 10.4230/LIPIcs.RTA.2011.203
• Temur Kutsia, Jordi Levy, and Mateu Villaret Anti-Unification for Unranked Terms and Hedges 10.4230/LIPIcs.RTA.2011.219
• Georg Moser and Andreas Schnabl Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity 10.4230/LIPIcs.RTA.2011.235
• Friedrich Neurauter and Aart Middeldorp Revisiting Matrix Interpretations for Proving Termination of Term Rewriting 10.4230/LIPIcs.RTA.2011.251
• Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity 10.4230/LIPIcs.RTA.2011.267
• Naoki Nishida and German Vidal Program Inversion for Tail Recursive Functions 10.4230/LIPIcs.RTA.2011.283
• Cody Roux Refinement Types as Higher-Order Dependency Pairs 10.4230/LIPIcs.RTA.2011.299
• Paula Severi and Fer-Jan de Vries Weakening the Axiom of Overlap in Infinitary Lambda Calculus 10.4230/LIPIcs.RTA.2011.313
• Christian Sternagel and René Thiemann Modular and Certified Semantic Labeling and Unlabeling 10.4230/LIPIcs.RTA.2011.329
• Aaron Stump, Garrin Kimmell, and Roba El Haj Omar Type Preservation as a Confluence Problem 10.4230/LIPIcs.RTA.2011.345
• Irène Durand and Marc Sylvestre Left-linear Bounded TRSs are Inverse Recognizability Preserving 10.4230/LIPIcs.RTA.2011.361
• Harald Zankl, Bertram Felgenhauer, and Aart Middeldorp Labelings for Decreasing Diagrams 10.4230/LIPIcs.RTA.2011.377
• Hans Zantema and Joerg Endrullis Proving Equality of Streams Automatically 10.4230/LIPIcs.RTA.2011.393