Skip to main content
  • Conference proceedings
  • © 2007

Term Rewriting and Applications

18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings

Editors:

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

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

Conference series link(s): RTA: International Conference on Rewriting Techniques and Applications

Conference proceedings info: RTA 2007.

Buy it now

Buying options

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

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

Table of contents (30 papers)

  1. Front Matter

  2. Challenges in Satisfiability Modulo Theories

    • Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio
    Pages 2-18
  3. Intruders with Caps

    • Siva Anantharaman, Paliath Narendran, Michael Rusinowitch
    Pages 20-35
  4. Tom: Piggybacking Rewriting on Java

    • Emilie Balland, Paul Brauner, Radu Kopetz, Pierre-Etienne Moreau, Antoine Reilles
    Pages 36-47
  5. Rewriting Approximations for Fast Prototyping of Static Analyzers

    • Yohan Boichut, Thomas Genet, Thomas Jensen, Luka Le Roux
    Pages 48-62
  6. Determining Unify-Stable Presentations

    • Thierry Boy de la Tour, Mnacho Echenim
    Pages 63-77
  7. Confluence of Pattern-Based Calculi

    • Horatiu Cirstea, Germain Faure
    Pages 78-92
  8. A Simple Proof That Super-Consistency Implies Cut Elimination

    • Gilles Dowek, Olivier Hermant
    Pages 93-106
  9. Bottom-Up Rewriting Is Inverse Recognizability Preserving

    • Irène Durand, Géraud Sénizergues
    Pages 107-121
  10. Adjunction for Garbage Collection with Application to Graph Rewriting

    • Dominique Duval, Rachid Echahed, Frederic Prost
    Pages 122-136
  11. Non Strict Confluent Rewrite Systems for Data-Structures with Pointers

    • Rachid Echahed, Nicolas Peltier
    Pages 137-152
  12. Symbolic Model Checking of Infinite-State Systems Using Narrowing

    • Santiago Escobar, José Meseguer
    Pages 153-168
  13. Delayed Substitutions

    • José Espírito Santo
    Pages 169-183
  14. Termination of Rewriting with Right-Flat Rules

    • Guillem Godoy, Eduard Huntingford, Ashish Tiwari
    Pages 200-213
  15. Abstract Critical Pairs and Confluence of Arbitrary Binary Relations

    • Rémy Haemmerlé, François Fages
    Pages 214-228
  16. On the Completeness of Context-Sensitive Order-Sorted Specifications

    • Joe Hendrix, José Meseguer
    Pages 229-245

Other Volumes

  1. Term Rewriting and Applications

Bibliographic Information

Buy it now

Buying options

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