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

Editors:

ISBN: 978-3-642-37074-8 (Print) 978-3-642-37075-5 (Online)

Table of contents (28 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Models of Computation

    1. No Access

      Book Chapter

      Pages 1-16

      Pattern Graphs and Rule-Based Models: The Semantics of Kappa

    2. No Access

      Book Chapter

      Pages 17-33

      History-Register Automata

    3. No Access

      Book Chapter

      Pages 34-49

      Fatal Attractors in Parity Games

  3. Reasoning about Processes

    1. No Access

      Book Chapter

      Pages 50-64

      On Unique Decomposition of Processes in the Applied π-Calculus

    2. No Access

      Book Chapter

      Pages 65-80

      Bounded Context-Switching and Reentrant Locking

    3. No Access

      Book Chapter

      Pages 81-96

      Reachability of Communicating Timed Processes

  4. Bisimulation

    1. No Access

      Book Chapter

      Pages 97-112

      Modular Bisimulation Theory for Computations and Values

    2. No Access

      Book Chapter

      Pages 113-128

      Checking Bisimilarity for Attributed Graph Transformation

    3. No Access

      Book Chapter

      Pages 129-144

      Comodels and Effects in Mathematical Operational Semantics

    4. No Access

      Book Chapter

      Pages 145-160

      Preorders on Monads and Coalgebraic Simulations

  5. Modal and Higher-Order Logics

    1. No Access

      Book Chapter

      Pages 161-176

      A Proof System for Compositional Verification of Probabilistic Concurrent Processes

    2. No Access

      Book Chapter

      Pages 177-192

      Partiality and Recursion in Higher-Order Logic

    3. No Access

      Book Chapter

      Pages 193-208

      Some Sahlqvist Completeness Results for Coalgebraic Logics

    4. No Access

      Book Chapter

      Pages 209-224

      Cut Elimination in Nested Sequents for Intuitionistic Modal Logics

  6. Reasoning about Programs

    1. No Access

      Book Chapter

      Pages 225-240

      On Monadic Parametricity of Second-Order Functionals

    2. No Access

      Book Chapter

      Pages 241-256

      Deconstructing General References via Game Semantics

    3. No Access

      Book Chapter

      Pages 257-272

      Separation Logic for Non-local Control Flow and Block Scope Variables

  7. Computational Complexity

    1. No Access

      Book Chapter

      Pages 273-288

      The Parametric Ordinal-Recursive Complexity of Post Embedding Problems

    2. No Access

      Book Chapter

      Pages 289-304

      Deciding Definability by Deterministic Regular Expressions

    3. No Access

      Book Chapter

      Pages 305-320

      Type-Based Complexity Analysis for Fork Processes

previous Page of 2