default search action
14th RTA 2003: Valencia, Spain
- Robert Nieuwenhuis
:
Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings. Lecture Notes in Computer Science 2706, Springer 2003, ISBN 3-540-40254-3 - Patrick Lincoln:
Invited Talk: Symbolic Systems Biology. 1 - Gilles Dowek:
Confluence as a Cut Elimination Property. 2-13 - Steven Eker:
Associative-Commutative Rewriting on Large Terms. 14-29 - 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. 30-45 - François-Régis Sinot, Maribel Fernández, Ian Mackie:
Efficient Reductions with Director Strings. 46-60 - Olivier Bournez, Mathieu Hoyrup:
Rewriting Logic and Probabilities. 61-75 - Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott:
The Maude 2.0 System. 76-87 - J. B. Wells, Detlef Plump, Fairouz Kamareddine:
Diagrams for Meaning Preservation. 88-106 - Julien Forest, Delia Kesner:
Expression Reduction Systems with Patterns. 107-122 - H. J. Sander Bruggink:
Residuals in Higher-Order Rewriting. 123-137 - Adam Granicz, Daniel M. Zimmerman, Jason Hickey:
Rewriting UNITY. 138-147 - Hubert Comon-Lundh, Véronique Cortier:
New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols. 148-164 - Deepak Kapur, Paliath Narendran, Lida Wang:
An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation. 165-179 - Kumar Neeraj Verma:
Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties. 180-196 - Feng Chen, Grigore Rosu, Ram Prasad Venkatesan:
Rule-Based Analysis of Dimensional Safety. 197-207 - Jean-Louis Giavitto
Invited Talk: Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems. 208-233 - Sylvain Salvati, Philippe de Groote:
On the Complexity of Higher-Order Matching in the Linear lambda-Calculus. 234-245 - Silvano Dal-Zilio
XML Schema, Tree Logic and Sheaves Automata. 246-263 - René Thiemann
Size-Change Termination for Term Rewriting. 264-278 - Cristina Borralleras
Monotonic AC-Compatible Semantic Path Orderings. 279-295 - Georg Moser, Andreas Weiermann:
Relating Derivation Lengths with the Slow-Growing Hierarchy Directly. 296-310 - Nao Hirokawa, Aart Middeldorp:
Tsukuba Termination Tool. 311-320 - Jürgen Giesl
Liveness in Rewriting. 321-336 - Gilles Barthe, Sorin Stratulat:
Validation of the JavaCard Platform with Implicit Induction Techniques. 337-351 - Pascal Urso, Emmanuel Kounalis:
"Term Partition" for Mathematical Induction. 352-366 - Temur Kutsia
Equational Prover of THEOREMA. 367-379 - Takahito Aoto, Toshiyuki Yamada:
Termination of Simply Typed Term Rewriting by Translation and Labelling. 380-394 - Frédéric Blanqui
Rewriting Modulo in Deduction Modulo. 395-409 - Alfons Geser:
Termination of String Rewriting Rules That Have One Pair of Overlaps. 410-423 - Mark van den Brand
Environments for Term Rewriting Engines for Free! 424-435 - David A. McAllester:
Joint RTA-TLCA Invited Talk: A Logical Algorithm for ML Type Inference. 436-451 - Neil Ghani, Anne Heyworth:
A Rewriting Alternative to Reidemeister-Schreier. 452-466 - Zurab Khasidashvili, John R. W. Glauert:
Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication). 467-482 - Hitoshi Ohsaki, Hiroyuki Seki, Toshinori Takai:
Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism. 483-498 - Grigore Rosu, Mahesh Viswanathan:
Testing Extended Regular Language Membership Incrementally by Rewriting. 499-514
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-26 00:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: