Logical Methods in Computer Science

1.	Normalization of IZF with Replacement
	Wojciech Moczydlowski


2.	Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
	Franck van Breugel, Babita Sharma and James Worrell


3.	Semi-continuous Sized Types and Termination
	Andreas Abel


4.	A Distribution Law for CCS and a New Congruence Result for the π-calculus
	Daniel Hirschkoff and Damien Pous


5.	A lower bound on web services composition
	Anca Muscholl and Igor Walukiewicz


6.	Relational Parametricity and Separation Logic
	Lars Birkedal and Hongseok Yang


7.	On the Expressiveness and Complexity of ATL
	François Laroussinie, Nicolas Markey and Ghassan Oreiby


8.	Visibly Tree Automata with Memory and Constraints
	Hubert Comon-Lundh, Florent Jacquemard and Nicolas Perrin


9.	Model Checking One-clock Priced Timed Automata
	Patricia Bouyer, Kim Gulstrand Larsen and Nicolas Markey