Accepted Papers

• Piterman, Nir; Chatterjee, Krishnendu; Henzinger, Thomas A.:
  Generalized Parity Games.
• Muscholl, Anca; Walukiewicz, Igor:
  A lower bound on web services composition.
• Schneider, Thomas; Schnoor, Henning; Schnoor, Ilka; Bauland, Michael; Vollmer, Heribert:
  The Complexity of Generalized Satisfiability for Linear Temporal Logic.
• Yoshida, Nobuko; Honda, Kohei ; Berger, Martin:
  Logical Resoning for Higher-Order Functions with Local State.
• Hirschkoff, Daniel; Pous, Damien:
  A Distribution Law for CCS and a New Congruence Result for the Pi-calculus.
• van Breugel, Franck; Worrell, James; Sharma, Babita:
  Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems.
• Parma, Augusto; Segala, Roberto:
  Logical Characterizations of Bisimulations for Discrete Probabilistic Systems.
• Chatterjee, Krishnendu:
  Optimal Strategy Synthesis in Stochastic M\"uller Games.
• Murano, Aniello; Ferrante, Alessandro:
  Enriched \mu-Calculi Module Checking.
• Yang, Hongseok; Birkedal, Lars:
  Relational Parametricity and Separation Logic.
• Bertolissi, Clara; Kirchner, Claude:
  The rewriting calculus as a Combinatory Reduction System.
• Bartoletti, Massimo; Ferrari, Gian Luigi; Degano, Pierpaolo; Zunino, Roberto:
  Types and Effects for Resource Usage Analysis.
• Sobocinski, Pawel; Sassone, Vladimiro; Rathke, Julian:
  Semantic barbs and biorthogonality.
• Marnette, Bruno; Rinard, Martin; Kuncak, Viktor:
  Polynomial Constraints for Sets with Cardinality Bounds.
• Lohrey, Markus; Lutz, Carsten; Göller, Stefan:
  PDL with intersection and converse is 2EXP-complete.
• Mackie, Ian; Alves, Sandra; Fernandez, Maribel; Florido, Mario:
  Iterator Types.
• Markey, Nicolas; Oreiby, Ghassan; Laroussinie, Francois:
  On the Expressiveness and Complexity of ATL.
• Bengtson, Jesper; Parrow, Joachim:
  Formalising the pi-calculus using Nominal Logic.
• Bouyer, Patricia; Markey, Nicolas; Larsen, Kim G.:
  Model-Checking One-Clock Priced Timed Automata.
• Rosu, Grigore:
  An Effective Algorithm for The Membership Problem for Extended Regular Expressions.
• Riba, Colin:
  On the Stability by Union of Reducibiliy Candidates.
• Hague, Matthew; Ong, Luke:
  Symbolic Reachability Analysis for Higher-Order Pushdown Systems.
• Krcal, Pavel; Yi, Wang; Abdulla, Parosh:
  Sampled Universality of Timed Automata.
• Comon, Hubert; Jacquemard, Florent; Perrin, Nicolas:
  Tree Automata with Memory, Visibility and Structural Constraints.
• Tozawa, Akihiko; Minamide, Yasuhiko:
  Complexity Results on Balanced Context-Free Languages.