Foundations of Software Science and Computation Structures

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation
3. Altmetric Badge
   Chapter 2 A Theory for Observational Fault Tolerance
4. Altmetric Badge
   Chapter 3 Smooth Orchestrators
5. Altmetric Badge
   Chapter 4 On the Relative Expressive Power of Asynchronous Communication Primitives
6. Altmetric Badge
   Chapter 5 More on Bisimulations for Higher Order π -Calculus
7. Altmetric Badge
   Chapter 6 Register Allocation After Classical SSA Elimination is NP-Complete
8. Altmetric Badge
   Chapter 7 A Logic of Reachable Patterns in Linked Data-Structures
9. Altmetric Badge
   Chapter 8 Dynamic Policy Discovery with Remote Attestation
10. Altmetric Badge
    Chapter 9 Distributed Unfolding of Petri Nets
11. Altmetric Badge
    Chapter 10 On the μ -Calculus Augmented with Sabotage
12. Altmetric Badge
    Chapter 11 A Finite Model Construction for Coalgebraic Modal Logic
13. Altmetric Badge
    Chapter 12 Presenting Functors by Operations and Equations
14. Altmetric Badge
    Chapter 13 Bigraphical Models of Context-Aware Systems
15. Altmetric Badge
    Chapter 14 Processes for Adhesive Rewriting Systems
16. Altmetric Badge
    Chapter 15 On Metric Temporal Logic and Faulty Turing Machines
17. Altmetric Badge
    Chapter 16 Denotational Semantics of Hybrid Automata
18. Altmetric Badge
    Chapter 17 Reversing Algebraic Process Calculi
19. Altmetric Badge
    Chapter 18 Conjunction on Processes: Full–Abstraction Via Ready–Tree Semantics
20. Altmetric Badge
    Chapter 19 Undecidability Results for Bisimilarity on Prefix Rewrite Systems
21. Altmetric Badge
    Chapter 20 Propositional Dynamic Logic with Recursive Programs
22. Altmetric Badge
    Chapter 21 A Semantic Approach to Interpolation
23. Altmetric Badge
    Chapter 22 First-Order and Counting Theories of ω -Automatic Structures
24. Altmetric Badge
    Chapter 23 Parity Games Played on Transition Graphs of One-Counter Processes
25. Altmetric Badge
    Chapter 24 Bidomains and Full Abstraction for Countable Nondeterminism
26. Altmetric Badge
    Chapter 25 An Operational Characterization of Strong Normalization
27. Altmetric Badge
    Chapter 26 On the Confluence of λ -Calculus with Conditional Rewriting
28. Altmetric Badge
    Chapter 27 Guessing Attacks and the Computational Soundness of Static Equivalence
29. Altmetric Badge
    Chapter 28 Handling exp ,× (and Timestamps) in Protocol Analysis
30. Altmetric Badge
    Chapter 29 Symbolic and Cryptographic Analysis of the Secure WS-ReliableMessaging Scenario