Foundations of software science and computational structures

InhaltsverzeichnisInvited Talk.Formal Foundations for Aspects.Contributed Papers.Sampled Universality of Timed Automata.Iterator Types.Types and Effects for Resource Usage Analysis.The Complexity of Generalized Satisfiability for Linear Temporal Logic.Formalising the ?-Calculus Using Nominal Logic.The Rewriting Calculus as a Combinatory Reduction System.Relational Parametricity and Separation Logic.Model-Checking One-Clock Priced Timed Automata.Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems.Optimal Strategy Synthesis in Stochastic Müller Games.Generalized Parity Games.Tree Automata with Memory, Visibility and Structural Constraints.Enriched ?-Calculi Module Checking.PDL with Intersection and Converse Is 2EXP-Complete.Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems.A Distribution Law for CCS and a New Congruence Result for the ?-Calculus.On the Expressiveness and Complexity of ATL.Polynomial Constraints for Sets with Cardinality Bounds.A Lower Bound on Web Services Composition.Logical Characterizations of Bisimulations for Discrete Probabilistic Systems.Semantic Barbs and Biorthogonality.On the Stability by Union of Reducibility Candidates.An Effective Algorithm for the Membership Problem for Extended Regular Expressions.Complexity Results on Balanced Context-Free Languages.Logical Reasoning for Higher-Order Functions with Local State.