LIPIcs, Volume 36, RTA 2015

• Maribel Fernández LIPIcs, Volume 36, RTA'15, Complete Volume 10.4230/LIPIcs.RTA.2015
• Maribel Fernández Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.RTA.2015.i
• Hélène Kirchner Port Graphs, Rules and Strategies for Dynamic Data Analytics - Extended Abstract (Invited Talk) 10.4230/LIPIcs.RTA.2015.1
• Grigore Rosu Matching Logic - Extended Abstract (Invited Talk) 10.4230/LIPIcs.RTA.2015.5
• Carolyn Talcott Executable Formal Models in Rewriting Logic (Invited Talk) 10.4230/LIPIcs.RTA.2015.22
• Martin Avanzini, Christian Sternagel, and René Thiemann Certification of Complexity Proofs using CeTA 10.4230/LIPIcs.RTA.2015.23
• Franz Baader, Stefan Borgwardt, and Barbara Morawska Dismatching and Local Disunification in EL 10.4230/LIPIcs.RTA.2015.40
• Alexander Baumgartner, Temur Kutsia, Jordi Levy, and Mateu Villaret Nominal Anti-Unification 10.4230/LIPIcs.RTA.2015.57
• Horatiu Cirstea, Serguei Lenglet, and Pierre-Etienne Moreau A faithful encoding of programmable strategies into term rewriting systems 10.4230/LIPIcs.RTA.2015.74
• Florence Clerc and Samuel Mimram Presenting a Category Modulo a Rewriting System 10.4230/LIPIcs.RTA.2015.89
• Lukasz Czajka Confluence of nearly orthogonal infinitary term rewriting systems 10.4230/LIPIcs.RTA.2015.106
• Anupam Das and Lutz Straßburger No complete linear term rewriting system for propositional logic 10.4230/LIPIcs.RTA.2015.127
• Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, and Alexandra Silva A Coinductive Framework for Infinitary Rewriting and Equational Reasoning 10.4230/LIPIcs.RTA.2015.143
• Jörg Endrullis and Hans Zantema Proving non-termination by finite automata 10.4230/LIPIcs.RTA.2015.160
• Thomas Genet and Yann Salmon Reachability Analysis of Innermost Rewriting 10.4230/LIPIcs.RTA.2015.177
• Lars Hellström Network Rewriting II: Bi- and Hopf Algebras 10.4230/LIPIcs.RTA.2015.194
• Nao Hirokawa, Aart Middeldorp, and Georg Moser Leftmost Outermost Revisited 10.4230/LIPIcs.RTA.2015.209
• Cynthia Kop, Aart Middeldorp, and Thomas Sternagel Conditional Complexity 10.4230/LIPIcs.RTA.2015.223
• Ilias Kotsireas, Temur Kutsia, and Dimitris E. Simos Constructing Orthogonal Designs in Powers of Two: Gröbner Bases Meet Equational Unification 10.4230/LIPIcs.RTA.2015.241
• Julian Nagele, Bertram Felgenhauer, and Aart Middeldorp Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules 10.4230/LIPIcs.RTA.2015.257
• Julian Nagele and Harald Zankl Certified Rule Labeling 10.4230/LIPIcs.RTA.2015.269
• David Sabel and Hans Zantema Transforming Cycle Rewriting into String Rewriting 10.4230/LIPIcs.RTA.2015.285
• Takaki Suzuki, Kentaro Kikuchi, Takahito Aoto, and Yoshihito Toyama Confluence of Orthogonal Nominal Rewriting Systems Revisited 10.4230/LIPIcs.RTA.2015.301
• Johannes Waldmann Matrix Interpretations on Polyhedral Domains 10.4230/LIPIcs.RTA.2015.318
• Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, and Thomas Ströder Inferring Lower Bounds for Runtime Complexity 10.4230/LIPIcs.RTA.2015.334
• Markus Lepper and Baltasar Trancón y Widemann A Simple and Efficient Step Towards Type-Correct XSLT Transformations 10.4230/LIPIcs.RTA.2015.350
• Vlad Vergu, Pierre Neron, and Eelco Visser DynSem: A DSL for Dynamic Semantics Specification 10.4230/LIPIcs.RTA.2015.365