Term Rewriting and Applications: 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007. Proceedings

Xavier Leroy (auth.), Franz Baader (eds.)3540734473, 9783540734475

The 18th International Conference on Rewriting Techniques and Applications, held in Paris, France in June 2007, featured presentations and discussions centering on some of the latest advances in the field. This volume presents the proceedings from that meeting.

Twenty-four revised full papers are presented, along with three systems description papers and three invited talks. Each of the papers was subjected to a careful review process. The editor has ensured that they all meet the highest standards of research and scholarship.

Papers cover current research on all aspects of rewriting, including applications, foundational issues, frameworks, implementations, and semantics. This is recommended reading for anyone who wants to learn more about some of the latest advances in rewriting techniques and applications.

---

Table of contents :
Front Matter….Pages –
Formal Verification of an Optimizing Compiler….Pages 1-1
Challenges in Satisfiability Modulo Theories….Pages 2-18
On a Logical Foundation for Explicit Substitutions….Pages 19-19
Intruders with Caps….Pages 20-35
Tom: Piggybacking Rewriting on Java….Pages 36-47
Rewriting Approximations for Fast Prototyping of Static Analyzers….Pages 48-62
Determining Unify-Stable Presentations….Pages 63-77
Confluence of Pattern-Based Calculi….Pages 78-92
A Simple Proof That Super-Consistency Implies Cut Elimination….Pages 93-106
Bottom-Up Rewriting Is Inverse Recognizability Preserving….Pages 107-121
Adjunction for Garbage Collection with Application to Graph Rewriting….Pages 122-136
Non Strict Confluent Rewrite Systems for Data-Structures with Pointers….Pages 137-152
Symbolic Model Checking of Infinite-State Systems Using Narrowing….Pages 153-168
Delayed Substitutions….Pages 169-183
Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems….Pages 184-199
Termination of Rewriting with Right-Flat Rules….Pages 200-213
Abstract Critical Pairs and Confluence of Arbitrary Binary Relations….Pages 214-228
On the Completeness of Context-Sensitive Order-Sorted Specifications….Pages 229-245
KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis….Pages 246-256
Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi….Pages 257-272
Proving Termination of Rewrite Systems Using Bounds….Pages 273-287
Sequence Unification Through Currying….Pages 288-302
The Termination Competition….Pages 303-313
Random Descent….Pages 314-328
Correctness of Copy in Calculi with Letrec….Pages 329-343
A Characterization of Medial as Rewriting Rule….Pages 344-358
The Maximum Length of Mu-Reduction in Lambda Mu-Calculus….Pages 359-373
On Linear Combinations of λ -Terms….Pages 374-388
Satisfying KBO Constraints….Pages 389-403
Termination by Quasi-periodic Interpretations….Pages 404-418
Back Matter….Pages –