Search results for "RTA"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Bruno Conchinha, David A. Basin, Carlos Caleiro	FAST: An Efficient Decision Procedure for Deduction and Static Equivalence.	RTA	2011	DBLP DOI BibTeX RDF
1	Dominik Klein 0001, Nao Hirokawa	Maximal Completion.	RTA	2011	DBLP DOI BibTeX RDF
1	Cynthia Kop, Femke van Raamsdonk	Higher Order Dependency Pairs for Algebraic Functional Systems.	RTA	2011	DBLP DOI BibTeX RDF
1	Hans Zantema, Jörg Endrullis	Proving Equality of Streams Automatically.	RTA	2011	DBLP DOI BibTeX RDF
1	Cody Roux	Refinement Types as Higher-Order Dependency Pairs.	RTA	2011	DBLP DOI BibTeX RDF
1	Kristoffer H. Rose	CRSX - Combinatory Reduction Systems with Extensions.	RTA	2011	DBLP DOI BibTeX RDF
1	Takahito Aoto 0001, Yoshihito Toyama	A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems.	RTA	2011	DBLP DOI BibTeX RDF
1	Harald Zankl, Bertram Felgenhauer, Aart Middeldorp	Labelings for Decreasing Diagrams.	RTA	2011	DBLP DOI BibTeX RDF
1	Patrick Bahr	Modes of Convergence for Term Graph Rewriting.	RTA	2011	DBLP DOI BibTeX RDF
1	Evelyne Contejean, Pierre Courtieu, Julien Forest, Olivier Pons, Xavier Urbain	Automated Certified Proofs with CiME3.	RTA	2011	DBLP DOI BibTeX RDF
1	Sophie Tison	Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's New?.	RTA	2011	DBLP DOI BibTeX RDF
1	Niels Bjørn Bugge Grathwohl, Jeroen Ketema, Jens Duelund Pallesen, Jakob Grue Simonsen	Anagopos: A Reduction Graph Visualizer for Term Rewriting and Lambda Calculus.	RTA	2011	DBLP DOI BibTeX RDF
1	Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise	Rewriting-based Quantifier-free Interpolation for a Theory of Arrays.	RTA	2011	DBLP DOI BibTeX RDF
1	Friedrich Neurauter, Aart Middeldorp	Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers.	RTA	2010	DBLP DOI BibTeX RDF
1	Martin Avanzini, Georg Moser	Closing the Gap Between Runtime Complexity and Polytime Computability.	RTA	2010	DBLP DOI BibTeX RDF
1	Stefan Kahrs	Infinitary Rewriting: Foundations Revisited.	RTA	2010	DBLP DOI BibTeX RDF
1	Ken-etsu Fujita, Aleksy Schubert	The Undecidability of Type Related Problems in Type-free Style System F.	RTA	2010	DBLP DOI BibTeX RDF
1	Manfred Schmidt-Schauß, David Sabel, Elena Machkasova	Simulation in the Call-by-Need Lambda-Calculus with letrec.	RTA	2010	DBLP DOI BibTeX RDF
1	Claus Appel, Vincent van Oostrom, Jakob Grue Simonsen	Higher-Order (Non-)Modularity .	RTA	2010	DBLP DOI BibTeX RDF
1	Alexander Koller, Stefan Thater	Underspecified computation of normal forms.	RTA	2010	DBLP DOI BibTeX RDF
1	Harald Zankl, Martin Korp	Modular Complexity Analysis via Relative Complexity.	RTA	2010	DBLP DOI BibTeX RDF
1	Patrick Bahr	Partial Order Infinitary Term Rewriting and Böhm Trees.	RTA	2010	DBLP DOI BibTeX RDF
1	Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom	Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting.	RTA	2010	DBLP DOI BibTeX RDF
1	Hans Zantema, Matthias Raffelsieper	Proving Productivity in Infinite Data Structures.	RTA	2010	DBLP DOI BibTeX RDF
1	Patrick Bahr	Abstract Models of Transfinite Reductions.	RTA	2010	DBLP DOI BibTeX RDF
1	Christopher Lynch	Preface.	RTA	2010	DBLP DOI BibTeX RDF
1	Christian Sternagel, René Thiemann	Certified Subterm Criterion and Certified Usable Rules.	RTA	2010	DBLP DOI BibTeX RDF
1	Temur Kutsia, Mircea Marin	Order-Sorted Unification with Regular Expression Sorts.	RTA	2010	DBLP DOI BibTeX RDF
1	Johannes Waldmann	Polynomially Bounded Matrix Interpretations.	RTA	2010	DBLP DOI BibTeX RDF
1	Adrián Riesco 0001, Alberto Verdejo, Narciso Martí-Oliet	Declarative Debugging of Missing Answers for Maude.	RTA	2010	DBLP DOI BibTeX RDF
1	Carsten Otto, Marc Brockschmidt, Christian von Essen, Jürgen Giesl	Automated Termination Analysis of Java Bytecode by Term Rewriting.	RTA	2010	DBLP DOI BibTeX RDF
1	Jakob Grue Simonsen	Weak Convergence and Uniform Normalization in Infinitary Rewriting.	RTA	2010	DBLP DOI BibTeX RDF
1	Mikolaj Bojanczyk	Automata for Data Words and Data Trees.	RTA	2010	DBLP DOI BibTeX RDF
1	Samuel Mimram	Computing Critical Pairs in 2-Dimensional Rewriting Systems.	RTA	2010	DBLP DOI BibTeX RDF
1	Takahito Aoto 0001	Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling.	RTA	2010	DBLP DOI BibTeX RDF
1	Mark Hills 0001, Grigore Rosu	A Rewriting Logic Semantics Approach to Modular Program Analysis.	RTA	2010	DBLP DOI BibTeX RDF
1	Alessio Guglielmi, Tom Gundersen, Michel Parigot	A Proof Calculus Which Reduces Syntactic Bureaucracy.	RTA	2010	DBLP DOI BibTeX RDF
1	Christopher Lynch	Frontmatter (Titlepage, Table of Contents, Author List, PC List, Reviewer List).	RTA	2010	DBLP DOI BibTeX RDF
1	Jordi Levy, Mateu Villaret	An Efficient Nominal Unification Algorithm.	RTA	2010	DBLP DOI BibTeX RDF
1	Karl Gmeiner, Bernhard Gramlich, Felix Schernhammer	On (Un)Soundness of Unravelings.	RTA	2010	DBLP DOI BibTeX RDF
1	Sarah Winkler, Haruhiko Sato, Aart Middeldorp, Masahito Kurihara	Optimizing mkbTT.	RTA	2010	DBLP DOI BibTeX RDF
1	Irène Durand, Géraud Sénizergues, Marc Sylvestre	Termination of linear bounded term rewriting systems.	RTA	2010	DBLP DOI BibTeX RDF
1	Vincent van Oostrom	Realising Optimal Sharing.	RTA	2010	DBLP DOI BibTeX RDF
1	Christopher Lynch (eds.)	Proceedings of the 21st International Conference on Rewriting Techniques and Applications, RTA 2010, July 11-13, 2010, Edinburgh, Scottland, UK	RTA	2010	DBLP BibTeX RDF
1	Martin Avanzini, Georg Moser	Dependency Pairs and Polynomial Path Orders.	RTA	2009	DBLP DOI BibTeX RDF
1	Manuel Clavel, Francisco Durán 0001, Steven Eker, Santiago Escobar 0001, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer 0001, Carolyn L. Talcott	Unification and Narrowing in Maude 2.4.	RTA	2009	DBLP DOI BibTeX RDF
1	Martin Korp, Christian Sternagel, Harald Zankl, Aart Middeldorp	Tyrolean Termination Tool 2.	RTA	2009	DBLP DOI BibTeX RDF	automation, termination, term rewriting
1	Alwen Tiu, Rajeev Goré	A Proof Theoretic Analysis of Intruder Theories.	RTA	2009	DBLP DOI BibTeX RDF	AC convergent theories, intruder deduction, security protocols, sequent calculus
1	Francisco Javier López-Fraguas, Juan Rodríguez-Hortalá, Jaime Sánchez-Hernández	A Fully Abstract Semantics for Constructor Systems.	RTA	2009	DBLP DOI BibTeX RDF
1	Dominique Duval, Rachid Echahed, Frédéric Prost	A Heterogeneous Pushout Approach to Term-Graph Transformation.	RTA	2009	DBLP DOI BibTeX RDF
1	Daisuke Kimura, Makoto Tatsuta	Dual Calculus with Inductive and Coinductive Types.	RTA	2009	DBLP DOI BibTeX RDF
1	Jörg Endrullis, Dimitri Hendriks	From Outermost to Context-Sensitive Rewriting.	RTA	2009	DBLP DOI BibTeX RDF
1	Mathieu Baudet, Véronique Cortier, Stéphanie Delaune	YAPA: A Generic Tool for Computing Intruder Knowledge.	RTA	2009	DBLP DOI BibTeX RDF
1	Aleksy Schubert	The Existential Fragment of the One-Step Parallel Rewriting Theory.	RTA	2009	DBLP DOI BibTeX RDF
1	Felix Schernhammer, Bernhard Gramlich	VMTL-A Modular Termination Laboratory.	RTA	2009	DBLP DOI BibTeX RDF
1	Stefan Kahrs	Modularity of Convergence in Infinitary Rewriting.	RTA	2009	DBLP DOI BibTeX RDF
1	Jeroen Ketema	Comparing Böhm-Like Trees.	RTA	2009	DBLP DOI BibTeX RDF
1	Sergiu Bursuc, Hubert Comon-Lundh	Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions.	RTA	2009	DBLP DOI BibTeX RDF
1	Ralf Treinen (eds.)	Rewriting Techniques and Applications, 20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009, Proceedings	RTA	2009	DBLP DOI BibTeX RDF
1	Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke 0001	Proving Termination of Integer Term Rewriting.	RTA	2009	DBLP DOI BibTeX RDF
1	Jörg Endrullis, Roel C. de Vrijer, Johannes Waldmann	Local Termination.	RTA	2009	DBLP DOI BibTeX RDF
1	Hans Zantema	Well-Definedness of Streams by Termination.	RTA	2009	DBLP DOI BibTeX RDF
1	Takahito Aoto 0001, Junichi Yoshida, Yoshihito Toyama	Proving Confluence of Term Rewriting Systems Automatically.	RTA	2009	DBLP DOI BibTeX RDF
1	Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß	Unification with Singleton Tree Grammars.	RTA	2009	DBLP DOI BibTeX RDF
1	Franz Baader, Barbara Morawska 0001	Unification in the Description Logic EL.	RTA	2009	DBLP DOI BibTeX RDF
1	Guillem Godoy, Florent Jacquemard	Unique Normalization for Shallow TRS.	RTA	2009	DBLP DOI BibTeX RDF
1	Georg Moser, Andreas Schnabl	The Derivational Complexity Induced by the Dependency Pair Method.	RTA	2009	DBLP DOI BibTeX RDF
1	Helmut Seidl, Kumar Neeraj Verma	Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case.	RTA	2009	DBLP DOI BibTeX RDF
1	René Thiemann, Christian Sternagel	Loops under Strategies.	RTA	2009	DBLP DOI BibTeX RDF
1	Johannes Waldmann	Automatic Termination.	RTA	2009	DBLP DOI BibTeX RDF
1	Marc de Falco	An Explicit Framework for Interaction Nets.	RTA	2009	DBLP DOI BibTeX RDF
1	Jakob Grue Simonsen	The -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity).	RTA	2009	DBLP DOI BibTeX RDF
1	Yves Lafont, Pierre Rannou	Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks.	RTA	2008	DBLP DOI BibTeX RDF	critical pair, diagram rewriting, Zamolodchikov, orthogonal matrix
1	René Thiemann, Jürgen Giesl, Peter Schneider-Kamp	Deciding Innermost Loops.	RTA	2008	DBLP DOI BibTeX RDF
1	Christian Urban, Bozhi Zhu	Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof.	RTA	2008	DBLP DOI BibTeX RDF
1	Sorin Stratulat	Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities.	RTA	2008	DBLP DOI BibTeX RDF
1	Emilie Balland, Pierre-Etienne Moreau	Term-Graph Rewriting Via Explicit Paths.	RTA	2008	DBLP DOI BibTeX RDF
1	Stephan Falke 0001, Deepak Kapur	Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures.	RTA	2008	DBLP DOI BibTeX RDF
1	Christian Sternagel, Aart Middeldorp	Root-Labeling.	RTA	2008	DBLP DOI BibTeX RDF
1	Vincent van Oostrom	Confluence by Decreasing Diagrams.	RTA	2008	DBLP DOI BibTeX RDF
1	María Alpuente, Santiago Escobar 0001, José Iborra	Modular Termination of Basic Narrowing.	RTA	2008	DBLP DOI BibTeX RDF
1	Hans Zantema	Normalization of Infinite Terms.	RTA	2008	DBLP DOI BibTeX RDF
1	Santiago Escobar 0001, José Meseguer 0001, Ralf Sasse	Effectively Checking the Finite Variant Property.	RTA	2008	DBLP DOI BibTeX RDF
1	Manfred Schmidt-Schauß, Elena Machkasova	A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case.	RTA	2008	DBLP DOI BibTeX RDF
1	Kazunori Ueda	Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting.	RTA	2008	DBLP DOI BibTeX RDF
1	Jordi Levy, Mateu Villaret	Nominal Unification from a Higher-Order Perspective.	RTA	2008	DBLP DOI BibTeX RDF
1	Marco Kuhlmann, Joachim Niehren	Logics and Automata for Totally Ordered Trees.	RTA	2008	DBLP DOI BibTeX RDF
1	Jeroen Ketema	On Normalisation of Infinitary Combinatory Reduction Systems.	RTA	2008	DBLP DOI BibTeX RDF
1	Yoshihito Toyama	Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations.	RTA	2008	DBLP DOI BibTeX RDF
1	Pablo Arrighi, Gilles Dowek	Linear-algebraic lambda-calculus: higher-order, encodings, and confluence..	RTA	2008	DBLP DOI BibTeX RDF
1	Andrei Voronkov (eds.)	Rewriting Techniques and Applications, 19th International Conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008, Proceedings	RTA	2008	DBLP DOI BibTeX RDF
1	Steffen Mazanek, Mark Minas	Functional-Logic Graph Parser Combinators.	RTA	2008	DBLP DOI BibTeX RDF
1	Adam Koprowski, Johannes Waldmann	Arctic Termination ...Below Zero.	RTA	2008	DBLP DOI BibTeX RDF
1	Joe Hendrix, Hitoshi Ohsaki	Combining Equational Tree Automata over AC and ACI Theories.	RTA	2008	DBLP DOI BibTeX RDF
1	Rachid Echahed, Nicolas Peltier	A Needed Rewriting Strategy for Data-Structures with Pointers.	RTA	2008	DBLP DOI BibTeX RDF
1	Jörg Endrullis, Roel C. de Vrijer	Reduction Under Substitution.	RTA	2008	DBLP DOI BibTeX RDF
1	Florent Jacquemard, Michaël Rusinowitch	Closure of Hedge-Automata Languages by Hedge Rewriting.	RTA	2008	DBLP DOI BibTeX RDF
1	Raúl Gutiérrez, Salvador Lucas, Xavier Urbain	Usable Rules for Context-Sensitive Rewrite Systems.	RTA	2008	DBLP DOI BibTeX RDF	termination, term rewriting, Dependency pairs
1	Georg Moser, Andreas Schnabl	Proving Quadratic Derivational Complexities Using Context Dependent Interpretations.	RTA	2008	DBLP DOI BibTeX RDF
1	Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko	Finer Is Better: Abstraction Refinement for Rewriting Approximations.	RTA	2008	DBLP DOI BibTeX RDF

Publications at "RTA"( http://dblp.L3S.de/Venues/RTA )