Foundations of Software Science and Computational Structures

14th International Conference, FOSSACS 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26–April 3, 2011. Proceedings

  • Martin Hofmann
Conference proceedings FoSSaCS 2011

DOI: 10.1007/978-3-642-19805-2

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

Table of contents (31 papers)

  1. Front Matter
  2. The Search for Structure in Quantum Computation

  3. Coalgebra and Computability

    1. Similarity Quotients as Final Coalgebras
      Paul Blain Levy
      Pages 27-41
    2. What Do Reversible Programs Compute?
      Holger Bock Axelsen, Robert Gl ü ck
      Pages 42-56
  4. Type Theory

    1. When Is a Type Refinement an Inductive Type?
      Robert Atkey, Patricia Johann, Neil Ghani
      Pages 72-87
    2. Realizability and Parametricity in Pure Type Systems
      Jean-Philippe Bernardy, Marc Lasson
      Pages 108-122
  5. Process Calculi

    1. Sound Bisimulations for Higher-Order Distributed Process Calculus
      Adrien Piérard, Eijiro Sumii
      Pages 123-137
    2. Deriving Labels and Bisimilarity for Concurrent Constraint Programming
      Andrés Aristizábal, Filippo Bonchi, Catuscia Palamidessi, Luis Pino, Frank Valencia
      Pages 138-152
    3. Ordinal Theory for Expressiveness of Well Structured Transition Systems
      Remi Bonnet, Alain Finkel, Serge Haddad, Fernando Rosa-Velardo
      Pages 153-167
  6. Automata Theory

    1. Alternation Elimination for Automata over Nested Words
      Christian Dax, Felix Klaedtke
      Pages 168-183
    2. Co-Büching Them All
      Udi Boker, Orna Kupferman
      Pages 184-198
    3. Minimizing Deterministic Lattice Automata
      Shulamit Halamish, Orna Kupferman
      Pages 199-213
    4. Regularity and Context-Freeness over Word Rewriting Systems
      Didier Caucal, Trong Hieu Dinh
      Pages 214-228
    5. Quantitative Robustness Analysis of Flat Timed Automata
      Rémi Jaubert, Pierre-Alain Reynier
      Pages 229-244
    6. A Game Approach to Determinize Timed Automata
      Nathalie Bertrand, Amélie Stainer, Thierry Jéron, Moez Krichen
      Pages 245-259
    7. Church Synthesis Problem for Noisy Input
      Yaron Velner, Alexander Rabinovich
      Pages 275-289

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 14th International Conference on Foundations of Software Science and computational Structures, FOSSACS 2011, held in Saarbrücken, Germany, March 26—April 3, 2011, as part of ETAPS 2011, the European Joint Conferences on Theory and Practice of Software.

The 30 revised full papers presented together with one full-paper length invited talk were carefully reviewed and selected from 100 submissions. The papers are organized in topical sections on coalgebra and computability, type theory, process calculi, automata theory, semantics, binding, security, and program analysis.

Keywords

abstract machines computational complexity correctness decision procedures first order logic formal verification infinite games modal logics model checking process algebras programming languages semantics regular games security software engineering theorem proving

Editors and affiliations

  • Martin Hofmann
    • 1
  1. 1.Institut für InformatikLudwig-Maximilians-Universität MünchenMünchenGermany

Bibliographic information

  • Copyright Information Springer Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-19804-5
  • Online ISBN 978-3-642-19805-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349