Rewriting Modulo in Deduction Modulo F. Blanqui
Validation of the JavaCard Platform with Implicit Induction Techniques G. Barthe and S. Stratulat
XML Schema, Tree Logic and Sheaves Automata S. Dal Zilio and D. Lugiez
Termination of String Rewriting Rules That Have One Pair of Overlaps A. Geser
New decidability results for fragments of first order logic and application to cryptographic protocols H. Comon-Lundh and V. Cortier
Associative-Commutative Rewriting on Large Terms S. Eker
Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism H. Ohsaki and H. Seki and T. Takai
Termination of Simply Typed Term Rewriting Systems by Translation and Labelling T. Aoto and T. Yamada
Liveness in Rewriting J. Giesl and H. Zantema
Rewriting Logic and Probabilities O. Bournez and M. Hoyrup
Efficient Reductions with Director Strings F.-R. Sinot and M. Fernández and I. Mackie
A Rewriting Alternative to Reidemeister-Schrier N. Ghani and A. Heyworth
On the complexity of higher-order matching in the linear lambda-calculus S. Salvati and P. de Groote
Testing Extended Regular Language Membership Incrementally by Rewriting G. Rosu and M. Viswanathan
Relating derivation lengths with the slow growing hierarchy directly G. Moser and A. Weiermann
Stable Computational Semantics of Conflict-free Rewrite Systems (Partial Orders with Duplication) Z. Khasidashvili and J. Glauert
Residuals in Higher-Order Rewriting S. Bruggink
Confluence as a cut elimination property G. Dowek
Two-Way Equational Tree Automata for AC-like Theories: Decidability and Closure Properties K.N. Verma
Size-Change Termination for Term Rewriting R. Thiemann and J. Giesl
Expression Reduction Systems with Patterns J. Forest and D. Kesner
Diagrams for Meaning Preservation J.B. Wells and D. Plump and F. Kamareddine
Monotonic AC-compatible semantic path orderings C. Borralleras and A. Rubio
"Term Partition" for Mathematical Induction P. Urso and E. Kounalis
A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms O. Bournez and G.-M. Come and V. Conraud and H. Kirchner and L. Ibanescu
An E-unification algorithm for analyzing protocols that use modular exponentiation D. Kapur and P. Narendran and L. Wang
The Equational Prover of THEOREMA T. Kutsia
Tsukuba Termination Tool N. Hirokawa and A. Middeldorp
Rule-based Analysis of Dimensional Safety F. Chen and G. Rosu and R.P. Venkatesan
Environments for Term Rewriting Engines for Free! M. van den Brand and P.-E. Moreau and J. Vinju
Rewriting UNITY A. Granicz and D. Zimmerman and J. Hickey
The Maude 2.0 System M. Clavel and F. Durán and S. Eker and P. Lincoln and N. Martí-Oliet and J. Meseguer and C. Talcott