E-Books durchsuchen
Foundations of Software Science and Computational Structures [2010]
- 1
-
Introduction to Decidability of Higher-Order Matching
- 2
-
A Semantic Foundation for Hidden State
- 18
-
Linearly-Used Continuations in the Enriched Effect Calculus
- 33
-
Block Structure vs. Scope Extrusion: Between Innocence and Omniscience
- 48
-
Completeness for Algebraic Theories of Local State
- 64
-
Fair Adversaries and Randomization in Two-Player Games
- 79
-
Retaining the Probabilities in Probabilistic Testing Theory
- 94
-
Forward Analysis of Depth-Bounded Processes
- 109
-
Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization
- 128
-
Parameterised Multiparty Session Types
- 146
-
On the Relationship between Spatial Logics and Behavioral Simulations
- 161
-
An Easy Completeness Proof for the Modal <Emphasis Type="Italic">μ</Emphasis>-Calculus on Finite Trees
- 176
-
When Model-Checking Freeze LTL over Counter Machines Becomes Decidable
- 191
-
Model Checking <Emphasis Type="Italic">Is</Emphasis> Static Analysis of Modal Logic
- 206
-
Counting <Emphasis FontCategory="SansSerif">CTL</Emphasis>
- 221
-
Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems
- 237
-
Toward a Compositional Theory of Leftist Grammars and Transformations
- 252
-
Degrees of Lookahead in Regular Infinite Games
- 267
-
Reachability Analysis of Communicating Pushdown Systems
- 282
-
The Complexity of Synchronous Notions of Information Flow Security
- 297
-
Monads Need Not Be Endofunctors
- 312
-
CIA Structures and the Semantics of Recursion
- 328
-
Coalgebraic Correspondence Theory
- 343
-
Untyped Recursion Schemes and Infinite Intersection Types
- 358
-
Solvability in Resource Lambda-Calculus
- 374
-
A Hierarchy for Delimited Continuations in Call-by-Name