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

Front Matter....Pages -
The Search for Structure in Quantum Computation....Pages 1-11
Coalgebraic Walks, in Quantum and Turing Computation....Pages 12-26
Similarity Quotients as Final Coalgebras....Pages 27-41
What Do Reversible Programs Compute?....Pages 42-56
Irrelevance in Type Theory with a Heterogeneous Equality Judgement....Pages 57-71
When Is a Type Refinement an Inductive Type?....Pages 72-87
Complexity of Strongly Normalising λ -Terms via Non-idempotent Intersection Types....Pages 88-107
Realizability and Parametricity in Pure Type Systems....Pages 108-122
Sound Bisimulations for Higher-Order Distributed Process Calculus....Pages 123-137
Deriving Labels and Bisimilarity for Concurrent Constraint Programming....Pages 138-152
Ordinal Theory for Expressiveness of Well Structured Transition Systems....Pages 153-167
Alternation Elimination for Automata over Nested Words....Pages 168-183
Co-Büching Them All....Pages 184-198
Minimizing Deterministic Lattice Automata....Pages 199-213
Regularity and Context-Freeness over Word Rewriting Systems....Pages 214-228
Quantitative Robustness Analysis of Flat Timed Automata....Pages 229-244
A Game Approach to Determinize Timed Automata....Pages 245-259
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes....Pages 260-274
Church Synthesis Problem for Noisy Input....Pages 275-289
Probabilistic Modal μ -Calculus with Independent Product....Pages 290-304
A Step-Indexed Kripke Model of Hidden State via Recursive Properties on Recursively Defined Metric Spaces....Pages 305-319
A Modified GoI Interpretation for a Linear Functional Programming Language and Its Adequacy....Pages 320-334
Estimation of the Length of Interactions in Arena Game Semantics....Pages 335-349
Synchronous Game Semantics via Round Abstraction....Pages 350-364
Freshness and Name-Restriction in Sets of Traces with Names....Pages 365-380
Polymorphic Abstract Syntax via Grothendieck Construction....Pages 381-395
Asymptotic Information Leakage under One-Try Attacks....Pages 396-410
A Trace-Based View on Operating Guidelines....Pages 411-425
HTML Validation of Context-Free Languages....Pages 426-440
On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks....Pages 441-455
The Reduced Product of Abstract Domains and the Combination of Decision Procedures....Pages 456-472
Back Matter....Pages -