Rewriting Techniques and Applications [electronic resource] : 13th International Conference, RTA 2002, Copenhagen, Denmark, July 22-24, 2002 Proceedings /

Invited Talks -- Combining Shostak Theories -- Multiset Rewriting and Security Protocol Analysis -- Engineering of Logics for the Content-Based Representation of Information -- Regular Papers, Application Papers -- Axiomatic Rewriting Theory VI: Residual Theory Revisited -- Static Analysis of Modularity of ?-Reduction in the Hyperbalanced ?-Calculus -- Exceptions in the Rewriting Calculus -- Deriving Focused Lattice Calculi -- Layered Transducing Term Rewriting System and Its Recognizability Preserving Property -- Decidability and Closure Properties of Equational Tree Languages -- Regular Sets of Descendants by Some Rewrite Strategies -- Rewrite Games -- An Extensional Böhm Model -- A Weak Calculus with Explicit Operators for Pattern Matching and Substitution -- Tradeoffs in the Intensional Representation of Lambda Terms -- Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae -- Conditions for Efficiency Improvement by Tree Transducer Composition -- Rewriting Strategies for Instruction Selection -- Probabilistic Rewrite Strategies. Applications to ELAN -- Loops of Superexponential Lengths in One-Rule String Rewriting -- Recursive Derivational Length Bounds for Confluent Term Rewrite Systems Research Paper -- Termination of (Canonical) Context-Sensitive Rewriting -- Atomic Set Constraints with Projection -- Currying Second-Order Unification Problems -- A Decidable Variant of Higher Order Matching -- Combining Decision Procedures for Positive Theories Sharing Constructors -- System Descriptions -- JITty: A Rewriter with Strategy Annotations -- Autowrite: A Tool for Checking Properties of Term Rewriting Systems -- TTSLI: An Implementation of Tree-Tuple Synchronized Languages -- in2: A Graphical Interpreter for Interaction Nets.