Contents of the Proceedings of the
14th International Conference on Rewriting Techniques and Applications.
Valencia, Spain, June 9-11, 2003.
Lecture Notes in Computer Science, Vol. 2706, Springer.
Editor: Robert Nieuwenhuis.
Invited Talk
- Patrick Lincoln,
Symbolic Systems Biology
(page 1).
Regular Papers
- Gilles Dowek,
Confluence as a cut elimination property
(pages 2-13).
- Steven Eker,
Associative-Commutative Rewriting on Large Terms
(pages 14-29).
- Olivier Bournez, Guy-Marie Come, Valérie Conraud,
Hélène Kirchner and Liliana Ibanescu,
A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms
(pages 30-45).
- Francois-Régis Sinot, Maribel Fernández and Ian Mackie,
Efficient Reductions with Director Strings
(pages 46-60).
- Olivier Bournez, Mathieu Hoyrup,
Rewriting Logic and Probabilities
(pages 61-75).
System Description
- Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer and Carolyn Talcott,
Maude 2.0
(pages 76-87).
Regular Papers
- J. B. Wells, Detlef Plump and Fairouz Kamareddine,
Diagrams for Meaning Preservation
(pages 88-106).
- Julien Forest and Delia Kesner,
Expression Reduction Systems with Patterns
(pages 107-122).
- H. J. Sander Bruggink,
Residuals in Higher-Order Rewriting
(pages 123-137).
System Description
- Adam Granicz, Daniel M. Zimmerman and Jason Hickey,
Rewriting UNITY
(pages 138-147).
Regular Papers
- Hubert Comon-Lundh and Véronique Cortier,
New decidability results for fragments of first order logic and application to cryptographic protocols
(pages 148-164).
- Deepak Kapur, Paliath Narendran and Lida Wang,
An E-unification algorithm for analyzing protocols that use modular exponentiation
(pages 165-179).
- Kumar Neeraj Verma,
Two-Way Equational Tree Automata for AC-like Theories: Decidability and Closure Properties
(pages 180-196).
System Description
- Feng Chen, Grigore Rosu and Ram Prasad Venkatesan,
Rule-based Analysis of Dimensional Safety
(pages 197-207).
Invited Talk
- Jean-Louis Giavitto,
Topological Collections, Transformations and their Application to the Modelling and the Simulation of Dynamical Systems
(pages 208-233).
Regular Papers
- Sylvain Salvati and Philippe de Groote,
On the complexity of higher-order matching in the linear lambda-calculus
(pages 234-245).
- Silvano Dal Zilio and Denis Lugiez,
XML Schema, Tree Logic and Sheaves Automata
(pages 246-263).
- René Thiemann and Jürgen Giesl,
Size-Change Termination for Term Rewriting
(pages 264-278).
- Cristina Borralleras and Albert Rubio,
Monotonic AC-Compatible Semantic Path Orderings
(pages 279-295).
- Georg Moser and Andreas Weiermann,
Relating derivation lengths with the slow-growing hierarchy directly
(pages 296-310).
System Description
- Nao Hirokawa and Aart Middeldorp,
Tsukuba Termination Tool
(pages 311-320).
Regular Papers
- Jürgen Giesl and Hans Zantema,
Liveness in Rewriting
(pages 321-336).
- Gilles Barthe and Sorin Stratulat,
Validation of the JavaCard Platform with Implicit Induction Techniques
(pages 337-351).
- Pascal Urso and Emmanuel Kounalis,
"Term Partition" for Mathematical Induction
(pages 352-366).
System Description
- Temur Kutsia,
The Equational Prover of THEOREMA
(pages 367-379).
Regular Papers
- Takahito Aoto and Toshiyuki Yamada,
Termination of Simply Typed Term Rewriting Systems by Translation and Labelling
(pages 380-394).
- Frédéric Blanqui,
Rewriting Modulo in Deduction Modulo
(pages 395-409).
- Alfons Geser,
Termination of String Rewriting Rules That Have One Pair of Overlaps
(pages 410-423).
System Description
- M. G. J. van den Brand, P.-E. Moreau and J. J. Vinju,
Environments for Term Rewriting Engines for Free!
(pages 424-435).
Invited Talk
- David McAllester,
A Logical Algorithm for ML Type Inference
(pages 436-451).
Regular Papers
- Neil Ghani and Anne Heyworth,
A Rewriting Alternative to Reidermeister-Schreier
(pages 452-466).
- Zurab Khasidashvili and John Glauert,
Stable Computational Semantics of Conflict-free Rewrite Systems (Partial Orders with Duplication)
(pages 467-482).
- Hitoshi Ohsaki, Hiroyuki Seki and Toshinori Takai,
Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism
(pages 483-498).
- Grigore Rosu and Mahesh Viswanathan,
Testing Extended Regular Language Membership Incrementally by Rewriting
(pages 499-514).