Accepted Papers and Extended Abstracts

• Yuki Chiba:
  Verifying the Correctness of Tupling Transformations based on Conditional Rewriting
• Karl Gmeiner and Naoki Nishida:
  Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems
• Guillaume Madelaine, Cedric Lhoussaine and Joachim Niehren:
  Attractor Equivalence: An Observational Semantics for Reaction Networks
• William Mansky and Elsa Gunter:
  Verifying Optimizations for Concurrent Programs
• Georg Moser and Michael Schaper:
  A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems
• Masanori Nagashima, Tomofumi Kato, Masahiko Sakai and Naoki Nishida:
  Inverse Unfold Problem and Its Heuristic Solving
• Naoki Nishida, Makishi Yanagisawa and Karl Gmeiner:
  On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings
• David Sabel:
  Structural Rewriting in the Pi-Calculus
• Manfred Schmidt-Schauss and David Sabel:
  Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report)