Rewriting Techniques and Applications: 13th International Conference, RTA 2002 Copenhagen, Denmark, July 22–24, 2002 Proceedings

Natarajan Shankar, Harald Rueß (auth.), Sophie Tison (eds.)3540439161, 9783540439165

This book constitutes the refereed proceedings of the 13th International Conference on Rewriting Techniques and Applications, RTA 2002, held in Copenhagen, Denmark, in July 2002.
The 20 regular papers, two application papers, and four system descriptions presented together with three invited contributions were carefully reviewed and selected from 49 submissions. All current aspects of rewriting are addressed.

---

Table of contents :
Combining Shostak Theories….Pages 1-18
Multiset Rewriting and Security Protocol Analysis….Pages 19-22
Engineering of Logics for the Content-Based Representation of Information….Pages 23-23
Axiomatic Rewriting Theory VI: Residual Theory Revisited….Pages 24-50
Static Analysis of Modularity of β-Reduction in the Hyperbalanced λ-Calculus….Pages 51-65
Exceptions in the Rewriting Calculus….Pages 66-82
Deriving Focused Lattice Calculi….Pages 83-97
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property….Pages 98-113
Decidability and Closure Properties of Equational Tree Languages….Pages 114-128
Regular Sets of Descendants by Some Rewrite Strategies….Pages 129-143
Rewrite Games….Pages 144-158
An Extensional Böhm Model….Pages 159-173
A Weak Calculus with Explicit Operators for Pattern Matching and Substitution….Pages 174-191
Tradeoffs in the Intensional Representation of Lambda Terms….Pages 192-206
Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae….Pages 207-221
Conditions for Efficiency Improvement by Tree Transducer Composition….Pages 222-236
Rewriting Strategies for Instruction Selection….Pages 237-251
Probabilistic Rewrite Strategies. Applications to ELAN….Pages 252-266
Loops of Superexponential Lengths in One-Rule String Rewriting….Pages 267-280
Recursive Derivational Length Bounds for Confluent Term Rewrite Systems Research Paper….Pages 281-295
Termination of (Canonical) Context-Sensitive Rewriting….Pages 296-310
Atomic Set Constraints with Projection….Pages 311-325
Currying Second-Order Unification Problems….Pages 326-339
A Decidable Variant of Higher Order Matching….Pages 340-351
Combining Decision Procedures for Positive Theories Sharing Constructors….Pages 352-366
JITty: A Rewriter with Strategy Annotations….Pages 367-370
Autowrite: A Tool for Checking Properties of Term Rewriting Systems….Pages 371-375
TTSLI: An Implementation of Tree-Tuple Synchronized Languages….Pages 376-379
in 2 : A Graphical Interpreter for Interaction Nets….Pages 380-385