Foundations of Software Science and Computation Structures

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Adequacy for Algebraic Effects
3. Altmetric Badge
   Chapter 2 Secrecy Types for Asymmetric Communication
4. Altmetric Badge
   Chapter 3 Axiomatizing Tropical Semirings
5. Altmetric Badge
   Chapter 4 Type Isomorphisms and Proof Reuse in Dependent Type Theory
6. Altmetric Badge
   Chapter 5 On the Duality between Observability and Reachability
7. Altmetric Badge
   Chapter 6 The Finite Graph Problem for Two-Way Alternating Automata
8. Altmetric Badge
   Chapter 7 High-Level Petri Nets as Type Theories in the Join Calculus
9. Altmetric Badge
   Chapter 8 Temporary Data in Shared Dataspace Coordination Languages
10. Altmetric Badge
    Chapter 9 On Garbage and Program Logic
11. Altmetric Badge
    Chapter 10 The Complexity of Model Checking Mobile Ambients
12. Altmetric Badge
    Chapter 11 The Rho Cube
13. Altmetric Badge
    Chapter 12 Type Inference with Recursive Type Equations
14. Altmetric Badge
    Chapter 13 On the Modularity of Deciding Call-by-Need
15. Altmetric Badge
    Chapter 14 Synchronized Tree Languages Revisited and New Applications
16. Altmetric Badge
    Chapter 15 Computational Completeness of Programming Languages Based on Graph Transformation
17. Altmetric Badge
    Chapter 16 Axioms for Recursion in Call-by-Value
18. Altmetric Badge
    Chapter 17 Class Analysis of Object-Oriented Programs through Abstract Interpretation
19. Altmetric Badge
    Chapter 18 On the Complexity of Parity Word Automata
20. Altmetric Badge
    Chapter 19 Foundations for a Graph-Based Approach to the Specification of Access Control Policies
21. Altmetric Badge
    Chapter 20 Categories of Processes Enriched in Final Coalgebras
22. Altmetric Badge
    Chapter 21 Model Checking CTL + and FCTL Is Hard
23. Altmetric Badge
    Chapter 22 On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
24. Altmetric Badge
    Chapter 23 Verified Bytecode Verifiers
25. Altmetric Badge
    Chapter 24 Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the π-Calculus and Mechanizing the Theory of Contexts
26. Altmetric Badge
    Chapter 25 Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes
27. Altmetric Badge
    Chapter 26 An Axiomatic Semantics for the Synchronous Language Gentzen
28. Altmetric Badge
    Chapter 27 M arrella and the Verification of an Embedded System