## Maribel Fernández

*Proceedings of the 26th International Conference on Rewriting Techniques and Applications*

RTA, 2015.

@proceedings{RTA-2015, address = "Warsaw, Poland", editor = "Maribel Fernández", ee = "http://www.dagstuhl.de/dagpub/978-3-939897-85-9", isbn = "978-3-939897-85-9", publisher = "{Schloss Dagstuhl — Leibniz-Zentrum für Informatik}", series = "{Leibniz International Proceedings in Informatics}", title = "{Proceedings of the 26th International Conference on Rewriting Techniques and Applications}", volume = 36, year = 2015, }

### Contents (25 items)

- RTA-2015-Kirchner #data analysis #graph
- Port Graphs, Rules and Strategies for Dynamic Data Analytics — Extended Abstract (HK), pp. 1–4.
- RTA-2015-Rosu #logic
- Matching Logic — Extended Abstract (GR), pp. 5–21.
- RTA-2015-Talcott #execution #formal method #logic #modelling
- Executable Formal Models in Rewriting Logic (CLT), p. 22.
- RTA-2015-AvanziniST #certification #complexity #proving #using
- Certification of Complexity Proofs using CeTA (MA, CS, RT), pp. 23–39.
- RTA-2015-BaaderBM
- Dismatching and Local Disunification in EL (FB, SB, BM), pp. 40–56.
- RTA-2015-BaumgartnerKLV #anti
- Nominal Anti-Unification (AB, TK, JL, MV), pp. 57–73.
- RTA-2015-CirsteaLM #encoding #programmable #term rewriting
- A faithful encoding of programmable strategies into term rewriting systems (HC, SL, PEM), pp. 74–88.
- RTA-2015-ClercM #term rewriting
- Presenting a Category Modulo a Rewriting System (FC, SM), pp. 89–105.
- RTA-2015-Czajka #confluence #orthogonal #term rewriting
- Confluence of nearly orthogonal infinitary term rewriting systems (LC), pp. 106–126.
- RTA-2015-DasS #linear #logic #term rewriting
- No complete linear term rewriting system for propositional logic (AD, LS), pp. 127–142.
- RTA-2015-EndrullisHHP0 #equation #framework #induction #reasoning
- A Coinductive Framework for Infinitary Rewriting and Equational Reasoning (JE, HHH, DH, AP, AS), pp. 143–159.
- RTA-2015-EndrullisZ #automaton #finite #proving
- Proving non-termination by finite automata (JE, HZ), pp. 160–176.
- RTA-2015-GenetS #analysis #reachability
- Reachability Analysis of Innermost Rewriting (TG, YS), pp. 177–193.
- RTA-2015-Hellstrom #algebra #network
- Network Rewriting II: Bi- and Hopf Algebras (LH), pp. 194–208.
- RTA-2015-HirokawaMM #revisited
- Leftmost Outermost Revisited (NH, AM, GM), pp. 209–222.
- RTA-2015-KopMS #complexity
- Conditional Complexity (CK, AM, TS), pp. 223–240.
- RTA-2015-KotsireasKS #design #equation #orthogonal #unification
- Constructing Orthogonal Designs in Powers of Two: Gröbner Bases Meet Equational Unification (ISK, TK, DES), pp. 241–256.
- RTA-2015-NageleFM #analysis #automation #confluence #term rewriting
- Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules (JN, BF, AM), pp. 257–268.
- RTA-2015-NageleZ
- Certified Rule Labeling (JN, HZ), pp. 269–284.
- RTA-2015-SabelZ #string
- Transforming Cycle Rewriting into String Rewriting (DS, HZ), pp. 285–300.
- RTA-2015-SuzukiKAT #confluence #orthogonal #revisited #term rewriting
- Confluence of Orthogonal Nominal Rewriting Systems Revisited (TS, KK, TA, YT), pp. 301–317.
- RTA-2015-Waldmann #matrix
- Matrix Interpretations on Polyhedral Domains (JW), pp. 318–333.
- RTA-2015-FrohnGHAS #bound #complexity #runtime
- Inferring Lower Bounds for Runtime Complexity (FF, JG, JH, CA, TS), pp. 334–349.
- RTA-2015-LepperW #performance #towards
- A Simple and Efficient Step Towards Type-Correct XSLT Transformations (ML, BTyW), pp. 350–364.
- RTA-2015-VerguNV #domain-specific language #named #semantics #specification
- DynSem: A DSL for Dynamic Semantics Specification (VAV, PN, EV), pp. 365–378.

6 ×#term rewriting

3 ×#complexity

3 ×#confluence

3 ×#logic

3 ×#orthogonal

2 ×#analysis

2 ×#equation

2 ×#proving

2 ×#revisited

3 ×#complexity

3 ×#confluence

3 ×#logic

3 ×#orthogonal

2 ×#analysis

2 ×#equation

2 ×#proving

2 ×#revisited