RTA 2012 Accepted Papers
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
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
Kazushige Terui.
Semantic evaluation, intersection types and the complexity of simply typed lambda calculus
Alexei Lisitsa.
Finite models vs tree automata in safety verification
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
Jeroen Ketema.
Reinterpreting Compression in Infinitary Rewriting
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