default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th RTA 2015: Warsaw, Poland
- Maribel Fernández:
26th International Conference on Rewriting Techniques and Applications, RTA 2015, June 29 to July 1, 2015, Warsaw, Poland. LIPIcs 36, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-85-9 - Front Matter, Table of Contents, Preface, Conference Organization. i-xiv
- Hélène Kirchner:
Port Graphs, Rules and Strategies for Dynamic Data Analytics - Extended Abstract (Invited Talk). 1-4 - Grigore Rosu:
Matching Logic - Extended Abstract (Invited Talk). 5-21 - Carolyn L. Talcott:
Executable Formal Models in Rewriting Logic (Invited Talk). 22-22 - Martin Avanzini, Christian Sternagel, René Thiemann
:
Certification of Complexity Proofs using CeTA. 23-39 - Franz Baader, Stefan Borgwardt, Barbara Morawska:
Dismatching and Local Disunification in EL. 40-56 - Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret:
Nominal Anti-Unification. 57-73 - Horatiu Cirstea, Sergueï Lenglet, Pierre-Etienne Moreau:
A faithful encoding of programmable strategies into term rewriting systems. 74-88 - Florence Clerc, Samuel Mimram:
Presenting a Category Modulo a Rewriting System. 89-105 - Lukasz Czajka:
Confluence of nearly orthogonal infinitary term rewriting systems. 106-126 - Anupam Das, Lutz Straßburger:
No complete linear term rewriting system for propositional logic. 127-142 - Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva:
A Coinductive Framework for Infinitary Rewriting and Equational Reasoning. 143-159 - Jörg Endrullis, Hans Zantema:
Proving non-termination by finite automata. 160-176 - Thomas Genet, Yann Salmon:
Reachability Analysis of Innermost Rewriting. 177-193 - Lars Hellström:
Network Rewriting II: Bi- and Hopf Algebras. 194-208 - Nao Hirokawa, Aart Middeldorp, Georg Moser:
Leftmost Outermost Revisited. 209-222 - Cynthia Kop, Aart Middeldorp, Thomas Sternagel:
Conditional Complexity. 223-240 - Ilias S. Kotsireas, Temur Kutsia, Dimitris E. Simos:
Constructing Orthogonal Designs in Powers of Two: Gröbner Bases Meet Equational Unification. 241-256 - Julian Nagele, Bertram Felgenhauer, Aart Middeldorp:
Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules. 257-268 - Julian Nagele, Harald Zankl:
Certified Rule Labeling. 269-284 - David Sabel, Hans Zantema:
Transforming Cycle Rewriting into String Rewriting. 285-300 - Takaki Suzuki, Kentaro Kikuchi, Takahito Aoto, Yoshihito Toyama:
Confluence of Orthogonal Nominal Rewriting Systems Revisited. 301-317 - Johannes Waldmann:
Matrix Interpretations on Polyhedral Domains. 318-333 - Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder:
Inferring Lower Bounds for Runtime Complexity. 334-349 - Markus Lepper, Baltasar Trancón y Widemann:
A Simple and Efficient Step Towards Type-Correct XSLT Transformations. 350-364 - Vlad A. Vergu, Pierre Neron, Eelco Visser:
DynSem: A DSL for Dynamic Semantics Specification. 365-378
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-11 20:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
