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

  • Frank Pfenning
Conference proceedings FoSSaCS 2013

DOI: 10.1007/978-3-642-37075-5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7794)

Table of contents (28 papers)

  1. Front Matter
  2. Models of Computation

    1. Pattern Graphs and Rule-Based Models: The Semantics of Kappa
      Jonathan Hayman, Tobias Heindel
      Pages 1-16
    2. History-Register Automata
      Nikos Tzevelekos, Radu Grigore
      Pages 17-33
    3. Fatal Attractors in Parity Games
      Michael Huth, Jim Huan-Pu Kuo, Nir Piterman
      Pages 34-49
  3. Reasoning about Processes

    1. On Unique Decomposition of Processes in the Applied π-Calculus
      Jannik Dreier, Cristian Ene, Pascal Lafourcade, Yassine Lakhnech
      Pages 50-64
    2. Bounded Context-Switching and Reentrant Locking
      Rémi Bonnet, Rohit Chadha
      Pages 65-80
    3. Reachability of Communicating Timed Processes
      Lorenzo Clemente, Frédéric Herbreteau, Amelie Stainer, Grégoire Sutre
      Pages 81-96
  4. Bisimulation

    1. Modular Bisimulation Theory for Computations and Values
      Martin Churchill, Peter D. Mosses
      Pages 97-112
    2. Checking Bisimilarity for Attributed Graph Transformation
      Fernando Orejas, Artur Boronat, Ulrike Golas, Nikos Mylonakis
      Pages 113-128
    3. Comodels and Effects in Mathematical Operational Semantics
      Faris Abou-Saleh, Dirk Pattinson
      Pages 129-144
    4. Preorders on Monads and Coalgebraic Simulations
      Shin-ya Katsumata, Tetsuya Sato
      Pages 145-160
  5. Modal and Higher-Order Logics

  6. Reasoning about Programs

    1. On Monadic Parametricity of Second-Order Functionals
      Andrej Bauer, Martin Hofmann, Aleksandr Karbyshev
      Pages 225-240
    2. Deconstructing General References via Game Semantics
      Andrzej S. Murawski, Nikos Tzevelekos
      Pages 241-256
    3. Separation Logic for Non-local Control Flow and Block Scope Variables
      Robbert Krebbers, Freek Wiedijk
      Pages 257-272
  7. Computational Complexity

    1. The Parametric Ordinal-Recursive Complexity of Post Embedding Problems
      Prateek Karandikar, Sylvain Schmitz
      Pages 273-288
    2. Deciding Definability by Deterministic Regular Expressions
      Wojciech Czerwiński, Claire David, Katja Losemann, Wim Martens
      Pages 289-304

About these proceedings

Introduction

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.

Keywords

game semantics modal logics nominal sets pattern graphs predicate logic

Editors and affiliations

  • Frank Pfenning
    • 1
  1. 1.School of Computer ScienceCarnegie Mellon UniversityPittsburghUSA

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2013
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-37074-8
  • Online ISBN 978-3-642-37075-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349