You have Guest access.
Log In
Luca de Alfaro
Front matter
1-14
Facets of Synthesis: Revisiting Church’s Problem
15
Temporal Reasoning about Program Executions
16-31
Least and Greatest Fixpoints in Game Semantics
32-47
Full Abstraction for Reduced ML
48-62
Logics and Bisimulation Games for Concurrency, Causality and Conflict
63-77
Separating Graph Logic from MSO
78-91
On the Completeness of Dynamic Logic
92-106
Dependency Tree Automata
107-121
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
122-136
A Kleene Theorem for Polynomial Coalgebras
137-151
Coalgebraic Hybrid Logic
152-166
A Description of Iterative Reflections of Monads (Extended Abstract)
167-181
Tighter Bounds for the Determinisation of Büchi Automata
182-196
Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata
197-211
Interrupt Timed Automata
212-226
Parameter Reduction in Grammar-Compressed Trees
227-241
The Calculus of Handshake Configurations
242-256
On the Expressive Power of Restriction and Priorities in CCS with Replication
257-271
Normal Bisimulations in Calculi with Passivation
272-287
Reactive Systems, Barbed Semantics, and the Mobile Ambients
288-302
On the Foundations of Quantitative Information Flow
303-317
Cryptographic Protocol Composition via the Authentication Tests
318-332
Bisimulation for Demonic Schedulers
333-347
On Omega-Languages Defined by Mean-Payoff Conditions
348-363
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
364-379
Delayed Nondeterminism in Continuous-Time Markov Decision Processes
380-394
Concurrency, σ-Algebras, and Probabilistic Fairness
395-409
Synthesis from Component Libraries
410-424
Realizability of Concurrent Recursive Programs
425-439
Beyond Shapes: Lists with Ordered Data
440-455
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
456-470
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info