SPECIAL ISSUE:
Selected Papers of the Conference ''Foundations of Software Science and Computation Structures 2007"
Braga, Portugal, 2007



Preface
Helmut Seidl


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


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


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


Relational Parametricity and Separation Logic
Lars Birkedal and Hongseok Yang


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


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


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


Enriched μ-Calculi Module Checking
Ferrante Alessandro, Aniello Murano and Mimmo Parente


Logical Reasoning for Higher-Order Functions with Local State
Nobuko Yoshida, Kohei Honda and Martin Berger


Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Matthew Hague and Luke Ong


Formalising the pi-calculus using nominal logic
Jesper Bengtson and Joachim Parrow



DOI: 10.2168/LMCS-FOSSACS:2007

Creative Commons