LIPIcs, Volume 15, RTA 2012

• Ashish Tiwari LIPIcs, Volume 15, RTA'12, Complete Volume 10.4230/LIPIcs.RTA.2012
• Ashish Tiwari RTA 2012 Proceedings Frontmatter 10.4230/LIPIcs.RTA.2012.i
• Hirokazu Anai Computational Real Algebraic Geometry in Practice (Invited Talk) 10.4230/LIPIcs.RTA.2012.1
• Claude Kirchner Rho-Calculi for Computation and Logic (Invited Talk) 10.4230/LIPIcs.RTA.2012.2
• Sebastian Maneth Dictionary-Based Tree Compression (Invited Talk) 10.4230/LIPIcs.RTA.2012.5
• Beniamino Accattoli An Abstract Factorization Theorem for Explicit Substitutions 10.4230/LIPIcs.RTA.2012.6
• Beniamino Accattoli and Ugo Dal Lago On the Invariance of the Unitary Cost Model for Head Reduction 10.4230/LIPIcs.RTA.2012.22
• Osama Al-Hassani, Quratul-ain Mahesar, Claudio Sacerdoti Coen, and Volker Sorge A Term Rewriting System for Kuratowski's Closure-Complement Problem 10.4230/LIPIcs.RTA.2012.38
• Soren Bjerg Andersen and Jakob Grue Simonsen Term Rewriting Systems as Topological Dynamical Systems 10.4230/LIPIcs.RTA.2012.53
• Patrick Bahr Infinitary Term Graph Rewriting is Simple, Sound and Complete 10.4230/LIPIcs.RTA.2012.69
• Thibaut Balabonski Axiomatic Sharing-via-Labelling 10.4230/LIPIcs.RTA.2012.85
• 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 10.4230/LIPIcs.RTA.2012.101
• Eduardo Bonelli, Delia Kesner, Carlos Lombardi, and Alejandro Rios Normalisation for Dynamic Pattern Calculi 10.4230/LIPIcs.RTA.2012.117
• Denis Cousineau and Olivier Hermant A Semantic Proof that Reducibility Candidates entail Cut Elimination 10.4230/LIPIcs.RTA.2012.133
• Carles Creus, Adria Gascon, and Guillem Godoy One-context Unification with STG-Compressed Terms is in NP 10.4230/LIPIcs.RTA.2012.149
• Bertram Felgenhauer Deciding Confluence of Ground Term Rewrite Systems in Cubic Time 10.4230/LIPIcs.RTA.2012.165
• Carsten Fuhs and Cynthia Kop Polynomial Interpretations for Higher-Order Rewriting 10.4230/LIPIcs.RTA.2012.176
• Karl Gmeiner, Bernhard Gramlich, and Felix Schernhammer On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems 10.4230/LIPIcs.RTA.2012.193
• Jeroen Ketema Reinterpreting Compression in Infinitary Rewriting 10.4230/LIPIcs.RTA.2012.209
• Alexei Lisitsa Finite Models vs Tree Automata in Safety Verification 10.4230/LIPIcs.RTA.2012.225
• Vincent van Oostrom and Hans Zantema Triangulation in Rewriting 10.4230/LIPIcs.RTA.2012.240
• Christian Sattler and Florent Balestrieri Turing-Completeness of Polymorphic Stream Equation Systems 10.4230/LIPIcs.RTA.2012.256
• Manfred Schmidt-Schauß Matching of Compressed Patterns with Character-Variables 10.4230/LIPIcs.RTA.2012.272
• Paula Severi and Fer-Jan de Vries Meaningless Sets in Infinitary Combinatory Logic 10.4230/LIPIcs.RTA.2012.288
• Max Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn Talcott, and Ranko Perovic A Rewriting Framework for Activities Subject to Regulations 10.4230/LIPIcs.RTA.2012.305
• Kazushige Terui Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus 10.4230/LIPIcs.RTA.2012.323
• René Thiemann, Guillaume Allais, and Julian Nagele On the Formalization of Termination Techniques based on Multiset Orderings 10.4230/LIPIcs.RTA.2012.339