Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #51 to #100.

Complexity of Decision Problems for Mixed and Modal Specifications: Label: en
The ω-Regular Post Embedding Problem: Label: en
A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract): Label: en
Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics: Label: en
Simulation Hemi-metrics between Infinite-State Stochastic Games: Label: en
Stochastic Games with Lossy Channels: Label: en
The Complexity of Nash Equilibria in Infinite Multiplayer Games: Label: en
Simple Stochastic Games with Few Random Vertices Are Easy to Solve: Label: en
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types: Label: en
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains: Label: en
Beyond Shapes: Lists with Ordered Data: Label: en
Realizability of Concurrent Recursive Programs: Label: en
Synthesis from Component Libraries: Label: en
Concurrency, σ-Algebras, and Probabilistic Fairness: Label: en
Delayed Nondeterminism in Continuous-Time Markov Decision Processes: Label: en
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets: Label: en
On Omega-Languages Defined by Mean-Payoff Conditions: Label: en
Bisimulation for Demonic Schedulers: Label: en
Cryptographic Protocol Composition via the Authentication Tests: Label: en
On the Foundations of Quantitative Information Flow: Label: en
Reactive Systems, Barbed Semantics, and the Mobile Ambients: Label: en
Normal Bisimulations in Calculi with Passivation: Label: en
On the Expressive Power of Restriction and Priorities in CCS with Replication: Label: en
The Calculus of Handshake Configurations: Label: en
Parameter Reduction in Grammar-Compressed Trees: Label: en
Interrupt Timed Automata: Label: en
Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata: Label: en
Tighter Bounds for the Determinisation of Büchi Automata: Label: en
A Description of Iterative Reflections of Monads (Extended Abstract): Label: en
Coalgebraic Hybrid Logic: Label: en
A Kleene Theorem for Polynomial Coalgebras: Label: en
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes: Label: en
Dependency Tree Automata: Label: en
On the Completeness of Dynamic Logic: Label: en
Separating Graph Logic from MSO: Label: en
Logics and Bisimulation Games for Concurrency, Causality and Conflict: Label: en
Full Abstraction for Reduced ML: Label: en
Least and Greatest Fixpoints in Game Semantics: Label: en
Facets of Synthesis: Revisiting Church’s Problem: Label: en
A Hierarchy for Delimited Continuations in Call-by-Name: Label: en
Solvability in Resource Lambda-Calculus: Label: en
Untyped Recursion Schemes and Infinite Intersection Types: Label: en
Coalgebraic Correspondence Theory: Label: en
CIA Structures and the Semantics of Recursion: Label: en
Monads Need Not Be Endofunctors: Label: en
The Complexity of Synchronous Notions of Information Flow Security: Label: en
Reachability Analysis of Communicating Pushdown Systems: Label: en
Degrees of Lookahead in Regular Infinite Games: Label: en
Toward a Compositional Theory of Leftist Grammars and Transformations: Label: en
Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems: Label: en