Rewriting Techniques and Applications 20th International Conference, RTA 2009 Brasília, Brazil, June 29 - July 1, 2009 Proceedings /
| Corporate Author: | |
|---|---|
| Other Authors: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2009.
|
| Series: | Lecture Notes in Computer Science,
5595 |
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Table of Contents:
- Automatic Termination
- Loops under Strategies
- Proving Termination of Integer Term Rewriting
- Dependency Pairs and Polynomial Path Orders
- Unique Normalization for Shallow TRS
- The Existential Fragment of the One-Step Parallel Rewriting Theory
- Proving Confluence of Term Rewriting Systems Automatically
- A Proof Theoretic Analysis of Intruder Theories
- Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case
- Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
- YAPA: A Generic Tool for Computing Intruder Knowledge
- Well-Definedness of Streams by Termination
- Modularity of Convergence in Infinitary Rewriting
- A Heterogeneous Pushout Approach to Term-Graph Transformation
- An Explicit Framework for Interaction Nets
- Dual Calculus with Inductive and Coinductive Types
- Comparing Böhm-Like Trees
- The Derivational Complexity Induced by the Dependency Pair Method
- Local Termination
- VMTL–A Modular Termination Laboratory
- Tyrolean Termination Tool 2
- From Outermost to Context-Sensitive Rewriting
- A Fully Abstract Semantics for Constructor Systems
- The -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)
- Unification in the Description Logic
- Unification with Singleton Tree Grammars
- Unification and Narrowing in Maude 2.4.
