Accepted papers

• Information Leakage Detection in Boundary Ambients
  Chiara Braghin, Agostino Cortesi, Riccardo Focardi

• A New Machine-checked Proof of Strong Normalisation for Display Logic
  Jeremy Dawson, Rajeev Gore

• Mobility Types for Mobile Processes in Mobile Ambients
  M. Coppo, M. Dezani-Ciancaglini, E. Giovannetti

• An Optimal Family of Bounded-Degree Broadcast Networks
  Michael Dineen, Nian Zhou

• Large 2-Independent Sets of Regular Graphs
  W. Duckworth, M. Zito

• On the Relative Complexity of Labelled Modal Tableaux
  Guido Governatori

• Minimum Augmentation of Edge-connectivity between Vertices and Sets of Vertices in Undirected Graphs
  Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi

• Flow Analytic Type System for Array Bound Checks
  Yutaka Matsuno, Hiroyuki Sato

• Space and Time Adaptive Non-blocking Algorithms
  Maurice Herlihy, Victor Luchangco, Mark Moir

• The Reverse Problem of Range Query
  Tadao Takaoka

• Hierarchical Automata and P-systems
  N. Sabadini and R. Walters

• Linearity and Passivity
  David Wright

• Three approaches to Partiality in the Sketch Data Model
  Michael Johnson, Robert Roseburgh

• Formal Semantics for Program Paths
  Karl Lermer, Colin Fidge, Ian Hayes

• Cutting Up is Hard to Do: the Parameterised Complexity of k-Cut and Related Problems
  Rodney Downey, Vladimir Estivill-Castro, Michael Fellows, Elena Prieto, Frances Rosamund

• Arbitrage in Frictional Foreign Exchange Market
  Mao-cheng Cai, Xiaotie Deng

• Characterizing polynomial time computable functions using theories with weak set existence principles
  Aleksander Ignjatovic and Phuong Nguyen