RTA 2012 - 23rd International Conference on Rewriting Techniques and Applications

RTA 2012 - 23rd International Conference on Rewriting Techniques and Applications

  Monday, May 28, 2012 to Saturday, June 2, 2012
  Nagoya, Japan


Accepted Papers

Manfred Schmidt-Schauss. Matching of Compressed Patterns with Character-Variables
Eduardo Bonelli, Carlos Lombardi, Delia Kesner and Alejandro Ríos. Normalisation for Dynamic Pattern Calculi
Patrick Bahr. Infinitary Term Graph Rewriting is Simple, Sound and Complete
Carles Creus, Adrià Gascón and Guillem Godoy. One-context Unification with STG-Compressed Terms is in NP
Thibaut Balabonski. Axiomatic Sharing-via-Labelling
Vincent van Oostrom and Hans Zantema. Triangulation in rewriting
Beniamino Accattoli and Ugo Dal Lago. On the Invariance of Derivational Complexity for Head Reduction
Carolyn Talcott, Vivek Nigam, Andre Scedrov, Tajana Ban Kirigin, Max Kanovich and Ranko Perovic. A Rewriting Framework for Activities Subject to Regulations
Carsten Fuhs and Cynthia Kop. Polynomial Interpretations for Higher-Order Rewriting
Kazushige Terui. Semantic evaluation, intersection types and the complexity of simply typed lambda calculus
Alexei Lisitsa. Finite models vs tree automata in safety verification
Karl Gmeiner, Bernhard Gramlich and Felix Schernhammer. On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems
René Thiemann, Guillaume Allais and Julian Nagele. On the formalization of termination techniques based on multiset orderings
Søren Bjerg Andersen and Jakob Grue Simonsen. Term Rewriting Systems as Topological Dynamical Systems
Nathalie Bertrand, Giorgio Delzanno, Barbara König, Arnaud Sangnier and Jan Stückrath. On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
Christian Sattler and Florent Balestrieri. Turing-Completeness of Polymorphic Stream Equation Systems
Jeroen Ketema. Reinterpreting Compression in Infinitary Rewriting
Beniamino Accattoli. An abstract factorization theorem for explicit substitutions calculi
Denis Cousineau and Olivier Hermant. A semantic proof that reducibility candidates entail cut elimination
Paula Severi and Fer-Jan de Vries. Meaninglessness for Combinatory Logic
Osama Al-Hassani, Quratul-Ain Mahesar, Claudio Sacerdoti Coen and Volker Sorge. A Term Rewriting System for Kuratowski's Closure-Complement Problem
Bertram Felgenhauer. Deciding Confluence of Ground Term Rewrite Systems in Cubic Time