18. RTA 2007: Paris, France

• Xavier Leroy:
  Formal Verification of an Optimizing Compiler. 1
  Electronic Edition (link) BibTeX
• Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio:
  Challenges in Satisfiability Modulo Theories. 2-18
  Electronic Edition (link) BibTeX
• Frank Pfenning:
  On a Logical Foundation for Explicit Substitutions. 19
  Electronic Edition (link) BibTeX
• Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch:
  Intruders with Caps. 20-35
  Electronic Edition (link) BibTeX
• Emilie Balland, Paul Brauner, Radu Kopetz, Pierre-Etienne Moreau, Antoine Reilles:
  Tom: Piggybacking Rewriting on Java. 36-47
  Electronic Edition (link) BibTeX
• Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luka Le Roux:
  Rewriting Approximations for Fast Prototyping of Static Analyzers. 48-62
  Electronic Edition (link) BibTeX
• Thierry Boy de la Tour, Mnacho Echenim:
  Determining Unify-Stable Presentations. 63-77
  Electronic Edition (link) BibTeX
• Horatiu Cirstea, Germain Faure:
  Confluence of Pattern-Based Calculi. 78-92
  Electronic Edition (link) BibTeX
• Gilles Dowek, Olivier Hermant:
  A Simple Proof That Super-Consistency Implies Cut Elimination. 93-106
  Electronic Edition (link) BibTeX
• Irène Durand, Géraud Sénizergues:
  Bottom-Up Rewriting Is Inverse Recognizability Preserving. 107-121
  Electronic Edition (link) BibTeX
• Dominique Duval, Rachid Echahed, Frédéric Prost:
  Adjunction for Garbage Collection with Application to Graph Rewriting. 122-136
  Electronic Edition (link) BibTeX
• Rachid Echahed, Nicolas Peltier:
  Non Strict Confluent Rewrite Systems for Data-Structures with Pointers. 137-152
  Electronic Edition (link) BibTeX
• Santiago Escobar, José Meseguer:
  Symbolic Model Checking of Infinite-State Systems Using Narrowing. 153-168
  Electronic Edition (link) BibTeX
• José Espírito Santo:
  Delayed Substitutions. 169-183
  Electronic Edition (link) BibTeX
• Guillem Godoy, Eduard Huntingford:
  Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems. 184-199
  Electronic Edition (link) BibTeX
• Guillem Godoy, Eduard Huntingford, Ashish Tiwari:
  Termination of Rewriting with Right-Flat Rules. 200-213
  Electronic Edition (link) BibTeX
• Rémy Haemmerlé, François Fages:
  Abstract Critical Pairs and Confluence of Arbitrary Binary Relations. 214-228
  Electronic Edition (link) BibTeX
• Joe Hendrix, José Meseguer:
  On the Completeness of Context-Sensitive Order-Sorted Specifications. 229-245
  Electronic Edition (link) BibTeX
• Mark Hills, Grigore Rosu:
  KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis. 246-256
  Electronic Edition (link) BibTeX
• Kentaro Kikuchi:
  Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi. 257-272
  Electronic Edition (link) BibTeX
• Martin Korp, Aart Middeldorp:
  Proving Termination of Rewrite Systems Using Bounds. 273-287
  Electronic Edition (link) BibTeX
• Temur Kutsia, Jordi Levy, Mateu Villaret:
  Sequence Unification Through Currying. 288-302
  Electronic Edition (link) BibTeX
• Claude Marché, Hans Zantema:
  The Termination Competition. 303-313
  Electronic Edition (link) BibTeX
• Vincent van Oostrom:
  Random Descent. 314-328
  Electronic Edition (link) BibTeX
• Manfred Schmidt-Schauß:
  Correctness of Copy in Calculi with Letrec. 329-343
  Electronic Edition (link) BibTeX
• Lutz Straßburger:
  A Characterization of Medial as Rewriting Rule. 344-358
  Electronic Edition (link) BibTeX
• Makoto Tatsuta:
  The Maximum Length of Mu-Reduction in Lambda Mu-Calculus. 359-373
  Electronic Edition (link) BibTeX
• Lionel Vaux:
  On Linear Combinations of lambda -Terms. 374-388
  Electronic Edition (link) BibTeX
• Harald Zankl, Aart Middeldorp:
  Satisfying KBO Constraints. 389-403
  Electronic Edition (link) BibTeX
• Hans Zantema, Johannes Waldmann:
  Termination by Quasi-periodic Interpretations. 404-418
  Electronic Edition (link) BibTeX