Foundations of Software Science and Computation Structures

19th International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2–8, 2016, Proceedings

  • Bart Jacobs
  • Christof Löding
Conference proceedings FoSSaCS 2016

DOI: 10.1007/978-3-662-49630-5

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

Table of contents (31 papers)

  1. Front Matter
    Pages I-XI
  2. Types

    1. Front Matter
      Pages 1-1
    2. Comprehensive Parametric Polymorphism: Categorical Models and Type Theory
      Neil Ghani, Fredrik Nordvall Forsberg, Alex Simpson
      Pages 3-19
    3. Guarded Dependent Type Theory with Coinductive Types
      Aleš Bizjak, Hans Bugge Grathwohl, Ranald Clouston, Rasmus E. Møgelberg, Lars Birkedal
      Pages 20-35
    4. Dependent Types and Fibred Computational Effects
      Danel Ahman, Neil Ghani, Gordon D. Plotkin
      Pages 36-54
    5. Game Semantics for Bounded Polymorphism
      James Laird
      Pages 55-70
  3. Recursion and Fixed-Points

    1. Front Matter
      Pages 71-71
    2. Join Inverse Categories as Models of Reversible Recursion
      Holger Bock Axelsen, Robin Kaarsgaard
      Pages 73-90
    3. A Coalgebraic View of Bar Recursion and Bar Induction
      Venanzio Capretta, Tarmo Uustalu
      Pages 91-106
    4. A New Foundation for Finitary Corecursion
      Stefan Milius, Dirk Pattinson, Thorsten Wißmann
      Pages 107-125
    5. Fixed-Point Elimination in the Intuitionistic Propositional Calculus
      Silvio Ghilardi, Maria João Gouveia, Luigi Santocanale
      Pages 126-141
  4. Verification and Program Analysis

    1. Front Matter
      Pages 143-143
    2. A Theory of Monitors
      Adrian Francalanza
      Pages 145-161
    3. Contextual Approximation and Higher-Order Procedures
      Ranko Lazić, Andrzej S. Murawski
      Pages 162-179
    4. A Theory of Slicing for Probabilistic Control Flow Graphs
      Torben Amtoft, Anindya Banerjee
      Pages 180-196
  5. Automata, Logic, Games

    1. Front Matter
      Pages 215-215
    2. Robust Equilibria in Mean-Payoff Games
      Romain Brenguier
      Pages 217-233
    3. Quantifier Alternation for Infinite Words
      Théo Pierron, Thomas Place, Marc Zeitoun
      Pages 234-251
    4. Synchronizing Automata over Nested Words
      Dmitry Chistikov, Pavel Martyugin, Mahsa Shirmohammadi
      Pages 252-268

About these proceedings

Introduction

This book constitutes the proceedings of the 19th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2016, which took place in Eindhoven, The Netherlands, in April 2016, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016.

The 31 full papers presented in this volume were carefully reviewed and selected from 85 submissions. They were organized in topical sections named: types; recursion and fixed-points; verification and program analysis; automata, logic, games; probabilistic and timed systems; proof theory and lambda calculus; algorithms for infinite systems; and monads.

Keywords

formal languages modal logics semantics timed models type theory automata theory coalgebra hybrid models implicit complexity lambda calculus logic programming model checking parameterized distributed systems petri nets polymorphism proof theory recursion rewrite systems temporal logics transducers

Editors and affiliations

  • Bart Jacobs
    • 1
  • Christof Löding
    • 2
  1. 1.Radboud University NijmegenNijmegenThe Netherlands
  2. 2.RWTH Aachen UniversityAachenGermany

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2016
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-662-49629-9
  • Online ISBN 978-3-662-49630-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349