<h2>LIPIcs, Volume 10, RTA 2011</h2>
<ul>
<li>
<span class="authors">Manfred Schmidt-Schauß</span>
<span class="title">LIPIcs, Volume 10, RTA'11, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011">10.4230/LIPIcs.RTA.2011</a>
</li>
<li>
<span class="authors">Manfred Schmidt-Schauss</span>
<span class="title">Frontmatter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.i">10.4230/LIPIcs.RTA.2011.i</a>
</li>
<li>
<span class="authors">Sophie Tison</span>
<span class="title">Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's New?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.1">10.4230/LIPIcs.RTA.2011.1</a>
</li>
<li>
<span class="authors">Ashish Tiwari</span>
<span class="title">Rewriting in Practice</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.3">10.4230/LIPIcs.RTA.2011.3</a>
</li>
<li>
<span class="authors">Stephanie Weirich</span>
<span class="title">Combining Proofs and Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.9">10.4230/LIPIcs.RTA.2011.9</a>
</li>
<li>
<span class="authors">Bruno Conchinha, David A. Basin, and Carlos Caleiro</span>
<span class="title">FAST: An Efficient Decision Procedure for Deduction and Static Equivalence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.11">10.4230/LIPIcs.RTA.2011.11</a>
</li>
<li>
<span class="authors">Évelyne Contejean, Pierre Courtieu, Julien Forest, Olivier Pons, and Xavier Urbain</span>
<span class="title">Automated Certified Proofs with CiME3</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.21">10.4230/LIPIcs.RTA.2011.21</a>
</li>
<li>
<span class="authors">Francisco Duran, Steven Eker, Santiago Escobar, Jose Meseguer, and Carolyn Talcott</span>
<span class="title">Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.31">10.4230/LIPIcs.RTA.2011.31</a>
</li>
<li>
<span class="authors">Stephan Falke, Deepak Kapur, and Carsten Sinz</span>
<span class="title">Termination Analysis of C Programs Using Compiler Intermediate Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.41">10.4230/LIPIcs.RTA.2011.41</a>
</li>
<li>
<span class="authors">Adrià Gascón, Sebastian Maneth, and Lander Ramos</span>
<span class="title">First-Order Unification on Compressed Terms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.51">10.4230/LIPIcs.RTA.2011.51</a>
</li>
<li>
<span class="authors">Niels Bjørn Bugge Grathwohl, Jeroen Ketema, Jens Duelund Pallesen, and Jakob Grue Simonsen</span>
<span class="title">Anagopos: A Reduction Graph Visualizer for Term Rewriting and Lambda Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.61">10.4230/LIPIcs.RTA.2011.61</a>
</li>
<li>
<span class="authors">Dominik Klein and Nao Hirokawa</span>
<span class="title">Maximal Completion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.71">10.4230/LIPIcs.RTA.2011.71</a>
</li>
<li>
<span class="authors">Kristoffer H. Rose</span>
<span class="title">CRSX - Combinatory Reduction Systems with Extensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.81">10.4230/LIPIcs.RTA.2011.81</a>
</li>
<li>
<span class="authors">Takahito Aoto and Yoshihito Toyama</span>
<span class="title">A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.91">10.4230/LIPIcs.RTA.2011.91</a>
</li>
<li>
<span class="authors">Takahito Aoto, Toshiyuki Yamada, and Yuki Chiba</span>
<span class="title">Natural Inductive Theorems for Higher-Order Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.107">10.4230/LIPIcs.RTA.2011.107</a>
</li>
<li>
<span class="authors">Martin Avanzini, Naohi Eguchi, and Georg Moser</span>
<span class="title">A Path Order for Rewrite Systems that Compute Exponential Time Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.123">10.4230/LIPIcs.RTA.2011.123</a>
</li>
<li>
<span class="authors">Patrick Bahr</span>
<span class="title">Modes of Convergence for Term Graph Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.139">10.4230/LIPIcs.RTA.2011.139</a>
</li>
<li>
<span class="authors">Marc Brockschmidt, Carsten Otto, and Jürgen Giesl</span>
<span class="title">Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.155">10.4230/LIPIcs.RTA.2011.155</a>
</li>
<li>
<span class="authors">Roberto Bruttomesso, Silvio Ghilardi, and Silvio Ranise</span>
<span class="title">Rewriting-based Quantifier-free Interpolation for a Theory of Arrays</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.171">10.4230/LIPIcs.RTA.2011.171</a>
</li>
<li>
<span class="authors">Jonathan Kochems and C.H. Luke Ong</span>
<span class="title">Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.187">10.4230/LIPIcs.RTA.2011.187</a>
</li>
<li>
<span class="authors">Cynthia Kop and Femke van Raamsdonk</span>
<span class="title">Higher Order Dependency Pairs for Algebraic Functional Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.203">10.4230/LIPIcs.RTA.2011.203</a>
</li>
<li>
<span class="authors">Temur Kutsia, Jordi Levy, and Mateu Villaret</span>
<span class="title">Anti-Unification for Unranked Terms and Hedges</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.219">10.4230/LIPIcs.RTA.2011.219</a>
</li>
<li>
<span class="authors">Georg Moser and Andreas Schnabl</span>
<span class="title">Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.235">10.4230/LIPIcs.RTA.2011.235</a>
</li>
<li>
<span class="authors">Friedrich Neurauter and Aart Middeldorp</span>
<span class="title">Revisiting Matrix Interpretations for Proving Termination of Term Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.251">10.4230/LIPIcs.RTA.2011.251</a>
</li>
<li>
<span class="authors">Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe</span>
<span class="title">Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.267">10.4230/LIPIcs.RTA.2011.267</a>
</li>
<li>
<span class="authors">Naoki Nishida and German Vidal</span>
<span class="title">Program Inversion for Tail Recursive Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.283">10.4230/LIPIcs.RTA.2011.283</a>
</li>
<li>
<span class="authors">Cody Roux</span>
<span class="title">Refinement Types as Higher-Order Dependency Pairs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.299">10.4230/LIPIcs.RTA.2011.299</a>
</li>
<li>
<span class="authors">Paula Severi and Fer-Jan de Vries</span>
<span class="title">Weakening the Axiom of Overlap in Infinitary Lambda Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.313">10.4230/LIPIcs.RTA.2011.313</a>
</li>
<li>
<span class="authors">Christian Sternagel and René Thiemann</span>
<span class="title">Modular and Certified Semantic Labeling and Unlabeling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.329">10.4230/LIPIcs.RTA.2011.329</a>
</li>
<li>
<span class="authors">Aaron Stump, Garrin Kimmell, and Roba El Haj Omar</span>
<span class="title">Type Preservation as a Confluence Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.345">10.4230/LIPIcs.RTA.2011.345</a>
</li>
<li>
<span class="authors">Irène Durand and Marc Sylvestre</span>
<span class="title">Left-linear Bounded TRSs are Inverse Recognizability Preserving</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.361">10.4230/LIPIcs.RTA.2011.361</a>
</li>
<li>
<span class="authors">Harald Zankl, Bertram Felgenhauer, and Aart Middeldorp</span>
<span class="title">Labelings for Decreasing Diagrams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.377">10.4230/LIPIcs.RTA.2011.377</a>
</li>
<li>
<span class="authors">Hans Zantema and Joerg Endrullis</span>
<span class="title">Proving Equality of Streams Automatically</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.RTA.2011.393">10.4230/LIPIcs.RTA.2011.393</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