Search results for "RTA"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Olivier Bournez, Florent Garnier	Proving Positive Almost-Sure Termination.	RTA	2005	DBLP DOI BibTeX RDF
1	Jaco van de Pol, Hans Zantema	Generalized Innermost Rewriting.	RTA	2005	DBLP DOI BibTeX RDF
1	Herman Geuvers, Rob Nederpelt	Rewriting for Fitch Style Natural Deductions.	RTA	2004	DBLP DOI BibTeX RDF
1	Yoshihito Toyama	Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms.	RTA	2004	DBLP DOI BibTeX RDF
1	Vincent van Oostrom (eds.)	Rewriting Techniques and Applications, 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings	RTA	2004	DBLP DOI BibTeX RDF
1	Evelyne Contejean	A Certified AC Matching Algorithm.	RTA	2004	DBLP DOI BibTeX RDF
1	Salvador Lucas	mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting.	RTA	2004	DBLP DOI BibTeX RDF
1	Ichiro Mitsuhashi, Michio Oyamaguchi, Yoshikatsu Ohta, Toshiyuki Yamada	The Joinability and Unification Problems for Confluent Semi-constructor TRSs.	RTA	2004	DBLP DOI BibTeX RDF
1	Johannes Waldmann	Matchbox: A Tool for Match-Bounded String Rewriting.	RTA	2004	DBLP DOI BibTeX RDF
1	Nao Hirokawa, Aart Middeldorp	Dependency Pairs Revisited.	RTA	2004	DBLP DOI BibTeX RDF
1	Frédéric Blanqui	A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems.	RTA	2004	DBLP DOI BibTeX RDF
1	Jakob Grue Simonsen	On the Modularity of Confluence in Infinitary Term Rewriting.	RTA	2004	DBLP DOI BibTeX RDF
1	Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke 0001	Automated Termination Proofs with AProVE.	RTA	2004	DBLP DOI BibTeX RDF
1	Toshinori Takai	A Verification Technique Using Term Rewriting Systems and Abstract Interpretation.	RTA	2004	DBLP DOI BibTeX RDF
1	Stefan Blom	An Approximation Based Approach to Infinitary Lambda Calculi.	RTA	2004	DBLP DOI BibTeX RDF	infinitary rewriting, lambda calculus
1	Julien Carme, Joachim Niehren, Marc Tommasi	Querying Unranked Trees with Stepwise Tree Automata.	RTA	2004	DBLP DOI BibTeX RDF
1	Jeroen Ketema	Böhm-Like Trees for Term Rewriting Systems.	RTA	2004	DBLP DOI BibTeX RDF
1	Neil D. Jones, Nina Bohr	Termination Analysis of the Untyped lamba-Calculus.	RTA	2004	DBLP DOI BibTeX RDF
1	Takahito Aoto 0001, Toshiyuki Yamada, Yoshihito Toyama	Inductive Theorems for Higher-Order Rewriting.	RTA	2004	DBLP DOI BibTeX RDF
1	Jacob Matthews, Robert Bruce Findler, Matthew Flatt, Matthias Felleisen	A Visual Environment for Developing Context-Sensitive Term Rewriting Systems.	RTA	2004	DBLP DOI BibTeX RDF
1	Hans Zantema	TORPA: Termination of Rewriting Proved Automatically.	RTA	2004	DBLP DOI BibTeX RDF
1	Ian Mackie	Efficient lambda-Evaluation with Interaction Nets.	RTA	2004	DBLP DOI BibTeX RDF
1	Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret	Monadic Second-Order Unification Is NP-Complete.	RTA	2004	DBLP DOI BibTeX RDF
1	Sébastien Limet, Gernot Salzer	Proving Properties of Term Rewrite Systems via Logic Programs.	RTA	2004	DBLP DOI BibTeX RDF
1	Gilles Dowek	Confluence as a Cut Elimination Property.	RTA	2003	DBLP DOI BibTeX RDF
1	François-Régis Sinot, Maribel Fernández, Ian Mackie	Efficient Reductions with Director Strings.	RTA	2003	DBLP DOI BibTeX RDF
1	Temur Kutsia	Equational Prover of THEOREMA.	RTA	2003	DBLP DOI BibTeX RDF
1	Silvano Dal-Zilio, Denis Lugiez	XML Schema, Tree Logic and Sheaves Automata.	RTA	2003	DBLP DOI BibTeX RDF
1	Deepak Kapur, Paliath Narendran, Lida Wang	An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation.	RTA	2003	DBLP DOI BibTeX RDF
1	Patrick Lincoln	Invited Talk: Symbolic Systems Biology.	RTA	2003	DBLP DOI BibTeX RDF
1	Hubert Comon-Lundh, Véronique Cortier	New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols.	RTA	2003	DBLP DOI BibTeX RDF
1	Mark van den Brand, Pierre-Etienne Moreau, Jurgen J. Vinju	Environments for Term Rewriting Engines for Free!	RTA	2003	DBLP DOI BibTeX RDF
1	Georg Moser, Andreas Weiermann	Relating Derivation Lengths with the Slow-Growing Hierarchy Directly.	RTA	2003	DBLP DOI BibTeX RDF
1	Frédéric Blanqui	Rewriting Modulo in Deduction Modulo.	RTA	2003	DBLP DOI BibTeX RDF
1	Takahito Aoto 0001, Toshiyuki Yamada	Termination of Simply Typed Term Rewriting by Translation and Labelling.	RTA	2003	DBLP DOI BibTeX RDF
1	Cristina Borralleras, Albert Rubio	Monotonic AC-Compatible Semantic Path Orderings.	RTA	2003	DBLP DOI BibTeX RDF
1	Neil Ghani, Anne Heyworth	A Rewriting Alternative to Reidemeister-Schreier.	RTA	2003	DBLP DOI BibTeX RDF
1	Steven Eker	Associative-Commutative Rewriting on Large Terms.	RTA	2003	DBLP DOI BibTeX RDF
1	Olivier Bournez, Mathieu Hoyrup	Rewriting Logic and Probabilities.	RTA	2003	DBLP DOI BibTeX RDF
1	Jürgen Giesl, Hans Zantema	Liveness in Rewriting.	RTA	2003	DBLP DOI BibTeX RDF
1	Manuel Clavel, Francisco Durán 0001, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer 0001, Carolyn L. Talcott	The Maude 2.0 System.	RTA	2003	DBLP DOI BibTeX RDF
1	H. J. Sander Bruggink	Residuals in Higher-Order Rewriting.	RTA	2003	DBLP DOI BibTeX RDF
1	Kumar Neeraj Verma	Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties.	RTA	2003	DBLP DOI BibTeX RDF
1	René Thiemann, Jürgen Giesl	Size-Change Termination for Term Rewriting.	RTA	2003	DBLP DOI BibTeX RDF
1	Gilles Barthe, Sorin Stratulat	Validation of the JavaCard Platform with Implicit Induction Techniques.	RTA	2003	DBLP DOI BibTeX RDF
1	Robert Nieuwenhuis (eds.)	Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings	RTA	2003	DBLP DOI BibTeX RDF
1	Sylvain Salvati, Philippe de Groote	On the Complexity of Higher-Order Matching in the Linear lambda-Calculus.	RTA	2003	DBLP DOI BibTeX RDF
1	Jean-Louis Giavitto	Invited Talk: Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems.	RTA	2003	DBLP DOI BibTeX RDF
1	Pascal Urso, Emmanuel Kounalis	"Term Partition" for Mathematical Induction.	RTA	2003	DBLP DOI BibTeX RDF
1	David A. McAllester	Joint RTA-TLCA Invited Talk: A Logical Algorithm for ML Type Inference.	RTA	2003	DBLP DOI BibTeX RDF
1	Julien Forest, Delia Kesner	Expression Reduction Systems with Patterns.	RTA	2003	DBLP DOI BibTeX RDF
1	Hitoshi Ohsaki, Hiroyuki Seki, Toshinori Takai	Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism.	RTA	2003	DBLP DOI BibTeX RDF
1	Feng Chen 0006, Grigore Rosu, Ram Prasad Venkatesan	Rule-Based Analysis of Dimensional Safety.	RTA	2003	DBLP DOI BibTeX RDF
1	Zurab Khasidashvili, John R. W. Glauert	Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication).	RTA	2003	DBLP DOI BibTeX RDF
1	Olivier Bournez, Guy-Marie Côme, Valérie Conraud, Hélène Kirchner, Liliana Ibanescu	A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms.	RTA	2003	DBLP DOI BibTeX RDF
1	Nao Hirokawa, Aart Middeldorp	Tsukuba Termination Tool.	RTA	2003	DBLP DOI BibTeX RDF
1	J. B. Wells, Detlef Plump, Fairouz Kamareddine	Diagrams for Meaning Preservation.	RTA	2003	DBLP DOI BibTeX RDF
1	Adam Granicz, Daniel M. Zimmerman, Jason Hickey	Rewriting UNITY.	RTA	2003	DBLP DOI BibTeX RDF
1	Grigore Rosu, Mahesh Viswanathan 0001	Testing Extended Regular Language Membership Incrementally by Rewriting.	RTA	2003	DBLP DOI BibTeX RDF
1	Alfons Geser	Termination of String Rewriting Rules That Have One Pair of Overlaps.	RTA	2003	DBLP DOI BibTeX RDF	one-rule, single-rule, uniform termination, termination, overlap, string rewriting, semi-Thue system
1	Johannes Waldmann	Rewrite Games.	RTA	2002	DBLP DOI BibTeX RDF
1	David Déharbe, Anamaria Martins Moreira, Christophe Ringeissen	Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae.	RTA	2002	DBLP DOI BibTeX RDF
1	Daniel J. Dougherty, Tomasz Wierzbicki	A Decidable Variant of Higher Order Matching.	RTA	2002	DBLP DOI BibTeX RDF
1	Hitoshi Ohsaki, Toshinori Takai	Decidability and Closure Properties of Equational Tree Languages.	RTA	2002	DBLP DOI BibTeX RDF
1	Paul-André Melliès	Axiomatic Rewriting Theory VI Residual Theory Revisited.	RTA	2002	DBLP DOI BibTeX RDF
1	Pierre Réty, Julie Vuotto	Regular Sets of Descendants by Some Rewrite Strategies.	RTA	2002	DBLP DOI BibTeX RDF
1	Natarajan Shankar, Harald Rueß	Combining Shostak Theories.	RTA	2002	DBLP DOI BibTeX RDF
1	Jaco van de Pol	JITty: A Rewriter with Strategy Annotations.	RTA	2002	DBLP DOI BibTeX RDF
1	Georg Struth	Deriving Focused Lattice Calculi.	RTA	2002	DBLP DOI BibTeX RDF
1	Martin Bravenboer, Eelco Visser	Rewriting Strategies for Instruction Selection.	RTA	2002	DBLP DOI BibTeX RDF
1	Jordi Levy, Mateu Villaret	Currying Second-Order Unification Problems.	RTA	2002	DBLP DOI BibTeX RDF
1	Olivier Bournez, Claude Kirchner	Probabilistic Rewrite Strategies. Applications to ELAN.	RTA	2002	DBLP DOI BibTeX RDF
1	Chuck C. Liang, Gopalan Nadathur	Tradeoffs in the Intensional Representation of Lambda Terms.	RTA	2002	DBLP DOI BibTeX RDF
1	Salvador Lucas	Termination of (Canonical) Context-Sensitive Rewriting.	RTA	2002	DBLP DOI BibTeX RDF	(infinitary) normalization, termination, term rewriting
1	Julien Forest	A Weak Calculus with Explicit Operators for Pattern Matching and Substitution.	RTA	2002	DBLP DOI BibTeX RDF
1	Germain Faure, Claude Kirchner	Exceptions in the Rewriting Calculus.	RTA	2002	DBLP DOI BibTeX RDF
1	Sylvain Lippi	in2 : A Graphical Interpreter for Interaction Nets.	RTA	2002	DBLP DOI BibTeX RDF
1	Janis Voigtländer	Conditions for Efficiency Improvement by Tree Transducer Composition.	RTA	2002	DBLP DOI BibTeX RDF
1	Paula Severi, Fer-Jan de Vries	An Extensional Böhm Model.	RTA	2002	DBLP DOI BibTeX RDF
1	Benoit Lecland, Pierre Réty	TTSLI: An Implementation of Tree-Tuple Synchronized Languages.	RTA	2002	DBLP DOI BibTeX RDF
1	Franz Baader, Cesare Tinelli	Combining Decision Procedures for Positive Theories Sharing Constructors.	RTA	2002	DBLP DOI BibTeX RDF
1	John C. Mitchell	Multiset Rewriting and Security Protocol Analysis.	RTA	2002	DBLP DOI BibTeX RDF
1	Alfons Geser	Loops of Superexponential Lengths in One-Rule String Rewriting.	RTA	2002	DBLP DOI BibTeX RDF	uniform termination, one-rule, single-rule Submission category: Regular research paper, termination, loop, string rewriting, semi-Thue system
1	Franz Baader	Engineering of Logics for the Content-Based Representation of Information.	RTA	2002	DBLP DOI BibTeX RDF
1	Sophie Tison (eds.)	Rewriting Techniques and Applications, 13th International Conference, RTA 2002, Copenhagen, Denmark, July 22-24, 2002, Proceedings	RTA	2002	DBLP DOI BibTeX RDF
1	Witold Charatonik, Jean-Marc Talbot	Atomic Set Constraints with Projection.	RTA	2002	DBLP DOI BibTeX RDF
1	Irène Durand	Autowrite: A Tool for Checking Properties of Term Rewriting Systems.	RTA	2002	DBLP DOI BibTeX RDF
1	Hiroyuki Seki, Toshinori Takai, Youhei Fujinaka, Yuichi Kaji	Layered Transducing Term Rewriting System and Its Recognizability Preserving Property.	RTA	2002	DBLP DOI BibTeX RDF
1	Richard Kennaway, Zurab Khasidashvili, Adolfo Piperno	Static Analysis of Modularity of beta-Reduction in the Hyperbalanced lambda-Calculus.	RTA	2002	DBLP DOI BibTeX RDF
1	Elias Tahhan-Bittar	Recursive Derivational Length Bounds for Confluent Term Rewrite Systems.	RTA	2002	DBLP DOI BibTeX RDF
1	Alessandro Berarducci, Corrado Böhm	General Recursion on Second Order Term Algebras.	RTA	2001	DBLP DOI BibTeX RDF
1	Jürgen Giesl, Deepak Kapur	Dependency Pairs for Equational Rewriting.	RTA	2001	DBLP DOI BibTeX RDF
1	Eduardo Bonelli, Delia Kesner, Alejandro Ríos 0001	From Higher-Order to First-Order Rewriting.	RTA	2001	DBLP DOI BibTeX RDF
1	Salvador Lucas	Transfinite Rewriting Semantics for Term Rewriting Systems.	RTA	2001	DBLP DOI BibTeX RDF
1	Horatiu Cirstea, Claude Kirchner, Luigi Liquori	Matching Power.	RTA	2001	DBLP DOI BibTeX RDF
1	Toshiyuki Yamada	Confluence and Termination of Simply Typed Term Rewriting Systems.	RTA	2001	DBLP DOI BibTeX RDF
1	Henk Barendregt	Computing and Proving.	RTA	2001	DBLP DOI BibTeX RDF
1	Christopher Lynch, Barbara Morawska 0001	Goal-Directed E-Unification.	RTA	2001	DBLP DOI BibTeX RDF
1	Aart Middeldorp (eds.)	Rewriting Techniques and Applications, 12th International Conference, RTA 2001, Utrecht, The Netherlands, May 22-24, 2001, Proceedings	RTA	2001	DBLP DOI BibTeX RDF
1	Zurab Khasidashvili, Mizuhito Ogawa, Vincent van Oostrom	Uniform Normalisation beyond Orthogonality.	RTA	2001	DBLP DOI BibTeX RDF

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