Skip to main content
SpringerLink
Log in

Rewriting Techniques and Applications

20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009 Proceedings

  • Conference proceedings
  • © 2009

Overview

Editors:
  1. Ralf Treinen

    1. Laboratoire PPS, Université Paris Diderot - Paris 7, CNRS, Paris, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5595)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: RTA 2009.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (27 papers)

  1. Front Matter

    Download chapter PDF

  2. Automatic Termination

    • Johannes Waldmann
    Pages 1-16

  3. Loops under Strategies

    • René Thiemann, Christian Sternagel
    Pages 17-31

  4. Proving Termination of Integer Term Rewriting

    • Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke
    Pages 32-47

  5. Dependency Pairs and Polynomial Path Orders

    • Martin Avanzini, Georg Moser
    Pages 48-62

  6. Unique Normalization for Shallow TRS

    • Guillem Godoy, Florent Jacquemard
    Pages 63-77

  7. The Existential Fragment of the One-Step Parallel Rewriting Theory

    • Aleksy Schubert
    Pages 78-92

  8. Proving Confluence of Term Rewriting Systems Automatically

    • Takahito Aoto, Junichi Yoshida, Yoshihito Toyama
    Pages 93-102

  9. A Proof Theoretic Analysis of Intruder Theories

    • Alwen Tiu, Rajeev Goré
    Pages 103-117

  10. Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case

    • Helmut Seidl, Kumar Neeraj Verma
    Pages 118-132

  11. Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions

    • Sergiu Bursuc, Hubert Comon-Lundh
    Pages 133-147

  12. YAPA: A Generic Tool for Computing Intruder Knowledge

    • Mathieu Baudet, Véronique Cortier, Stéphanie Delaune
    Pages 148-163

  13. Well-Definedness of Streams by Termination

    • Hans Zantema
    Pages 164-178

  14. Modularity of Convergence in Infinitary Rewriting

    • Stefan Kahrs
    Pages 179-193

  15. A Heterogeneous Pushout Approach to Term-Graph Transformation

    • Dominique Duval, Rachid Echahed, Frédéric Prost
    Pages 194-208

  16. An Explicit Framework for Interaction Nets

    • Marc de Falco
    Pages 209-223

  17. Dual Calculus with Inductive and Coinductive Types

    • Daisuke Kimura, Makoto Tatsuta
    Pages 224-238

  18. Comparing Böhm-Like Trees

    • Jeroen Ketema
    Pages 239-254

  19. The Derivational Complexity Induced by the Dependency Pair Method

    • Georg Moser, Andreas Schnabl
    Pages 255-269

  20. Local Termination

    • Jörg Endrullis, Roel de Vrijer, Johannes Waldmann
    Pages 270-284
Back to top

Other volumes

  1. Rewriting Techniques and Applications

Keywords

Editors and Affiliations

  • Laboratoire PPS, Université Paris Diderot - Paris 7, CNRS, Paris, France

    Ralf Treinen

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation