<h2>LIPIcs, Volume 36, RTA 2015</h2>
<ul>
<li>
<span class="authors">Maribel Fernández</span>
<span class="title">LIPIcs, Volume 36, RTA'15, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015">10.4230/LIPIcs.RTA.2015</a>
</li>
<li>
<span class="authors">Maribel Fernández</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.i">10.4230/LIPIcs.RTA.2015.i</a>
</li>
<li>
<span class="authors">Hélène Kirchner</span>
<span class="title">Port Graphs, Rules and Strategies for Dynamic Data Analytics - Extended Abstract (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.1">10.4230/LIPIcs.RTA.2015.1</a>
</li>
<li>
<span class="authors">Grigore Rosu</span>
<span class="title">Matching Logic - Extended Abstract (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.5">10.4230/LIPIcs.RTA.2015.5</a>
</li>
<li>
<span class="authors">Carolyn Talcott</span>
<span class="title">Executable Formal Models in Rewriting Logic (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.22">10.4230/LIPIcs.RTA.2015.22</a>
</li>
<li>
<span class="authors">Martin Avanzini, Christian Sternagel, and René Thiemann</span>
<span class="title">Certification of Complexity Proofs using CeTA</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.23">10.4230/LIPIcs.RTA.2015.23</a>
</li>
<li>
<span class="authors">Franz Baader, Stefan Borgwardt, and Barbara Morawska</span>
<span class="title">Dismatching and Local Disunification in EL</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.40">10.4230/LIPIcs.RTA.2015.40</a>
</li>
<li>
<span class="authors">Alexander Baumgartner, Temur Kutsia, Jordi Levy, and Mateu Villaret</span>
<span class="title">Nominal Anti-Unification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.57">10.4230/LIPIcs.RTA.2015.57</a>
</li>
<li>
<span class="authors">Horatiu Cirstea, Serguei Lenglet, and Pierre-Etienne Moreau</span>
<span class="title">A faithful encoding of programmable strategies into term rewriting systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.74">10.4230/LIPIcs.RTA.2015.74</a>
</li>
<li>
<span class="authors">Florence Clerc and Samuel Mimram</span>
<span class="title">Presenting a Category Modulo a Rewriting System</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.89">10.4230/LIPIcs.RTA.2015.89</a>
</li>
<li>
<span class="authors">Lukasz Czajka</span>
<span class="title">Confluence of nearly orthogonal infinitary term rewriting systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.106">10.4230/LIPIcs.RTA.2015.106</a>
</li>
<li>
<span class="authors">Anupam Das and Lutz Straßburger</span>
<span class="title">No complete linear term rewriting system for propositional logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.127">10.4230/LIPIcs.RTA.2015.127</a>
</li>
<li>
<span class="authors">Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, and Alexandra Silva</span>
<span class="title">A Coinductive Framework for Infinitary Rewriting and Equational Reasoning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.143">10.4230/LIPIcs.RTA.2015.143</a>
</li>
<li>
<span class="authors">Jörg Endrullis and Hans Zantema</span>
<span class="title">Proving non-termination by finite automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.160">10.4230/LIPIcs.RTA.2015.160</a>
</li>
<li>
<span class="authors">Thomas Genet and Yann Salmon</span>
<span class="title">Reachability Analysis of Innermost Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.177">10.4230/LIPIcs.RTA.2015.177</a>
</li>
<li>
<span class="authors">Lars Hellström</span>
<span class="title">Network Rewriting II: Bi- and Hopf Algebras</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.194">10.4230/LIPIcs.RTA.2015.194</a>
</li>
<li>
<span class="authors">Nao Hirokawa, Aart Middeldorp, and Georg Moser</span>
<span class="title">Leftmost Outermost Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.209">10.4230/LIPIcs.RTA.2015.209</a>
</li>
<li>
<span class="authors">Cynthia Kop, Aart Middeldorp, and Thomas Sternagel</span>
<span class="title">Conditional Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.223">10.4230/LIPIcs.RTA.2015.223</a>
</li>
<li>
<span class="authors">Ilias Kotsireas, Temur Kutsia, and Dimitris E. Simos</span>
<span class="title">Constructing Orthogonal Designs in Powers of Two: Gröbner Bases Meet Equational Unification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.241">10.4230/LIPIcs.RTA.2015.241</a>
</li>
<li>
<span class="authors">Julian Nagele, Bertram Felgenhauer, and Aart Middeldorp</span>
<span class="title">Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.257">10.4230/LIPIcs.RTA.2015.257</a>
</li>
<li>
<span class="authors">Julian Nagele and Harald Zankl</span>
<span class="title">Certified Rule Labeling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.269">10.4230/LIPIcs.RTA.2015.269</a>
</li>
<li>
<span class="authors">David Sabel and Hans Zantema</span>
<span class="title">Transforming Cycle Rewriting into String Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.285">10.4230/LIPIcs.RTA.2015.285</a>
</li>
<li>
<span class="authors">Takaki Suzuki, Kentaro Kikuchi, Takahito Aoto, and Yoshihito Toyama</span>
<span class="title">Confluence of Orthogonal Nominal Rewriting Systems Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.301">10.4230/LIPIcs.RTA.2015.301</a>
</li>
<li>
<span class="authors">Johannes Waldmann</span>
<span class="title">Matrix Interpretations on Polyhedral Domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.318">10.4230/LIPIcs.RTA.2015.318</a>
</li>
<li>
<span class="authors">Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, and Thomas Ströder</span>
<span class="title">Inferring Lower Bounds for Runtime Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.334">10.4230/LIPIcs.RTA.2015.334</a>
</li>
<li>
<span class="authors">Markus Lepper and Baltasar Trancón y Widemann</span>
<span class="title">A Simple and Efficient Step Towards Type-Correct XSLT Transformations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.350">10.4230/LIPIcs.RTA.2015.350</a>
</li>
<li>
<span class="authors">Vlad Vergu, Pierre Neron, and Eelco Visser</span>
<span class="title">DynSem: A DSL for Dynamic Semantics Specification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2015.365">10.4230/LIPIcs.RTA.2015.365</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing