Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Horatiu Cirstea, Sergueï Lenglet, Pierre-Etienne Moreau |
A faithful encoding of programmable strategies into term rewriting systems.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Johannes Waldmann |
Matrix Interpretations on Polyhedral Domains.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Franz Baader, Stefan Borgwardt, Barbara Morawska 0001 |
Dismatching and Local Disunification in EL.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Genet, Yann Salmon 0001 |
Reachability Analysis of Innermost Rewriting.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Lars Hellström |
Network Rewriting II: Bi- and Hopf Algebras.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Ilias S. Kotsireas, Temur Kutsia, Dimitris E. Simos |
Constructing Orthogonal Designs in Powers of Two: Gröbner Bases Meet Equational Unification.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder |
Inferring Lower Bounds for Runtime Complexity.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | David Sabel, Hans Zantema |
Transforming Cycle Rewriting into String Rewriting.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Florence Clerc, Samuel Mimram |
Presenting a Category Modulo a Rewriting System.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Martin Avanzini, Christian Sternagel, René Thiemann |
Certification of Complexity Proofs using CeTA.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Nao Hirokawa, Aart Middeldorp, Georg Moser |
Leftmost Outermost Revisited.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Vlad A. Vergu, Pierre Neron, Eelco Visser |
DynSem: A DSL for Dynamic Semantics Specification.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Cynthia Kop, Aart Middeldorp, Thomas Sternagel |
Conditional Complexity.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Anupam Das 0002, Lutz Straßburger |
No complete linear term rewriting system for propositional logic.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Takaki Suzuki, Kentaro Kikuchi, Takahito Aoto 0001, Yoshihito Toyama |
Confluence of Orthogonal Nominal Rewriting Systems Revisited.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Jörg Endrullis, Hans Zantema |
Proving non-termination by finite automata.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Grigore Rosu |
Matching Logic - Extended Abstract (Invited Talk).  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva 0001 |
A Coinductive Framework for Infinitary Rewriting and Equational Reasoning.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Carolyn L. Talcott |
Executable Formal Models in Rewriting Logic (Invited Talk).  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Maribel Fernández (eds.) |
26th International Conference on Rewriting Techniques and Applications, RTA 2015, June 29 to July 1, 2015, Warsaw, Poland  |
RTA  |
2015 |
DBLP BibTeX RDF |
|
1 | Julian Nagele, Bertram Felgenhauer, Aart Middeldorp |
Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Julian Nagele, Harald Zankl |
Certified Rule Labeling.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret |
Nominal Anti-Unification.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Lukasz Czajka 0001 |
Confluence of nearly orthogonal infinitary term rewriting systems.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Markus Lepper 0001, Baltasar Trancón y Widemann |
A Simple and Efficient Step Towards Type-Correct XSLT Transformations.  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Hélène Kirchner |
Port Graphs, Rules and Strategies for Dynamic Data Analytics - Extended Abstract (Invited Talk).  |
RTA  |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret |
A Variant of Higher-Order Anti-Unification.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Beniamino Accattoli |
Linear Logic and Strong Normalization.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Yves Guiraud, Philippe Malbos, Samuel Mimram |
A Homotopical Completion Procedure with Applications to Coherence of Monoids.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Bertram Felgenhauer, Vincent van Oostrom |
Proof Orders for Decreasing Diagrams.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Clemens Grabmayer, Jan Rochel |
Expressibility in the Lambda Calculus with Mu.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Anupam Das 0002 |
Rewriting with Linear Inferences in Propositional Logic.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Manfred Schmidt-Schauß, Elena Machkasova, David Sabel |
Extending Abramsky's Lazy Lambda Calculus: (Non)-Conservativity of Embeddings.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Elena Tushkanova, Christophe Ringeissen, Alain Giorgetti, Olga Kouchnarenko |
Automatic Decidability: A Schematic Calculus for Theories with Counting Operators.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Gert Smolka, Tobias Tebbi |
Unification Modulo Nonnested Recursion Schemes via Anchored Semi-Unification.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Ken-etsu Fujita, Aleksy Schubert |
Decidable structures between Church-style and Curry-style.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Dimitrios Vytiniotis, Simon L. Peyton Jones |
Evidence Normalization in System FC (Invited Talk).  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Manfred Schmidt-Schauß, Conrad Rau, David Sabel |
Algorithms for Extended Alpha-Equivalence and Complexity.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Christophe Calvès |
Unifying Nominal Unification.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Femke van Raamsdonk (eds.) |
24th International Conference on Rewriting Techniques and Applications, RTA 2013, June 24-26, 2013, Eindhoven, The Netherlands  |
RTA  |
2013 |
DBLP BibTeX RDF |
|
1 | Mitsuhiro Okada |
Husserl and Hilbert on Completeness and Husserl's Term Rewrite-based Theory of Multiplicity (Invited Talk).  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Yohan Boichut, Jacques Chabin, Pierre Réty |
Over-approximating Descendants by Synchronized Tree Languages.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Harald Zankl |
Confluence by Decreasing Diagrams - Formalized.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Bau, Markus Lohrey, Eric Nöth, Johannes Waldmann |
Compression of Rewriting Systems for Termination Analysis.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Martin Avanzini, Georg Moser |
Tyrolean Complexity Tool: Features and Usage.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Kyungmin Bae, Santiago Escobar 0001, José Meseguer 0001 |
Abstract Logical Model Checking of Infinite-State Systems Using Narrowing.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | |
Frontmatter, Table of Contents, Preface, Conference Organization.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Sarah Winkler, Harald Zankl, Aart Middeldorp |
Beyond Peano Arithmetic - Automatically Proving Termination of the Goodstein Sequence.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Jarkko Kari |
Pattern Generation by Cellular Automata (Invited Talk).  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Sarah Winkler, Aart Middeldorp |
Normalized Completion Revisited.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Christian Sternagel, René Thiemann |
Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Martin Avanzini, Georg Moser |
A Combination Framework for Complexity.  |
RTA  |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Osama Al-Hassani, Quratul-ain Mahesar, Claudio Sacerdoti Coen, Volker Sorge |
A Term Rewriting System for Kuratowski's Closure-Complement Problem.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Sebastian Maneth |
Dictionary-Based Tree Compression (Invited Talk).  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Bertram Felgenhauer |
Deciding Confluence of Ground Term Rewrite Systems in Cubic Time.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott, Ranko Perovic |
A Rewriting Framework for Activities Subject to Regulations.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Claude Kirchner |
Rho-Calculi for Computation and Logic (Invited Talk).  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Patrick Bahr |
Infinitary Term Graph Rewriting is Simple, Sound and Complete.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Jeroen Ketema |
Reinterpreting Compression in Infinitary Rewriting.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Kazushige Terui |
Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Soren Bjerg Andersen, Jakob Grue Simonsen |
Term Rewriting Systems as Topological Dynamical Systems.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Paula Severi, Fer-Jan de Vries |
Meaningless Sets in Infinitary Combinatory Logic.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Ashish Tiwari 0001 |
RTA 2012 Proceedings Frontmatter.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Beniamino Accattoli, Ugo Dal Lago |
On the Invariance of the Unitary Cost Model for Head Reduction.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Manfred Schmidt-Schauß |
Matching of Compressed Patterns with Character-Variables.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Eduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos 0001 |
Normalisation for Dynamic Pattern Calculi.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Denis Cousineau 0002, Olivier Hermant |
A Semantic Proof that Reducibility Candidates entail Cut Elimination.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Alexei Lisitsa 0001 |
Finite Models vs Tree Automata in Safety Verification.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Vincent van Oostrom, Hans Zantema |
Triangulation in Rewriting.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Karl Gmeiner, Bernhard Gramlich, Felix Schernhammer |
On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Hirokazu Anai |
Computational Real Algebraic Geometry in Practice (Invited Talk).  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Nathalie Bertrand 0001, Giorgio Delzanno, Barbara König 0001, Arnaud Sangnier, Jan Stückrath |
On the Decidability Status of Reachability and Coverability in Graph Transformation Systems.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Ashish Tiwari 0001 (eds.) |
23rd International Conference on Rewriting Techniques and Applications (RTA'12) , RTA 2012, May 28 - June 2, 2012, Nagoya, Japan  |
RTA  |
2012 |
DBLP BibTeX RDF |
|
1 | Carsten Fuhs, Cynthia Kop |
Polynomial Interpretations for Higher-Order Rewriting.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Carles Creus, Adrià Gascón, Guillem Godoy |
One-context Unification with STG-Compressed Terms is in NP.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | René Thiemann, Guillaume Allais, Julian Nagele |
On the Formalization of Termination Techniques based on Multiset Orderings.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Christian Sattler, Florent Balestrieri |
Turing-Completeness of Polymorphic Stream Equation Systems.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Beniamino Accattoli |
An Abstract Factorization Theorem for Explicit Substitutions.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Thibaut Balabonski |
Axiomatic Sharing-via-Labelling.  |
RTA  |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Aaron Stump, Garrin Kimmell, Roba El Haj Omar |
Type Preservation as a Confluence Problem.  |
RTA  |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Takahito Aoto 0001, Toshiyuki Yamada, Yuki Chiba |
Natural Inductive Theorems for Higher-Order Rewriting.  |
RTA  |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Manfred Schmidt-Schauß |
Frontmatter, Table of Contents, Preface, Conference Organization.  |
RTA  |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Manfred Schmidt-Schauß (eds.) |
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, RTA 2011, May 30 - June 1, 2011, Novi Sad, Serbia  |
RTA  |
2011 |
DBLP BibTeX RDF |
|
1 | Friedrich Neurauter, Aart Middeldorp |
Revisiting Matrix Interpretations for Proving Termination of Term Rewriting.  |
RTA  |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Temur Kutsia, Jordi Levy, Mateu Villaret |
Anti-Unification for Unranked Terms and Hedges.  |
RTA  |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Martin Avanzini, Naohi Eguchi, Georg Moser |
A Path Order for Rewrite Systems that Compute Exponential Time Functions.  |
RTA  |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Marc Brockschmidt, Carsten Otto, Jürgen Giesl |
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting.  |
RTA  |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Ashish Tiwari 0001 |
Rewriting in Practice.  |
RTA  |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Naoki Nishida 0001, Germán Vidal |
Program Inversion for Tail Recursive Functions.  |
RTA  |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Jonathan Kochems, C.-H. Luke Ong |
Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars.  |
RTA  |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Francisco Durán 0001, Steven Eker, Santiago Escobar 0001, José Meseguer 0001, Carolyn L. Talcott |
Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6.  |
RTA  |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Adrià Gascón, Sebastian Maneth, Lander Ramos |
First-Order Unification on Compressed Terms.  |
RTA  |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Stephan Falke 0001, Deepak Kapur, Carsten Sinz |
Termination Analysis of C Programs Using Compiler Intermediate Languages.  |
RTA  |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Paula Severi, Fer-Jan de Vries |
Weakening the Axiom of Overlap in Infinitary Lambda Calculus.  |
RTA  |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Naoki Nishida 0001, Masahiko Sakai, Toshiki Sakabe |
Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity.  |
RTA  |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Stephanie Weirich |
Combining Proofs and Programs.  |
RTA  |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Irène Durand, Marc Sylvestre |
Left-linear Bounded TRSs are Inverse Recognizability Preserving.  |
RTA  |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Georg Moser, Andreas Schnabl |
Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity.  |
RTA  |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Christian Sternagel, René Thiemann |
Modular and Certified Semantic Labeling and Unlabeling.  |
RTA  |
2011 |
DBLP DOI BibTeX RDF |
|