Foundations of Software Science and Computational Structures

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Facets of Synthesis: Revisiting Church’s Problem
3. Altmetric Badge
   Chapter 2 Temporal Reasoning about Program Executions
4. Altmetric Badge
   Chapter 3 Least and Greatest Fixpoints in Game Semantics
5. Altmetric Badge
   Chapter 4 Full Abstraction for Reduced ML
6. Altmetric Badge
   Chapter 5 Logics and Bisimulation Games for Concurrency, Causality and Conflict
7. Altmetric Badge
   Chapter 6 Separating Graph Logic from MSO
8. Altmetric Badge
   Chapter 7 On the Completeness of Dynamic Logic
9. Altmetric Badge
   Chapter 8 Dependency Tree Automata
10. Altmetric Badge
    Chapter 9 On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
11. Altmetric Badge
    Chapter 10 A Kleene Theorem for Polynomial Coalgebras
12. Altmetric Badge
    Chapter 11 Coalgebraic Hybrid Logic
13. Altmetric Badge
    Chapter 12 A Description of Iterative Reflections of Monads (Extended Abstract)
14. Altmetric Badge
    Chapter 13 Foundations of Software Science and Computational Structures
15. Altmetric Badge
    Chapter 14 Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata
16. Altmetric Badge
    Chapter 15 Interrupt Timed Automata
17. Altmetric Badge
    Chapter 16 Parameter Reduction in Grammar-Compressed Trees
18. Altmetric Badge
    Chapter 17 The Calculus of Handshake Configurations
19. Altmetric Badge
    Chapter 18 On the Expressive Power of Restriction and Priorities in CCS with Replication
20. Altmetric Badge
    Chapter 19 Normal Bisimulations in Calculi with Passivation
21. Altmetric Badge
    Chapter 20 Reactive Systems, Barbed Semantics, and the Mobile Ambients
22. Altmetric Badge
    Chapter 21 On the Foundations of Quantitative Information Flow
23. Altmetric Badge
    Chapter 22 Cryptographic Protocol Composition via the Authentication Tests
24. Altmetric Badge
    Chapter 23 Bisimulation for Demonic Schedulers
25. Altmetric Badge
    Chapter 24 On Omega-Languages Defined by Mean-Payoff Conditions
26. Altmetric Badge
    Chapter 25 Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
27. Altmetric Badge
    Chapter 26 Delayed Nondeterminism in Continuous-Time Markov Decision Processes
28. Altmetric Badge
    Chapter 27 Concurrency, σ -Algebras, and Probabilistic Fairness
29. Altmetric Badge
    Chapter 28 Synthesis from Component Libraries
30. Altmetric Badge
    Chapter 29 Realizability of Concurrent Recursive Programs
31. Altmetric Badge
    Chapter 30 Beyond Shapes: Lists with Ordered Data
32. Altmetric Badge
    Chapter 31 Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
33. Altmetric Badge
    Chapter 32 Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types