Abstract is missing.
- Formal Verification of an Optimizing CompilerXavier Leroy. 1 [doi]
- Challenges in Satisfiability Modulo TheoriesRobert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio. 2-18 [doi]
- On a Logical Foundation for Explicit SubstitutionsFrank Pfenning. 19 [doi]
- Intruders with CapsSiva Anantharaman, Paliath Narendran, Michaël Rusinowitch. 20-35 [doi]
- Tom: Piggybacking Rewriting on JavaEmilie Balland, Paul Brauner, Radu Kopetz, Pierre-Etienne Moreau, Antoine Reilles. 36-47 [doi]
- Rewriting Approximations for Fast Prototyping of Static AnalyzersYohan Boichut, Thomas Genet, Thomas P. Jensen, Luka Le Roux. 48-62 [doi]
- Determining Unify-Stable PresentationsThierry Boy de la Tour, Mnacho Echenim. 63-77 [doi]
- Confluence of Pattern-Based CalculiHoratiu Cirstea, Germain Faure. 78-92 [doi]
- A Simple Proof That Super-Consistency Implies Cut EliminationGilles Dowek, Olivier Hermant. 93-106 [doi]
- Bottom-Up Rewriting Is Inverse Recognizability PreservingIrène Durand, Géraud Sénizergues. 107-121 [doi]
- Adjunction for Garbage Collection with Application to Graph RewritingDominique Duval, Rachid Echahed, Frédéric Prost. 122-136 [doi]
- Non Strict Confluent Rewrite Systems for Data-Structures with PointersRachid Echahed, Nicolas Peltier. 137-152 [doi]
- Symbolic Model Checking of Infinite-State Systems Using NarrowingSantiago Escobar, José Meseguer. 153-168 [doi]
- Delayed SubstitutionsJosé Espírito Santo. 169-183 [doi]
- Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite SystemsGuillem Godoy, Eduard Huntingford. 184-199 [doi]
- Termination of Rewriting with Right-Flat RulesGuillem Godoy, Eduard Huntingford, Ashish Tiwari. 200-213 [doi]
- Abstract Critical Pairs and Confluence of Arbitrary Binary RelationsRémy Haemmerlé, François Fages. 214-228 [doi]
- On the Completeness of Context-Sensitive Order-Sorted SpecificationsJoe Hendrix, José Meseguer. 229-245 [doi]
- KOOL: An Application of Rewriting Logic to Language Prototyping and AnalysisMark Hills, Grigore Rosu. 246-256 [doi]
- Simple Proofs of Characterizing Strong Normalization for Explicit Substitution CalculiKentaro Kikuchi. 257-272 [doi]
- Proving Termination of Rewrite Systems Using BoundsMartin Korp, Aart Middeldorp. 273-287 [doi]
- Sequence Unification Through CurryingTemur Kutsia, Jordi Levy, Mateu Villaret. 288-302 [doi]
- The Termination CompetitionClaude Marché, Hans Zantema. 303-313 [doi]
- Random DescentVincent van Oostrom. 314-328 [doi]
- Correctness of Copy in Calculi with LetrecManfred Schmidt-Schauß. 329-343 [doi]
- A Characterization of Medial as Rewriting RuleLutz Straßburger. 344-358 [doi]
- The Maximum Length of Mu-Reduction in Lambda Mu-CalculusMakoto Tatsuta. 359-373 [doi]
- On Linear Combinations of ::::lambda:::: -TermsLionel Vaux. 374-388 [doi]
- Satisfying KBO ConstraintsHarald Zankl, Aart Middeldorp. 389-403 [doi]
- Termination by Quasi-periodic InterpretationsHans Zantema, Johannes Waldmann. 404-418 [doi]