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.
Author(s): Patrick Lincoln (auth.), Robert Nieuwenhuis (eds.)
Series: Lecture Notes in Computer Science 2706
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2003
Language: English
Commentary: Correct bookmarks, cover, pagination
Pages: 518
Tags: Computer Science, general
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
