Foundations of software science and computation structures : 16th international conference, FOSSACS 2013, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013 ; proceedings

This book constitutes the proceedings of the 16th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2013, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2013, which took place in Rome, Italy, in March 2013 The 28 papers presented in this volume were carefully reviewed and selected from 109 submissions. They are organized in topical sections named: models of computation; reasoning about processes; bisimulation; modal and higher-order logics; reasoning about programs; computational complexity; quantitative models; and categorical models. Front Matter....Pages - Pattern Graphs and Rule-Based Models: The Semantics of Kappa....Pages 1-16 History-Register Automata....Pages 17-33 Fatal Attractors in Parity Games....Pages 34-49 On Unique Decomposition of Processes in the Applied π -Calculus....Pages 50-64 Bounded Context-Switching and Reentrant Locking....Pages 65-80 Reachability of Communicating Timed Processes....Pages 81-96 Modular Bisimulation Theory for Computations and Values....Pages 97-112 Checking Bisimilarity for Attributed Graph Transformation....Pages 113-128 Comodels and Effects in Mathematical Operational Semantics....Pages 129-144 Preorders on Monads and Coalgebraic Simulations....Pages 145-160 A Proof System for Compositional Verification of Probabilistic Concurrent Processes....Pages 161-176 Partiality and Recursion in Higher-Order Logic....Pages 177-192 Some Sahlqvist Completeness Results for Coalgebraic Logics....Pages 193-208 Cut Elimination in Nested Sequents for Intuitionistic Modal Logics....Pages 209-224 On Monadic Parametricity of Second-Order Functionals....Pages 225-240 Deconstructing General References via Game Semantics....Pages 241-256 Separation Logic for Non-local Control Flow and Block Scope Variables....Pages 257-272 The Parametric Ordinal-Recursive Complexity of Post Embedding Problems....Pages 273-288 Deciding Definability by Deterministic Regular Expressions....Pages 289-304 Type-Based Complexity Analysis for Fork Processes....Pages 305-320 Pure Pointer Programs and Tree Isomorphism....Pages 321-336 A Language for Differentiable Functions....Pages 337-352 Computing Quantiles in Markov Reward Models....Pages 353-368 Parameterized Weighted Containment....Pages 369-384 Weighted Specifications over Nested Words....Pages 385-400 An Algebraic Presentation of Predicate Logic....Pages 401-417 Strategies as Profunctors....Pages 418-433 Generalised Name Abstraction for Nominal Sets....Pages 434-449 Back Matter....Pages -