External Links

Cite Key

Statistics

  • Reviews: 0
  • Bibliographies: 0

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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

Sophie Tison, editor, Rewriting Techniques and Applications, 13th International Conference, RTA 2002, Copenhagen, Denmark, July 22-24, 2002, Proceedings. Volume 2378 of Lecture Notes in Computer Science, Springer, 2002.

Conference: RTA 2002

Abstract

Abstract is missing.

Table of Contents

1-18Combining Shostak Theories
Natarajan Shankar, Harald Rueß
19-22Multiset Rewriting and Security Protocol Analysis
John C. Mitchell
23Engineering of Logics for the Content-Based Representation of Information
Franz Baader
24-50Axiomatic Rewriting Theory VI Residual Theory Revisited
Paul-André Melliès
51-65Static Analysis of Modularity of beta-Reduction in the Hyperbalanced lambda-Calculus
Richard Kennaway, Zurab Khasidashvili, Adolfo Piperno
66-82Exceptions in the Rewriting Calculus
Germain Faure, Claude Kirchner
83-97Deriving Focused Lattice Calculi
Georg Struth
98-113Layered Transducing Term Rewriting System and Its Recognizability Preserving Property
Hiroyuki Seki, Toshinori Takai, Youhei Fujinaka, Yuichi Kaji
114-128Decidability and Closure Properties of Equational Tree Languages
Hitoshi Ohsaki, Toshinori Takai
129-143Regular Sets of Descendants by Some Rewrite Strategies
Pierre Réty, Julie Vuotto
144-158Rewrite Games
Johannes Waldmann
159-173An Extensional Böhm Model
Paula Severi, Fer-Jan de Vries
174-191A Weak Calculus with Explicit Operators for Pattern Matching and Substitution
Julien Forest
192-206Tradeoffs in the Intensional Representation of Lambda Terms
Chuck Liang, Gopalan Nadathur
207-221Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae
David Déharbe, Anamaria Martins Moreira, Christophe Ringeissen
222-236Conditions for Efficiency Improvement by Tree Transducer Composition
Janis Voigtländer
237-251Rewriting Strategies for Instruction Selection
Martin Bravenboer, Eelco Visser
252-266Probabilistic Rewrite Strategies. Applications to ELAN
Olivier Bournez, Claude Kirchner
267-280Loops of Superexponential Lengths in One-Rule String Rewriting
Alfons Geser
281-295Recursive Derivational Length Bounds for Confluent Term Rewrite Systems
Elias Tahhan-Bittar
296-310Termination of (Canonical) Context-Sensitive Rewriting
Salvador Lucas
311-325Atomic Set Constraints with Projection
Witold Charatonik, Jean-Marc Talbot
326-339Currying Second-Order Unification Problems
Jordi Levy, Mateu Villaret
340-351A Decidable Variant of Higher Order Matching
Daniel J. Dougherty, Tomasz Wierzbicki
352-366Combining Decision Procedures for Positive Theories Sharing Constructors
Franz Baader, Cesare Tinelli
367-370JITty: A Rewriter with Strategy Annotations
Jaco van de Pol
371-375Autowrite: A Tool for Checking Properties of Term Rewriting Systems
Irène Durand
376-379TTSLI: An Implementation of Tree-Tuple Synchronized Languages
Benoit Lecland, Pierre Réty
380-386in:::2::: : A Graphical Interpreter for Interaction Nets
Sylvain Lippi
runs on