Term Rewriting and Applications

1. Partial Inversion of Constructor Term Rewriting Systems

   • Naoki Nishida, Masahiko Sakai, Toshiki Sakabe

   Pages 264-278

2. Natural Narrowing for General Term Rewriting Systems

   • Santiago Escobar, José Meseguer, Prasanna Thati

   Pages 279-293

3. The Finite Variant Property: How to Get Rid of Some Algebraic Properties

   • Hubert Comon-Lundh, Stéphanie Delaune

   Pages 294-307

4. Intruder Deduction for AC-Like Equational Theories with Homomorphisms

   • Pascal Lafourcade, Denis Lugiez, Ralf Treinen

   Pages 308-322

5. Proving Positive Almost-Sure Termination

   • Olivier Bournez, Florent Garnier

   Pages 323-337

6. Termination of Single-Threaded One-Rule Semi-Thue Systems

   • Wojciech Moczydłowski, Alfons Geser

   Pages 338-352

7. On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems

   • Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema

   Pages 353-367

8. Twenty Years Later

   • Jean-Pierre Jouannaud

   Pages 368-375

9. Open. Closed. Open.

   • Nachum Dershowitz

   Pages 376-393

10. A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code

    • Amy P. Felty

    Pages 394-406

11. Extending the Explicit Substitution Paradigm

    • Delia Kesner, Stéphane Lengrand

    Pages 407-422

12. Arithmetic as a Theory Modulo

    • Gilles Dowek, Benjamin Werner

    Pages 423-437

13. Infinitary Combinatory Reduction Systems

    • Jeroen Ketema, Jakob Grue Simonsen

    Pages 438-452

14. Proof-Producing Congruence Closure

    • Robert Nieuwenhuis, Albert Oliveras

    Pages 453-468

15. The Algebra of Equality Proofs

    • Aaron Stump, Li-Yang Tan

    Pages 469-483

16. On Computing Reachability Sets of Process Rewrite Systems

    • Ahmed Bouajjani, Tayssir Touili

    Pages 484-499

17. Automata and Logics for Unranked and Unordered Trees

    • Iovka Boneva, Jean-Marc Talbot

    Pages 500-515

18. Back Matter

    PDF

This volume contains the proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA2005),whichwasheldonApril19– 21, 2005, at the Nara-Ken New Public Hall in the center of the Nara National Park in Nara, Japan. RTA is the major forum for the presentation of research on all aspects of rewriting.PreviousRTAconferenceswereheldinDijon(1985),Bordeaux(1987), Chapel Hill (1989), Como (1991), Montreal (1993), Kaiserslautern (1995), Rutgers (1996), Sitges (1997), Tsukuba (1998), Trento (1999), Norwich (2000), Utrecht (2001), Copenhagen (2002), Valencia (2003), and Aachen (2004). This year, there were 79 submissions from 20 countries, of which 31 papers were accepted for publication (29 regular papers and 2 system descriptions). The submissions came from France (10 accepted papers of the 23.1 submitted papers), USA (5.6 of 11.7), Japan (4 of 9), Spain (2.7 of 6.5), UK (2.7 of 4.7), The Netherlands (1.7 of 3.8), Germany (1.3 of 2.3), Austria (1 of 1), Poland (1 of 1), Israel (0.5 of 0.8), Denmark (0.5 of 0.5), China (0 of 4), Korea (0 of 4), Taiwan (0 of 1.3), Australia (0 of 1), Brazil (0 of 1), Russia (0 of 1), Switzerland (0 of 1), Sweden (0 of 1), and Italy (0 of 0.3). Each submission was assigned to at least three Program Committee m- bers, who carefully reviewed the papers, with the help of 111 external referees.

• automata
• automated deduction
• higher order rewriting
• lambda calculus
• logic programming
• programming calculi
• proving
• rewriting
• rewriting systems
• semantics
• term rewriting
• termination
• type inference
• unification
• verification

• LuFG Informatik 2, RWTH Aachen University, Germany

  Jürgen Giesl

Policies and ethics