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

Editors:

ISBN: 978-3-642-19804-5 (Print) 978-3-642-19805-2 (Online)

Table of contents (31 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. The Search for Structure in Quantum Computation

    1. Book Chapter

      Pages 1-11

      The Search for Structure in Quantum Computation

  3. Coalgebra and Computability

    1. Book Chapter

      Pages 12-26

      Coalgebraic Walks, in Quantum and Turing Computation

    2. Book Chapter

      Pages 27-41

      Similarity Quotients as Final Coalgebras

    3. Book Chapter

      Pages 42-56

      What Do Reversible Programs Compute?

  4. Type Theory

    1. Book Chapter

      Pages 57-71

      Irrelevance in Type Theory with a Heterogeneous Equality Judgement

    2. Book Chapter

      Pages 72-87

      When Is a Type Refinement an Inductive Type?

    3. Book Chapter

      Pages 88-107

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

    4. Book Chapter

      Pages 108-122

      Realizability and Parametricity in Pure Type Systems

  5. Process Calculi

    1. Book Chapter

      Pages 123-137

      Sound Bisimulations for Higher-Order Distributed Process Calculus

    2. Book Chapter

      Pages 138-152

      Deriving Labels and Bisimilarity for Concurrent Constraint Programming

    3. Book Chapter

      Pages 153-167

      Ordinal Theory for Expressiveness of Well Structured Transition Systems

  6. Automata Theory

    1. Book Chapter

      Pages 168-183

      Alternation Elimination for Automata over Nested Words

    2. Book Chapter

      Pages 184-198

      Co-Büching Them All

    3. Book Chapter

      Pages 199-213

      Minimizing Deterministic Lattice Automata

    4. Book Chapter

      Pages 214-228

      Regularity and Context-Freeness over Word Rewriting Systems

    5. Book Chapter

      Pages 229-244

      Quantitative Robustness Analysis of Flat Timed Automata

    6. Book Chapter

      Pages 245-259

      A Game Approach to Determinize Timed Automata

    7. Book Chapter

      Pages 260-274

      A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes

    8. Book Chapter

      Pages 275-289

      Church Synthesis Problem for Noisy Input

    9. Book Chapter

      Pages 290-304

      Probabilistic Modal μ-Calculus with Independent Product

previous Page of 2