Skip to main content
Springer Nature Link
Log in

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

  • Conference proceedings
  • © 2013

Overview

Editors:
  1. Frank Pfenning

    1. School of Computer Science, Carnegie Mellon University, Pittsburgh, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Up-to-date results in foundations of software science and computational structures
  • Fast-track conference proceedings
  • State-of-the-art research

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: FoSSaCS 2013.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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.

Similar content being viewed by others

Keywords

Table of contents (28 papers)

  1. Front Matter

    Download chapter PDF

  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

    1. A Proof System for Compositional Verification of Probabilistic Concurrent Processes

      • Matteo Mio, Alex Simpson
      Pages 161-176

    2. Partiality and Recursion in Higher-Order Logic

      • Łukasz Czajka
      Pages 177-192

    3. Some Sahlqvist Completeness Results for Coalgebraic Logics

      • Fredrik Dahlqvist, Dirk Pattinson
      Pages 193-208

    4. Cut Elimination in Nested Sequents for Intuitionistic Modal Logics

      • Lutz Straßburger
      Pages 209-224

  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
Back to top

Other volumes

  1. Foundations of Software Science and Computation Structures

Editors and Affiliations

  • School of Computer Science, Carnegie Mellon University, Pittsburgh, USA

    Frank Pfenning

Bibliographic Information

Publish with us

Policies and ethics

Back to top