↓ Skip to main content

Term rewriting and applications: 18th international conference, RTA 2007, Paris, France, June 26-28, 2007 : proceedings

Overview of attention for book
Cover of 'Term rewriting and applications: 18th international conference, RTA 2007, Paris, France, June 26-28, 2007 : proceedings'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Formal Verification of an Optimizing Compiler
  3. Altmetric Badge
    Chapter 2 Challenges in Satisfiability Modulo Theories
  4. Altmetric Badge
    Chapter 3 On a Logical Foundation for Explicit Substitutions
  5. Altmetric Badge
    Chapter 4 Intruders with Caps
  6. Altmetric Badge
    Chapter 5 Tom: Piggybacking Rewriting on Java
  7. Altmetric Badge
    Chapter 6 Rewriting Approximations for Fast Prototyping of Static Analyzers
  8. Altmetric Badge
    Chapter 7 Determining Unify-Stable Presentations
  9. Altmetric Badge
    Chapter 8 Confluence of Pattern-Based Calculi
  10. Altmetric Badge
    Chapter 9 A Simple Proof That Super-Consistency Implies Cut Elimination
  11. Altmetric Badge
    Chapter 10 Bottom-Up Rewriting Is Inverse Recognizability Preserving
  12. Altmetric Badge
    Chapter 11 Adjunction for Garbage Collection with Application to Graph Rewriting
  13. Altmetric Badge
    Chapter 12 Non Strict Confluent Rewrite Systems for Data-Structures with Pointers
  14. Altmetric Badge
    Chapter 13 Symbolic Model Checking of Infinite-State Systems Using Narrowing
  15. Altmetric Badge
    Chapter 14 Delayed Substitutions
  16. Altmetric Badge
    Chapter 15 Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems
  17. Altmetric Badge
    Chapter 16 Termination of Rewriting with Right-Flat Rules
  18. Altmetric Badge
    Chapter 17 Abstract Critical Pairs and Confluence of Arbitrary Binary Relations
  19. Altmetric Badge
    Chapter 18 On the Completeness of Context-Sensitive Order-Sorted Specifications
  20. Altmetric Badge
    Chapter 19 KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis
  21. Altmetric Badge
    Chapter 20 Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi
  22. Altmetric Badge
    Chapter 21 Proving Termination of Rewrite Systems Using Bounds
  23. Altmetric Badge
    Chapter 22 Sequence Unification Through Currying
  24. Altmetric Badge
    Chapter 23 The Termination Competition
  25. Altmetric Badge
    Chapter 24 Random Descent
  26. Altmetric Badge
    Chapter 25 Correctness of Copy in Calculi with Letrec
  27. Altmetric Badge
    Chapter 26 A Characterization of Medial as Rewriting Rule
  28. Altmetric Badge
    Chapter 27 The Maximum Length of Mu-Reduction in Lambda Mu-Calculus
  29. Altmetric Badge
    Chapter 28 On Linear Combinations of λ -Terms
  30. Altmetric Badge
    Chapter 29 Satisfying KBO Constraints
  31. Altmetric Badge
    Chapter 30 Termination by Quasi-periodic Interpretations
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
6 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Term rewriting and applications: 18th international conference, RTA 2007, Paris, France, June 26-28, 2007 : proceedings
Published by
Springer, January 2007
DOI 10.1007/978-3-540-73449-9
ISBNs
978-3-54-073447-5, 978-3-54-073449-9
Authors

Baader, Franz

Editors

Baader, Franz

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 6 100%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 2 33%
Student > Bachelor 1 17%
Librarian 1 17%
Researcher 1 17%
Unknown 1 17%
Readers by discipline Count As %
Computer Science 5 83%
Unknown 1 17%