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 #1 to #50.

Generalized Parity Games: Label: en
An Effective Algorithm for the Membership Problem for Extended Regular Expressions: Label: en
Relational Parametricity and Separation Logic: Label: en
Logical Characterizations of Bisimulations for Discrete Probabilistic Systems: Label: en
The Complexity of Generalized Satisfiability for Linear Temporal Logic: Label: en
Polynomial Constraints for Sets with Cardinality Bounds: Label: en
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems: Label: en
Sampled Universality of Timed Automata: Label: en
Tree Automata with Memory, Visibility and Structural Constraints: Label: en
Complexity Results on Balanced Context-Free Languages: Label: en
Model-Checking One-Clock Priced Timed Automata: Label: en
Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems: Label: en
Semantic Barbs and Biorthogonality: Label: en
Formalising the π-Calculus Using Nominal Logic: Label: en
A Distribution Law for CCS and a New Congruence Result for the π-Calculus: Label: en
Iterator Types: Label: en
Enriched μ-Calculi Module Checking: Label: en
Logical Reasoning for Higher-Order Functions with Local State: Label: en
Optimal Strategy Synthesis in Stochastic Müller Games: Label: en
On the Stability by Union of Reducibility Candidates: Label: en
The Rewriting Calculus as a Combinatory Reduction System: Label: en
A Lower Bound on Web Services Composition: Label: en
On the Expressiveness and Complexity of ATL: Label: en
Types and Effects for Resource Usage Analysis: Label: en
PDL with Intersection and Converse Is 2EXP-Complete: Label: en
Model Checking Freeze LTL over One-Counter Automata: Label: en
What Else Is Decidable about Integer Arrays?: Label: en
Products of Message Sequence Charts: Label: en
Compositional Methods for Information-Hiding: Label: en
Structural Operational Semantics for Stochastic Process Calculi: Label: en
Deriving Bisimulation Congruences in the Presence of Negative Application Conditions: Label: en
Symbolic Semantics Revisited: Label: en
Strong Normalisation of Cut-Elimination That Simulates β-Reduction: Label: en
The Implicit Calculus of Constructions as a Programming Language with Dependent Types: Label: en
Erasure and Polymorphism in Pure Type Systems: Label: en
RPO, Second-Order Contexts, and λ-Calculus: Label: en
Prevision Domains and Convex Powercones: Label: en
Model-Checking ω-Regular Properties of Interval Markov Chains: Label: en
On Decision Problems for Probabilistic Büchi Automata: Label: en
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity: Label: en
Systems of Equations Satisfied in All Commutative Finite Semigroups: Label: en
The Microcosm Principle and Concurrency in Coalgebra: Label: en
Coalgebraic Logic and Synthesis of Mealy Machines: Label: en
A Modal Deconstruction of Access Control Logics: Label: en
Footprints in Local Reasoning: Label: en
The Complexity of CTL* + Linear Past: Label: en
The Common Fragment of ACTL and LTL: Label: en
Robust Analysis of Timed Automata Via Channel Machines: Label: en
A Kleene-Schützenberger Theorem for Weighted Timed Automata: Label: en
Classes of Tree Homomorphisms with Decidable Preservation of Regularity: Label: en