Login / Signup
RTA
1985
1995
2005
2015
1985
2015
Keyphrases
Publications
2015
Florian Frohn
,
Jürgen Giesl
,
Jera Hensel
,
Cornelius Aschermann
,
Thomas Ströder
Inferring Lower Bounds for Runtime Complexity.
RTA
(2015)
Thomas Genet
,
Yann Salmon
Reachability Analysis of Innermost Rewriting.
RTA
(2015)
Ilias S. Kotsireas
,
Temur Kutsia
,
Dimitris E. Simos
Constructing Orthogonal Designs in Powers of Two: Gröbner Bases Meet Equational Unification.
RTA
(2015)
Julian Nagele
,
Harald Zankl
Certified Rule Labeling.
RTA
(2015)
Jörg Endrullis
,
Hans Zantema
Proving non-termination by finite automata.
RTA
(2015)
Julian Nagele
,
Bertram Felgenhauer
,
Aart Middeldorp
Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules.
RTA
(2015)
Front Matter, Table of Contents, Preface, Conference Organization.
RTA
(2015)
Vlad A. Vergu
,
Pierre Neron
,
Eelco Visser
DynSem: A DSL for Dynamic Semantics Specification.
RTA
(2015)
Hélène Kirchner
Port Graphs, Rules and Strategies for Dynamic Data Analytics - Extended Abstract (Invited Talk).
RTA
(2015)
Lars Hellström
Network Rewriting II: Bi- and Hopf Algebras.
RTA
(2015)
Florence Clerc
,
Samuel Mimram
Presenting a Category Modulo a Rewriting System.
RTA
(2015)
David Sabel
,
Hans Zantema
Transforming Cycle Rewriting into String Rewriting.
RTA
(2015)
Carolyn L. Talcott
Executable Formal Models in Rewriting Logic (Invited Talk).
RTA
(2015)
Martin Avanzini
,
Christian Sternagel
,
René Thiemann
Certification of Complexity Proofs using CeTA.
RTA
(2015)
Anupam Das
,
Lutz Straßburger
No complete linear term rewriting system for propositional logic.
RTA
(2015)
Alexander Baumgartner
,
Temur Kutsia
,
Jordi Levy
,
Mateu Villaret
Nominal Anti-Unification.
RTA
(2015)
Horatiu Cirstea
,
Sergueï Lenglet
,
Pierre-Etienne Moreau
A faithful encoding of programmable strategies into term rewriting systems.
RTA
(2015)
Franz Baader
,
Stefan Borgwardt
,
Barbara Morawska
Dismatching and Local Disunification in EL.
RTA
(2015)
Jörg Endrullis
,
Helle Hvid Hansen
,
Dimitri Hendriks
,
Andrew Polonsky
,
Alexandra Silva
A Coinductive Framework for Infinitary Rewriting and Equational Reasoning.
RTA
(2015)
Takaki Suzuki
,
Kentaro Kikuchi
,
Takahito Aoto
,
Yoshihito Toyama
Confluence of Orthogonal Nominal Rewriting Systems Revisited.
RTA
(2015)
Cynthia Kop
,
Aart Middeldorp
,
Thomas Sternagel
Conditional Complexity.
RTA
(2015)
Nao Hirokawa
,
Aart Middeldorp
,
Georg Moser
Leftmost Outermost Revisited.
RTA
(2015)
Lukasz Czajka
Confluence of nearly orthogonal infinitary term rewriting systems.
RTA
(2015)
Markus Lepper
,
Baltasar Trancón y Widemann
A Simple and Efficient Step Towards Type-Correct XSLT Transformations.
RTA
(2015)
Grigore Rosu
Matching Logic - Extended Abstract (Invited Talk).
RTA
(2015)
Johannes Waldmann
Matrix Interpretations on Polyhedral Domains.
RTA
(2015)
volume 36, 2015
26th International Conference on Rewriting Techniques and Applications, RTA 2015, June 29 to July 1, 2015, Warsaw, Poland
RTA
36 (2015)
2013
Beniamino Accattoli
Linear Logic and Strong Normalization.
RTA
(2013)
Clemens Grabmayer
,
Jan Rochel
Expressibility in the Lambda Calculus with Mu.
RTA
(2013)
Martin Avanzini
,
Georg Moser
Tyrolean Complexity Tool: Features and Usage.
RTA
(2013)
Manfred Schmidt-Schauß
,
Conrad Rau
,
David Sabel
Algorithms for Extended Alpha-Equivalence and Complexity.
RTA
(2013)
Bertram Felgenhauer
,
Vincent van Oostrom
Proof Orders for Decreasing Diagrams.
RTA
(2013)
Manfred Schmidt-Schauß
,
Elena Machkasova
,
David Sabel
Extending Abramsky's Lazy Lambda Calculus: (Non)-Conservativity of Embeddings.
RTA
(2013)
Jarkko Kari
Pattern Generation by Cellular Automata (Invited Talk).
RTA
(2013)
Christophe Calvès
Unifying Nominal Unification.
RTA
(2013)
Dimitrios Vytiniotis
,
Simon L. Peyton Jones
Evidence Normalization in System FC (Invited Talk).
RTA
(2013)
Gert Smolka
,
Tobias Tebbi
Unification Modulo Nonnested Recursion Schemes via Anchored Semi-Unification.
RTA
(2013)
Kyungmin Bae
,
Santiago Escobar
,
José Meseguer
Abstract Logical Model Checking of Infinite-State Systems Using Narrowing.
RTA
(2013)
Sarah Winkler
,
Harald Zankl
,
Aart Middeldorp
Beyond Peano Arithmetic - Automatically Proving Termination of the Goodstein Sequence.
RTA
(2013)
Frontmatter, Table of Contents, Preface, Conference Organization.
RTA
(2013)
Alexander Baumgartner
,
Temur Kutsia
,
Jordi Levy
,
Mateu Villaret
A Variant of Higher-Order Anti-Unification.
RTA
(2013)
Anupam Das
Rewriting with Linear Inferences in Propositional Logic.
RTA
(2013)
Harald Zankl
Confluence by Decreasing Diagrams - Formalized.
RTA
(2013)
Yohan Boichut
,
Jacques Chabin
,
Pierre Réty
Over-approximating Descendants by Synchronized Tree Languages.
RTA
(2013)
Alexander Bau
,
Markus Lohrey
,
Eric Nöth
,
Johannes Waldmann
Compression of Rewriting Systems for Termination Analysis.
RTA
(2013)
Mitsuhiro Okada
Husserl and Hilbert on Completeness and Husserl's Term Rewrite-based Theory of Multiplicity (Invited Talk).
RTA
(2013)
Ken-etsu Fujita
,
Aleksy Schubert
Decidable structures between Church-style and Curry-style.
RTA
(2013)
Christian Sternagel
,
René Thiemann
Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion.
RTA
(2013)
Sarah Winkler
,
Aart Middeldorp
Normalized Completion Revisited.
RTA
(2013)
volume 21, 2013
24th International Conference on Rewriting Techniques and Applications, RTA 2013, June 24-26, 2013, Eindhoven, The Netherlands
RTA
21 (2013)