Rewriting Techniques and Applications: 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings (Lecture Notes in Computer Science)

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. Symbolic Systems Biology....Pages 1-1 Confluence as a Cut Elimination Property....Pages 2-13 Associative-Commutative Rewriting on Large Terms....Pages 14-29 A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms....Pages 30-45 Efficient Reductions with Director Strings....Pages 46-60 Rewriting Logic and Probabilities....Pages 61-75 The Maude 2.0 System....Pages 76-87 Diagrams for Meaning Preservation....Pages 88-106 Expression Reduction Systems with Patterns....Pages 107-122 Residuals in Higher-Order Rewriting....Pages 123-137 Rewriting UNITY....Pages 138-147 New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols....Pages 148-164 An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation....Pages 165-179 Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties....Pages 180-196 Rule-Based Analysis of Dimensional Safety....Pages 197-207 Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems....Pages 208-233 On the Complexity of Higher-Order Matching in the Linear λ-Calculus....Pages 234-245 XML Schema, Tree Logic and Sheaves Automata....Pages 246-263 Size-Change Termination for Term Rewriting....Pages 264-278 Monotonic AC-Compatible Semantic Path Orderings....Pages 279-295 Relating Derivation Lengths with the Slow-Growing Hierarchy Directly....Pages 296-310 Tsukuba Termination Tool....Pages 311-320 Liveness in Rewriting....Pages 321-336 Validation of the JavaCard Platform with Implicit Induction Techniques....Pages 337-351 “Term Partition” for Mathematical Induction....Pages 352-366 Equational Prover of Theorema ....Pages 367-379 Termination of Simply Typed Term Rewriting by Translation and Labelling....Pages 380-394 Rewriting Modulo in Deduction Modulo....Pages 395-409 Termination of String Rewriting Rules That Have One Pair of Overlaps....Pages 410-423 Environments for Term Rewriting Engines for Free!....Pages 424-435 A Logical Algorithm for ML Type Inference....Pages 436-451 A Rewriting Alternative to Reidemeister-Schreier....Pages 452-466 Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication)....Pages 467-482 Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism....Pages 483-498 Testing Extended Regular Language Membership Incrementally by Rewriting....Pages 499-514 Rewriting Techniques and Applications: 14th International Conference, RTA 2003 Valencia, Spain, June 9–11, 2003 Proceedings Author: Robert Nieuwenhuis Published by Springer Berlin Heidelberg ISBN: 978-3-540-40254-1 DOI: 10.1007/3-540-44881-0 Table of Contents: Symbolic Systems Biology Confluence as a Cut Elimination Property Associative-Commutative Rewriting on Large Terms A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms Efficient Reductions with Director Strings Rewriting Logic and Probabilities The Maude 2.0 System Diagrams for Meaning Preservation Expression Reduction Systems with Patterns Residuals in Higher-Order Rewriting Rewriting UNITY New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties Rule-Based Analysis of Dimensional Safety Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems On the Complexity of Higher-Order Matching in the Linear λ-Calculus XML Schema, Tree Logic and Sheaves Automata Size-Change Termination for Term Rewriting Monotonic AC-Compatible Semantic Path Orderings

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.

Technological breakthroughs have enabled complete genomic sequencing and proteomic study of many species, fueling exponential growth in the available biological data relevant to important biological functions.