Foundations of Software Science and Computation Structures

Invited Contributions.- Intruder Theories (Ongoing Work).- Theories for the Global Ubiquitous Computer.- Contributed Papers.- Choice in Dynamic Linking.- Soft lambda-Calculus: A Language for Polynomial Time Computation.- On the Existence of an Effective and Complete Inference System for Cryptographic Protocols.- Hypergraphs and Degrees of Parallelism: A Completeness Result.- Behavioral and Spatial Observations in a Logic for the ?-Calculus.- Election and Local Computations on Edges.- Decidability of Freshness, Undecidability of Revelation.- LTL over Integer Periodicity Constraints.- Unifying Recursive and Co-recursive Definitions in Sheaf Categories.- Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting.- A Denotational Account of Untyped Normalization by Evaluation.- On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds.- Specifying and Verifying Partial Order Properties Using Template MSCs.- Angelic Semantics of Fine-Grained Concurrency.- On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi.- safeDpi: A Language for Controlling Mobile Code.- Distance Desert Automata and the Star Height One Problem.- Adhesive Categories.- A Game Semantics of Local Names and Good Variables.- Partial Correctness Assertions Provable in Dynamic Logics.- Polynomials for Proving Termination of Context-Sensitive Rewriting.- Bisimulation on Speed: Lower Time Bounds.- On Recognizable Timed Languages.- Tree Transducers and Tree Compressions.- On Term Rewriting Systems Having a Rational Derivation.- Duality for Labelled Markov Processes.- Electoral Systems in Ambient Calculi.- Strong Normalization of -Calculus with Explicit Substitutions.- Canonical Models for Computational Effects.- Reasoning about Dynamic Policies.-Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols.- Strong Bisimulation for the Explicit Fusion Calculus.- Perfect-Information Stochastic Parity Games.- A Note on the Perfect Encryption Assumption in a Process Calculus.