22. RTA 2011: Novi Sad, Serbia

• Manfred Schmidt-Schauß:
  Frontmatter, Table of Contents, Preface, Conference Organization. i-xvi
  
• Sophie Tison:
  Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's New?. 1-2
  
• Ashish Tiwari:
  Rewriting in Practice. 3-8
  
• Stephanie Weirich:
  Combining Proofs and Programs. 9-9
  
• Bruno Conchinha, David A. Basin, Carlos Caleiro:
  FAST: An Efficient Decision Procedure for Deduction and Static Equivalence. 11-20
  
• Evelyne Contejean, Pierre Courtieu, Julien Forest, Olivier Pons, Xavier Urbain:
  Automated Certified Proofs with CiME3. 21-30
  
• Francisco Durán, Steven Eker, Santiago Escobar, José Meseguer, Carolyn L. Talcott:
  Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6. 31-40
  
• Stephan Falke, Deepak Kapur, Carsten Sinz:
  Termination Analysis of C Programs Using Compiler Intermediate Languages. 41-50
  
• Adria Gascón, Sebastian Maneth, Lander Ramos:
  First-Order Unification on Compressed Terms. 51-60
  
• Niels Bjørn Bugge Grathwohl, Jeroen Ketema, Jens Duelund Pallesen, Jakob Grue Simonsen:
  Anagopos: A Reduction Graph Visualizer for Term Rewriting and Lambda Calculus. 61-70
  
• Dominik Klein, Nao Hirokawa:
  Maximal Completion. 71-80
  
• Kristoffer H. Rose:
  CRSX - Combinatory Reduction Systems with Extensions. 81-90
  
• Takahito Aoto, Yoshihito Toyama:
  A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems. 91-106
  
• Takahito Aoto, Toshiyuki Yamada, Yuki Chiba:
  Natural Inductive Theorems for Higher-Order Rewriting. 107-121
  
• Martin Avanzini, Naohi Eguchi, Georg Moser:
  A Path Order for Rewrite Systems that Compute Exponential Time Functions. 123-138
  
• Patrick Bahr:
  Modes of Convergence for Term Graph Rewriting. 139-154
  
• Marc Brockschmidt, Carsten Otto, Jürgen Giesl:
  Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting. 155-170
  
• Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise:
  Rewriting-based Quantifier-free Interpolation for a Theory of Arrays. 171-186
  
• Jonathan Kochems, C.-H. Luke Ong:
  Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars. 187-202
  
• Cynthia Kop, Femke van Raamsdonk:
  Higher Order Dependency Pairs for Algebraic Functional Systems. 203-218
  
• Temur Kutsia, Jordi Levy, Mateu Villaret:
  Anti-Unification for Unranked Terms and Hedges. 219-234
  
• Georg Moser, Andreas Schnabl:
  Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity. 235-250
  
• Friedrich Neurauter, Aart Middeldorp:
  Revisiting Matrix Interpretations for Proving Termination of Term Rewriting. 251-266
  
• Naoki Nishida, Masahiko Sakai, Toshiki Sakabe:
  Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity. 267-282
  
• Naoki Nishida, Germán Vidal:
  Program Inversion for Tail Recursive Functions. 283-298
  
• Cody Roux:
  Refinement Types as Higher-Order Dependency Pairs. 299-312
  
• Paula Severi, Fer-Jan de Vries:
  Weakening the Axiom of Overlap in Infinitary Lambda Calculus. 313-328
  
• Christian Sternagel, René Thiemann:
  Modular and Certified Semantic Labeling and Unlabeling. 329-344
  
• Aaron Stump, Garrin Kimmell, Roba El Haj Omar:
  Type Preservation as a Confluence Problem. 345-360
  
• Irène Durand, Marc Sylvestre:
  Left-linear Bounded TRSs are Inverse Recognizability Preserving. 361-376
  
• Harald Zankl, Bertram Felgenhauer, Aart Middeldorp:
  Labelings for Decreasing Diagrams. 377-392
  
• Hans Zantema, Jörg Endrullis:
  Proving Equality of Streams Automatically. 393-408
  

Last update Tue May 21 17:55:23 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page