Rewriting Techniques and Applications: 14th International Conference, Rta 2003, Valencia, Spain, June 2003 : Proceedings

by International Conference on Rewriting Techniques and Applications (14th : 2003 : Valencia, Spain); Nieuwenhuis, Robert

• ISBN13: 9783540402541
• ISBN10: 3540402543
• Format: Paperback
• Copyright: 2003-08-01
• Publisher: Springer Verlag

Summary

This book constitutes the refereed proceedings of the 14th International Conference on Rewriting Techniques and Applications, RTA 2003, held in Valencia, Spain in June 2003. The 26 revised regular papers and 6 system descriptions presented together with 3 invited contributions were carefully reviewed and selected from 61 submissions. All current aspects of rewriting are addressed.

Table of Contents

Symbolic Systems Biology	p. 1
Confluence as a Cut Elimination Property	p. 2
Associative-Commutative Rewriting on Large Terms	p. 14
A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms	p. 30
Efficient Reductions with Director Strings	p. 46
Rewriting Logic and Probabilities	p. 61
The Maude 2.0 System	p. 76
Diagrams for Meaning Preservation	p. 88
Expression Reduction Systems with Patterns	p. 107
Residuals in Higher-Order Rewriting	p. 123
Rewriting UNITY	p. 138
New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols	p. 148
An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation	p. 165
Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties	p. 180
Rule-Based Analysis of Dimensional Safety	p. 197
Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems	p. 208
On the Complexity of Higher-Order Matching in the Linear [lambda]-Calculus	p. 234
XML Schema, Tree Logic and Sheaves Automata	p. 246
Size-Change Termination for Term Rewriting	p. 264
Monotonic AC-Compatible Semantic Path Orderings	p. 279
Relating Deviation Lengths with the Slow-Growing Hierarchy Directly	p. 296
Tsukuba Termination Tool	p. 311
Liveness in Rewriting	p. 321
Validation of the JavaCard Platform with Implicit Induction Techniques	p. 337
"Term Partition" for Mathematical Induction	p. 352
Equational Prover of Theorema	p. 367
Termination of Simply Typed Term Rewriting by Translation and Labelling	p. 380
Rewriting Modulo in Deduction Modulo	p. 395
Termination of String Rewriting Rules That Have One Pair of Overlaps	p. 410
Environments for Term Rewriting Engines for Free!	p. 424
A Logical Algorithm for ML Type Inference	p. 436
A Rewriting Alternative to Reidemeister-Schreier	p. 452
Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication)	p. 467
Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism	p. 483
Testing Extended Regular Language Membership Incrementally by Rewriting	p. 499
Author Index	p. 515
Table of Contents provided by Blackwell. All Rights Reserved.