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 #101 to #150.

Counting CTL: Label: en
Model Checking Is Static Analysis of Modal Logic: Label: en
When Model-Checking Freeze LTL over Counter Machines Becomes Decidable: Label: en
An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees: Label: en
On the Relationship between Spatial Logics and Behavioral Simulations: Label: en
Parameterised Multiparty Session Types: Label: en
Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization: Label: en
Forward Analysis of Depth-Bounded Processes: Label: en
Retaining the Probabilities in Probabilistic Testing Theory: Label: en
Fair Adversaries and Randomization in Two-Player Games: Label: en
Completeness for Algebraic Theories of Local State: Label: en
Block Structure vs. Scope Extrusion: Between Innocence and Omniscience: Label: en
Linearly-Used Continuations in the Enriched Effect Calculus: Label: en
A Semantic Foundation for Hidden State: Label: en
Regularity and Context-Freeness over Word Rewriting Systems: Label: en
Minimizing Deterministic Lattice Automata: Label: en
Co-Büching Them All: Label: en
Alternation Elimination for Automata over Nested Words: Label: en
Ordinal Theory for Expressiveness of Well Structured Transition Systems: Label: en
Deriving Labels and Bisimilarity for Concurrent Constraint Programming: Label: en
Sound Bisimulations for Higher-Order Distributed Process Calculus: Label: en
Realizability and Parametricity in Pure Type Systems: Label: en
Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types: Label: en
When Is a Type Refinement an Inductive Type?: Label: en
Irrelevance in Type Theory with a Heterogeneous Equality Judgement: Label: en
What Do Reversible Programs Compute?: Label: en
Similarity Quotients as Final Coalgebras: Label: en
Coalgebraic Walks, in Quantum and Turing Computation: Label: en
The Search for Structure in Quantum Computation: Label: en
The Reduced Product of Abstract Domains and the Combination of Decision Procedures: Label: en
On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks: Label: en
HTML Validation of Context-Free Languages: Label: en
A Trace-Based View on Operating Guidelines: Label: en
Asymptotic Information Leakage under One-Try Attacks: Label: en
Polymorphic Abstract Syntax via Grothendieck Construction: Label: en
Freshness and Name-Restriction in Sets of Traces with Names: Label: en
Synchronous Game Semantics via Round Abstraction: Label: en
Estimation of the Length of Interactions in Arena Game Semantics: Label: en
A Modified GoI Interpretation for a Linear Functional Programming Language and Its Adequacy: Label: en
A Step-Indexed Kripke Model of Hidden State via Recursive Properties on Recursively Defined Metric Spaces: Label: en
Probabilistic Modal μ-Calculus with Independent Product: Label: en
Church Synthesis Problem for Noisy Input: Label: en
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes: Label: en
A Game Approach to Determinize Timed Automata: Label: en
Quantitative Robustness Analysis of Flat Timed Automata: Label: en
On the Complexity of the Equivalence Problem for Probabilistic Automata: Label: en
Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation: Label: en
On the Complexity of Computing Probabilistic Bisimilarity: Label: en
Synthesizing Probabilistic Composers: Label: en
Branching-Time Model Checking of Parametric One-Counter Automata: Label: en