E-Books durchsuchen

Foundations of Software Science and Computation Structures [2003]

1
A Game Semantics for Generic Polymorphism
2
Categories of Containers
3
Verification of Probabilistic Systems with Faulty Communication
4
Generalized Iteration and Coiteration for Higher-Order Nested Datatypes
5
Ambiguous Classes in the Games μ-Calculus Hierarchy
6
Parameterized Verification by Probabilistic Abstraction
7
Genericity and the π-Calculus
8
Model Checking Lossy Channels Systems Is Probably Decidable
9
Verification of Cryptographic Protocols: Tagging Enforces Termination
10
A Normalisation Result for Higher-Order Calculi with Explicit Substitutions
11
When Ambients Cannot Be Opened
12
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time
13
An Intrinsic Characterization of Approximate Probabilistic Bisimilarity
14
Manipulating Trees with Hidden Labels
15
The Converse of a Stochastic Relation
16
Type Assignment for Intersections and Unions in Call-by-Value Languages
17
Cones and Foci for Protocol Verification Revisited
18
Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems
19
The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard
20
A Game Semantics of Linearly Used Continuations
21
Counting and Equality Constraints for Multitree Automata
22
Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete
23
A Monadic Multi-stage Metalanguage
24
Multi-level Meta-reasoning with Higher-Order Abstract Syntax
25
Abstraction in Reasoning about Higraph-Based Systems
26
Deriving Bisimulation Congruences: 2-Categories Vs Precategories
27
On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the μCalculus
Feedback