Pages that link to "Item:Q4635786"
From MaRDI portal
The following pages link to 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Q4635786):
Displayed 50 items.
- Higher-Order Model Checking: An Overview (Q4635787) (← links)
- Recent Developments in Quantitative Information Flow (Invited Tutorial) (Q4635788) (← links)
- Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete (Q4635789) (← links)
- Long-Run Average Behaviour of Probabilistic Vector Addition Systems (Q4635790) (← links)
- Demystifying Reachability in Vector Addition Systems (Q4635791) (← links)
- Petri Automata for Kleene Allegories (Q4635792) (← links)
- Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets (Q4635793) (← links)
- A Cubical Approach to Synthetic Homotopy Theory (Q4635794) (← links)
- Game Semantics for Type Soundness (Q4635796) (← links)
- Programs for Cheap! (Q4635797) (← links)
- Polarised Intermediate Representation of Lambda Calculus with Sums (Q4635798) (← links)
- On the Relative Usefulness of Fireballs (Q4635799) (← links)
- Bisimilarity in Fresh-Register Automata (Q4635800) (← links)
- Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME (Q4635801) (← links)
- Branching Bisimilarity on Normed BPA Is EXPTIME-Complete (Q4635802) (← links)
- Distributed Graph Automata (Q4635803) (← links)
- Separating Regular Languages with Two Quantifiers Alternations (Q4635804) (← links)
- Star Height via Games (Q4635805) (← links)
- Nondeterminism in Game Semantics via Sheaves (Q4635806) (← links)
- The Parallel Intensionally Fully Abstract Games Model of PCF (Q4635807) (← links)
- Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes (Q4635808) (← links)
- Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives (Q4635809) (← links)
- Improved Algorithms for One-Pair and k-Pair Streett Objectives (Q4635810) (← links)
- The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable (Q4635811) (← links)
- The Complexity of Boundedness for Guarded Logics (Q4635812) (← links)
- Finite Open-World Query Answering with Number Restrictions (Q4635813) (← links)
- Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results (Q4635814) (← links)
- Path Logics for Querying Graphs: Combining Expressiveness and Efficiency (Q4635815) (← links)
- PDL Is the Bisimulation-Invariant Fragment of Weak Chain Logic (Q4635816) (← links)
- Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras (Q4635817) (← links)
- Defining Winning Strategies in Fixed-Point Logic (Q4635818) (← links)
- Interpolation with Decidable Fixpoint Logics (Q4635819) (← links)
- A Complete Axiomatization of MSO on Infinite Trees (Q4635820) (← links)
- A Fibrational Account of Local States (Q4635822) (← links)
- Varieties of Languages in a Category (Q4635823) (← links)
- Extensions of Domain Maps in Differential and Integral Calculus (Q4635824) (← links)
- Descriptive Set Theory in the Category of Represented Spaces (Q4635825) (← links)
- Domains of Commutative C*-Subalgebras (Q4635826) (← links)
- From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP (Q4635827) (← links)
- Locally Finite Constraint Satisfaction Problems (Q4635828) (← links)
- Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy (Q4635829) (← links)
- One Context Unification Problems Solvable in Polynomial Time (Q4635831) (← links)
- Extending ALCQIO with Trees (Q4635832) (← links)
- Feedback Turing Computability, and Turing Computability as Feedback (Q4635833) (← links)
- Regularity Preserving but Not Reflecting Encodings (Q4635834) (← links)
- Hyper Natural Deduction (Q4635835) (← links)
- Parallelism and Synchronization in an Infinitary Context (Q4635836) (← links)
- A Diagrammatic Axiomatisation for Qubit Entanglement (Q4635837) (← links)
- A Unifying Approach to the Gamma Question (Q4635838) (← links)
- Abstract Hidden Markov Models: A Monadic Account of Quantitative Information Flow (Q4635839) (← links)
