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