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