Skip to main content
SpringerLink
Log in
Book cover

Foundations of Software Science and Computational Structures

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

  • Conference proceedings
  • © 2011

Overview

Editors:
  1. Martin Hofmann

    1. Institut für Informatik, Ludwig-Maximilians-Universität München, München, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Fast-track conference proceedings
  • State-of-the-art research
  • Up-to-date results

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

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

Included in the following conference series:

Conference proceedings info: FoSSaCS 2011.

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (31 papers)

  1. Front Matter

    Download chapter PDF

  2. The Search for Structure in Quantum Computation

    1. The Search for Structure in Quantum Computation

      • Prakash Panangaden
      Pages 1-11

  3. Coalgebra and Computability

    1. Coalgebraic Walks, in Quantum and Turing Computation

      • Bart Jacobs
      Pages 12-26

    2. Similarity Quotients as Final Coalgebras

      • Paul Blain Levy
      Pages 27-41

    3. What Do Reversible Programs Compute?

      • Holger Bock Axelsen, Robert Glück
      Pages 42-56

  4. Type Theory

    1. Irrelevance in Type Theory with a Heterogeneous Equality Judgement

      • Andreas Abel
      Pages 57-71

    2. When Is a Type Refinement an Inductive Type?

      • Robert Atkey, Patricia Johann, Neil Ghani
      Pages 72-87

    3. Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types

      • Alexis Bernadet, Stéphane Lengrand
      Pages 88-107

    4. 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. A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes

      • Naoki Kobayashi
      Pages 260-274

    8. Church Synthesis Problem for Noisy Input

      • Yaron Velner, Alexander Rabinovich
      Pages 275-289
Back to top

Other volumes

  1. Foundations of Software Science and Computational Structures

Keywords

About this book

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.

Editors and Affiliations

  • Institut für Informatik, Ludwig-Maximilians-Universität München, München, Germany

    Martin Hofmann

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation