VSL 2014: VIENNA SUMMER OF LOGIC 2014

This page contains an index consisting of author-provided keywords.

A
abstract interpretation	Abstract Interpretation from Buchi Automata
abstract machine	A functional functional interpretation
accumulation	Weight Monitoring with Linear Temporal Logic: Complexity and Decidability
Admissible strategies	The Complexity of Admissibility in Omega-Regular Games
Algebraic effect	Memoryful Geometry of Interaction: From Coalgebraic Components to Algebraic Effects
Algebraic effects	Substitution, jumps, and algebraic effects
Algorithmic randomness	A quest for algorithmically random infinite structures
algorithms	Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
Atomic flows	On the Pigeonhole and Related Principles in Deep Inference and Monotone Systems
Automata	Senescent Ground Tree Rewrite Systems
automata theory	Weak MSO: Automata and Expressiveness Modulo Bisimilarity Infinite-State Energy Games
automatic sequences	On Periodically Iterated Morphisms
auxiliary relations	Pattern Logics and Auxiliary Relations
axiomatization	Axioms and Decidability for Type Isomorphism in the Presence of Sums
B
bimodule	Transition systems over games
bisimulation	Transition systems over games
bisimulation invariance	Weak MSO: Automata and Expressiveness Modulo Bisimilarity
bisimulation up-to	Coinduction Up-To in a Fibrational Setting
Blum-Shub-Smale	On the Computing Power of +, −, and ×
Boehm tree	Compositional Higher-Order Model Checking via Omega-Regular Games over Boehm Trees
Borel determinancy	Infinite sequential games with real-valued payoffs
Borel measurable payoffs	Infinite sequential games with real-valued payoffs
Bounded Polymorphism	System F with Coercion Constraints
bounded quantifier alternation	Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy
Boundedness problem	Hyper-Ackermannian Bounds for Pushdown Vector Addition Systems
Brownian motion	A domain-theoretic approach to Brownian motion and general continuous stochastic processes
Buchi automata	Abstract Interpretation from Buchi Automata
C
Calculus of structures	Equality and Fixpoints in the Calculus of Structures Symmetric Normalisation for Intuitionistic Logic
Categorical semantics	A type theory for productive coprogramming via guarded recursion Memoryful Geometry of Interaction: From Coalgebraic Components to Algebraic Effects
category theory	Substitution, jumps, and algebraic effects Transition systems over games
CCS	On the Discriminating Power of Passivation and Higher-Order Interaction
characterisation theorem	Weak MSO: Automata and Expressiveness Modulo Bisimilarity
classical logic	Formulae-as-Types for an Involutive Negation
Classical realizability	A functional functional interpretation
Clique-Width	Model Checking Existential Logic on Partially Ordered Sets
coalgebra	Coinduction Up-To in a Fibrational Setting
Coercion	System F with Coercion Constraints
coinductive predicates	Coinduction Up-To in a Fibrational Setting
communicating automata	Logic for Communicating Automata with Parameterized Topology
commutative context-free grammars	Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy
complexity	Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic A Decision Procedure for Satisfiability in Separation Logic with Inductive Predicates Logics with Counting and Equivalence
complexity of evaluation	Graph Logics with Rational Relations: The Role of Word Combinatorics
compositionality	Transition systems over games
computability	A domain-theoretic approach to Brownian motion and general continuous stochastic processes
Computational Complexity	Anchored LTL Separation
computational logic	Preservation and Decomposition Theorems for Bounded Degree Structures
Computational Models	Beta Reduction is Invariant, Indeed
concurrency	Compositional Verification of Termination-Preserving Refinement of Concurrent Programs Senescent Ground Tree Rewrite Systems Symmetry in Concurrent Games
Concurrent systems	Equilibria of Concurrent Games on Event Structures
conjunctive query evaluation	One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries
constraint logic	No proof nets for MLL with units: Proof equivalence in MLL is PSPACE-complete
Constraint satisfaction problems	Turing Machines with Atoms, Constraint Satisfaction Problems, and Descriptive Complexity
Constructive temporal logic	Functional Reactive Types
context semantics	On Context Semantics for Interaction Nets
contextual equivalence	On the Discriminating Power of Passivation and Higher-Order Interaction
continuations	Formulae-as-Types for an Involutive Negation
continuous payoffs	Infinite sequential games with real-valued payoffs
Control	Substitution, jumps, and algebraic effects
Conversion	System F with Coercion Constraints
Corecursion	A type theory for productive coprogramming via guarded recursion
correctness criterion	A new correctness criterion for MLL proof nets
cost automata	Two-Way Cost Automata and Cost Logics over Infinite Trees
Cost Models	Beta Reduction is Invariant, Indeed
cost monadic second-order logic	Two-Way Cost Automata and Cost Logics over Infinite Trees
counting quantifiers	Logics with Counting and Equivalence
cut elimination	Symmetric Normalisation for Intuitionistic Logic
D
data trees	Pattern Logics and Auxiliary Relations
database theory	On the Succinctness of Query Rewriting over OWL 2 QL Ontologies with Bounded Chase MSO Queries on Trees: Enumerating Answers under Updates
deadlock	Deadlock and lock freedom in the linear pi-calculus
decidability	Pattern Logics and Auxiliary Relations Decidability of Weak Logics with Deterministic Transitive Closure Axioms and Decidability for Type Isomorphism in the Presence of Sums
decomposition theorems	Decomposition Theorems and Model-Checking for the Modal mu-calculus
Deep inference	Equality and Fixpoints in the Calculus of Structures Symmetric Normalisation for Intuitionistic Logic On the Pigeonhole and Related Principles in Deep Inference and Monotone Systems
degree sequences	On Hanf-equivalence and the number of embeddings of small induced subgraphs
delay	MSO Queries on Trees: Enumerating Answers under Updates
delimited control operators	Formulae-as-Types for an Involutive Negation
denotational semantics	A type theory for productive coprogramming via guarded recursion Transition systems over games On Context Semantics for Interaction Nets On the characterization of models of H*
dependent types	Eilenberg-MacLane Spaces in Homotopy Type Theory A functional functional interpretation
Descriptive complexity theory	Turing Machines with Atoms, Constraint Satisfaction Problems, and Descriptive Complexity
deterministic transitive closure	Decidability of Weak Logics with Deterministic Transitive Closure
Dialectica translation	A functional functional interpretation
Direct style	A functional functional interpretation
disjoint unions	Axioms and Decidability for Type Isomorphism in the Presence of Sums
distance metrics	On the Total Variation Distance of Labelled Markov Chains
DNF duality	Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
domain theory	A domain-theoretic approach to Brownian motion and general continuous stochastic processes
domains	On the characterization of models of H*
E
effect system	Compositional Higher-Order Model Checking via Omega-Regular Games over Boehm Trees
Ehrenfeucht-Fraïssé games	Separating Regular Languages with First-Order Logic
elementary algorithms	Preservation and Decomposition Theorems for Bounded Degree Structures
Energy games	Infinite-State Energy Games
Entropy of formal languages	Asymptotic behaviour in temporal logic
enumeration	MSO Queries on Trees: Enumerating Answers under Updates
Equality	Equality and Fixpoints in the Calculus of Structures
equivalence	On the Total Variation Distance of Labelled Markov Chains
equivalence relation	Logics with Counting and Equivalence
Event structures	Symmetry in Concurrent Games Equilibria of Concurrent Games on Event Structures
Explicit Substitutions	Beta Reduction is Invariant, Indeed
expressive completeness	Expressive Completeness of Separation Logic With Two Variables and No Separating Conjunction
expressive power	Separating Regular Languages with First-Order Logic Pattern Logics and Auxiliary Relations
F
fast-growing complexity	Non-Elementary Complexities for Branching VASS, MELL, and Extensions
Feferman-Vaught	Preservation and Decomposition Theorems for Bounded Degree Structures
fibrations	Coinduction Up-To in a Fibrational Setting
filter-model	On the characterization of models of H*
finite automata	MSO Queries on Trees: Enumerating Answers under Updates Weight Monitoring with Linear Temporal Logic: Complexity and Decidability
Finite model theory	On Hanf-equivalence and the number of embeddings of small induced subgraphs
first order logic	Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
first order logic with majority quantifiers	Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
first-order logic	Faster decision of first-order graph properties Separating Regular Languages with First-Order Logic Pattern Logics and Auxiliary Relations Logics with Counting and Equivalence Preservation and Decomposition Theorems for Bounded Degree Structures
First-Order Logic Model Checking	Model Checking Existential Logic on Partially Ordered Sets
first-order model checking	The Tractability Frontier of Graph-Like First-Order Query Sets
fixed-parameter complexity	Decomposition Theorems and Model-Checking for the Modal mu-calculus
Fixpoints	Equality and Fixpoints in the Calculus of Structures
focalisation	Formulae-as-Types for an Involutive Negation
Formal verification	Local Temporal Reasoning
formalized mathematics	Eilenberg-MacLane Spaces in Homotopy Type Theory
formulae-as-types	Formulae-as-Types for an Involutive Negation
full abstraction	On the characterization of models of H*
Function combinators	Regular Combinators for String Transformations
Functional reactive programming	Functional Reactive Types
G
Gale-Stewart games	Infinite sequential games with real-valued payoffs
Game Semantics	Compositional Higher-Order Model Checking via Omega-Regular Games over Boehm Trees Transition systems over games Equilibria of Concurrent Games on Event Structures
Games	The Complexity of Admissibility in Omega-Regular Games Symmetry in Concurrent Games
Games on graphs	Finite-Memory Strategy Synthesis for Robust Multidimensional Mean-Payoff Objectives
Geometry of Interaction	The Geometry of Synchronization Memoryful Geometry of Interaction: From Coalgebraic Components to Algebraic Effects
graph algorithms	Faster decision of first-order graph properties
graph rewriting	On Context Semantics for Interaction Nets
graph theory	On Hanf-equivalence and the number of embeddings of small induced subgraphs Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries
Ground Tree Rewrite Systems	Senescent Ground Tree Rewrite Systems
GSOS	Coinduction Up-To in a Fibrational Setting
guarded logics	Effective Interpolation and Preservation in Guarded Logics
Guarded recursion	A type theory for productive coprogramming via guarded recursion
H
Hanf-locality	On Hanf-equivalence and the number of embeddings of small induced subgraphs
higher-order model checking	Compositional Higher-Order Model Checking via Omega-Regular Games over Boehm Trees
higher-order pi-calculus	On the Discriminating Power of Passivation and Higher-Order Interaction
Higher-order programs	Local Temporal Reasoning
Hoare logic	On the Hoare Theory of Monadic Recursion Schemes
homomorphism preservation in the finite	Pattern Logics and Auxiliary Relations
homomorphisms	Preservation and Decomposition Theorems for Bounded Degree Structures
homotopy	Symmetry in Concurrent Games
homotopy type theory	Eilenberg-MacLane Spaces in Homotopy Type Theory
Hyper-Ackermannian complexity	Hyper-Ackermannian Bounds for Pushdown Vector Addition Systems
hypergraph duality	Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
Hypergraph transversals	Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
Hyprgraphs	Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
I
implicit computational complexity	On Context Semantics for Interaction Nets Beta Reduction is Invariant, Indeed
incremental evaluation	MSO Queries on Trees: Enumerating Answers under Updates
Induction	Equality and Fixpoints in the Calculus of Structures
inductive predicates	A Decision Procedure for Satisfiability in Separation Logic with Inductive Predicates
Infinite connected graph of bounded degree	A quest for algorithmically random infinite structures
Infinite tree	A quest for algorithmically random infinite structures
Interaction nets	On Context Semantics for Interaction Nets
Interpolation	Effective Interpolation and Preservation in Guarded Logics
intersection types	Compositional Higher-Order Model Checking via Omega-Regular Games over Boehm Trees
intuitionistic logic	Symmetric Normalisation for Intuitionistic Logic
J
Janin-Walukiewicz theorem	Weak MSO: Automata and Expressiveness Modulo Bisimilarity
K
Kleene algebra	KAT + B!
Kleene algebra with tests	KAT + B!
L
labelled Markov Chains	On the Total Variation Distance of Labelled Markov Chains
lambda calculus	Beta Reduction is Invariant, Indeed
lambda-calculus	Transition systems over games On Context Semantics for Interaction Nets On the Discriminating Power of Passivation and Higher-Order Interaction
limited nondeterminism	Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
linear logic	The Geometry of Synchronization A new correctness criterion for MLL proof nets A functional functional interpretation On Context Semantics for Interaction Nets Non-Elementary Complexities for Branching VASS, MELL, and Extensions Equality and Fixpoints in the Calculus of Structures
linear pi-calculus	Deadlock and lock freedom in the linear pi-calculus
Linear Temporal Logic	Anchored LTL Separation Asymptotic behaviour in temporal logic
Liveness	Anchored LTL Separation Probably Safe or Live
locality	Pattern Logics and Auxiliary Relations
Lock-freedom	Compositional Verification of Termination-Preserving Refinement of Concurrent Programs
logic of infinite sequences	On Periodically Iterated Morphisms
Logic over graphs	Logical Characterization of Weighted Pebble Walking Automata
logical analysis of algorithms	Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
Logical aspects of computational complexity	On the Succinctness of Query Rewriting over OWL 2 QL Ontologies with Bounded Chase
Logics for AI	On the Succinctness of Query Rewriting over OWL 2 QL Ontologies with Bounded Chase
logics for graphs	Graph Logics with Rational Relations: The Role of Word Combinatorics
Los-Tarski	Preservation and Decomposition Theorems for Bounded Degree Structures
LTL	The Complexity of Admissibility in Omega-Regular Games Weight Monitoring with Linear Temporal Logic: Complexity and Decidability
LTL Separation	Anchored LTL Separation
M
Markov Chain	Weight Monitoring with Linear Temporal Logic: Complexity and Decidability
Markov chains	Zero-Reachability in Probabilistic Multi-Counter Automata
Martin Lof randomness	A quest for algorithmically random infinite structures
Martin Lof test	A quest for algorithmically random infinite structures
matrix multiplication	Faster decision of first-order graph properties
MDP	Weight Monitoring with Linear Temporal Logic: Complexity and Decidability
mean-payoff and discounted sum	Secure Equilibria in Weighted Games
mean-payoff games	Finite-Memory Strategy Synthesis for Robust Multidimensional Mean-Payoff Objectives
Measure	A quest for algorithmically random infinite structures
message sequence charts	Logic for Communicating Automata with Parameterized Topology
Modal and temporal logics	Equilibria of Concurrent Games on Event Structures
modal logic	Decomposition Theorems and Model-Checking for the Modal mu-calculus
modal µ-calculus	Weak MSO: Automata and Expressiveness Modulo Bisimilarity
model checking	Weight Monitoring with Linear Temporal Logic: Complexity and Decidability Decomposition Theorems and Model-Checking for the Modal mu-calculus
model counting	Satisfiability Modulo Counting: A New Approach for Analyzing Privacy Properties
modulo counting quantifiers	Preservation and Decomposition Theorems for Bounded Degree Structures
Monadic metalanguages	Substitution, jumps, and algebraic effects
monadic program schemes	On the Hoare Theory of Monadic Recursion Schemes
monadic recursion schemes	On the Hoare Theory of Monadic Recursion Schemes
monadic second-order logic	Logic for Communicating Automata with Parameterized Topology
Monads	Substitution, jumps, and algebraic effects
monitor	Weight Monitoring with Linear Temporal Logic: Complexity and Decidability
Monoid	A quest for algorithmically random infinite structures
Monotone proofs	On the Pigeonhole and Related Principles in Deep Inference and Monotone Systems
morphic words	On Periodically Iterated Morphisms
MSO	MSO Queries on Trees: Enumerating Answers under Updates
MSO-automata	Weak MSO: Automata and Expressiveness Modulo Bisimilarity
mu-calculus	Decomposition Theorems and Model-Checking for the Modal mu-calculus
Muller games	The Complexity of Admissibility in Omega-Regular Games
Multi-counter automata	Zero-Reachability in Probabilistic Multi-Counter Automata
Multi-Stack Pushdown Systems	Senescent Ground Tree Rewrite Systems
multidimensional quantitative games	Finite-Memory Strategy Synthesis for Robust Multidimensional Mean-Payoff Objectives
multiplicative linear logic	No proof nets for MLL with units: Proof equivalence in MLL is PSPACE-complete
mutable state	KAT + B!
N
Nash equilibria	Equilibria of Concurrent Games on Event Structures
Nash equilibrium	Infinite sequential games with real-valued payoffs
Nested words	Hyper-Ackermannian Bounds for Pushdown Vector Addition Systems
nominal automata	Coinduction Up-To in a Fibrational Setting
Noninterleaving semantics	Equilibria of Concurrent Games on Event Structures
Normalisation	Symmetric Normalisation for Intuitionistic Logic
O
Omega-automata	Anchored LTL Separation
Ontology-based data access	On the Succinctness of Query Rewriting over OWL 2 QL Ontologies with Bounded Chase
operational semantics	Transition systems over games
P
parameterized communication topology	Logic for Communicating Automata with Parameterized Topology
parameterized complexity	One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries The Tractability Frontier of Graph-Like First-Order Query Sets Model Checking Existential Logic on Partially Ordered Sets
parity games	Decomposition Theorems and Model-Checking for the Modal mu-calculus
Partially Ordered Sets	Model Checking Existential Logic on Partially Ordered Sets
passivation	On the Discriminating Power of Passivation and Higher-Order Interaction
patterns	Pattern Logics and Auxiliary Relations
PCTL	Probably Safe or Live
Pebble walking automata	Logical Characterization of Weighted Pebble Walking Automata
periodically iterated morphisms	On Periodically Iterated Morphisms
pigeonhole principle	On the Pigeonhole and Related Principles in Deep Inference and Monotone Systems
polarisation	Formulae-as-Types for an Involutive Negation
polymorphism	System F with Coercion Constraints Deadlock and lock freedom in the linear pi-calculus
PosSLP	On the Computing Power of +, −, and ×
Presburger arithmetic	Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy
preservation	Effective Interpolation and Preservation in Guarded Logics
preservation theorems	Preservation and Decomposition Theorems for Bounded Degree Structures
presheaf	Transition systems over games
Privacy & Information Flow	Satisfiability Modulo Counting: A New Approach for Analyzing Privacy Properties
probabilistic systems	On the Total Variation Distance of Labelled Markov Chains
probability	Probably Safe or Live
Program Logic	Compositional Verification of Termination-Preserving Refinement of Concurrent Programs
program schematology	KAT + B!
program transformation	KAT + B!
proof complexity	On the Pigeonhole and Related Principles in Deep Inference and Monotone Systems
proof equivalence problem	No proof nets for MLL with units: Proof equivalence in MLL is PSPACE-complete
proof nets	A new correctness criterion for MLL proof nets No proof nets for MLL with units: Proof equivalence in MLL is PSPACE-complete
proof theory	Formulae-as-Types for an Involutive Negation
proof-nets	The Geometry of Synchronization
pure lambda-calculus	On the characterization of models of H*
pushdown automata	Infinite-State Energy Games
Pushdown Systems	Senescent Ground Tree Rewrite Systems
Q
Quantitative analysis	Regular Combinators for String Transformations
Quantitative Model-Checking	Asymptotic behaviour in temporal logic
quantitative objectives	Secure Equilibria in Weighted Games
quantitative synthesis	Finite-Memory Strategy Synthesis for Robust Multidimensional Mean-Payoff Objectives
quantum computation	The Geometry of Synchronization
R
rational relations	Graph Logics with Rational Relations: The Role of Word Combinatorics
reachability	Zero-Reachability in Probabilistic Multi-Counter Automata Senescent Ground Tree Rewrite Systems
Real Turing Machine	On the Computing Power of +, −, and ×
reconfiguration problem	No proof nets for MLL with units: Proof equivalence in MLL is PSPACE-complete
refinement	Compositional Verification of Termination-Preserving Refinement of Concurrent Programs
Regular cost functions	Regular Combinators for String Transformations
regular expressions	Regular Combinators for String Transformations
Regular Languages of Infinite Words	Separating Regular Languages with First-Order Logic
Regular Languages of Words	Separating Regular Languages with First-Order Logic
regular path queries	Graph Logics with Rational Relations: The Role of Word Combinatorics
Retyping functions	System F with Coercion Constraints
rewards	Weight Monitoring with Linear Temporal Logic: Complexity and Decidability
Rewrite Systems	Senescent Ground Tree Rewrite Systems
Rewriting	Beta Reduction is Invariant, Indeed
robust quantitative objectives	Finite-Memory Strategy Synthesis for Robust Multidimensional Mean-Payoff Objectives
S
Safety	Anchored LTL Separation Probably Safe or Live The Complexity of Admissibility in Omega-Regular Games
satisfiability	A Decision Procedure for Satisfiability in Separation Logic with Inductive Predicates Logics with Counting and Equivalence
Satisfiability Modulo Theories	Satisfiability Modulo Counting: A New Approach for Analyzing Privacy Properties
Scope-Bounding	Senescent Ground Tree Rewrite Systems
second-order logic	Expressive Completeness of Separation Logic With Two Variables and No Separating Conjunction
secure equilibria	Secure Equilibria in Weighted Games
semantics	Symmetry in Concurrent Games
semialgebraic	On the Computing Power of +, −, and ×
Semigroups	Separating Regular Languages with First-Order Logic
Semilattice Polymorphisms	Model Checking Existential Logic on Partially Ordered Sets
separation	Separating Regular Languages with First-Order Logic
separation logic	A Decision Procedure for Satisfiability in Separation Logic with Inductive Predicates Expressive Completeness of Separation Logic With Two Variables and No Separating Conjunction
session types	Deadlock and lock freedom in the linear pi-calculus
Sets with atoms	Turing Machines with Atoms, Constraint Satisfaction Problems, and Descriptive Complexity
shuffle	Graph Logics with Rational Relations: The Role of Word Combinatorics
similarity	Coinduction Up-To in a Fibrational Setting
simulation	Compositional Verification of Termination-Preserving Refinement of Concurrent Programs
stochastic processes	A domain-theoretic approach to Brownian motion and general continuous stochastic processes
strategies	Symmetry in Concurrent Games
String transducers	Regular Combinators for String Transformations
Strong Embedding	Model Checking Existential Logic on Partially Ordered Sets
structures of bounded degree	Preservation and Decomposition Theorems for Bounded Degree Structures
subgame perfect	Infinite sequential games with real-valued payoffs
substitution	Substitution, jumps, and algebraic effects
subtyping	System F with Coercion Constraints
subword complexity	On Periodically Iterated Morphisms
Symmetry	Symmetry in Concurrent Games
synthesis	The Complexity of Admissibility in Omega-Regular Games
System F	System F with Coercion Constraints
T
TC_0	Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
temporal logic	Local Temporal Reasoning
Term	A quest for algorithmically random infinite structures
termination	Compositional Verification of Termination-Preserving Refinement of Concurrent Programs
token machines	The Geometry of Synchronization
transition system	Transition systems over games Weight Monitoring with Linear Temporal Logic: Complexity and Decidability
Transitive closure	Logical Characterization of Weighted Pebble Walking Automata
trees	MSO Queries on Trees: Enumerating Answers under Updates
treewidth	The Tractability Frontier of Graph-Like First-Order Query Sets
Turing machines	Turing Machines with Atoms, Constraint Satisfaction Problems, and Descriptive Complexity
two-dimensional partial map	Transition systems over games
two-player games on weighted graphs	Secure Equilibria in Weighted Games
two-variable logic	Decidability of Weak Logics with Deterministic Transitive Closure
two-variable logics	Expressive Completeness of Separation Logic With Two Variables and No Separating Conjunction
two-way automata	Two-Way Cost Automata and Cost Logics over Infinite Trees
Type	System F with Coercion Constraints
Type and effect system	Abstract Interpretation from Buchi Automata
Type containment	System F with Coercion Constraints
type isomorphism	Axioms and Decidability for Type Isomorphism in the Presence of Sums
Type systems	Functional Reactive Types
type theory	A type theory for productive coprogramming via guarded recursion
U
ultimately-periodic sets	Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy
Unification	Equality and Fixpoints in the Calculus of Structures
Universal algebra	A quest for algorithmically random infinite structures
up-to techniques	Coinduction Up-To in a Fibrational Setting
V
vector addition systems	Hyper-Ackermannian Bounds for Pushdown Vector Addition Systems Infinite-State Energy Games Non-Elementary Complexities for Branching VASS, MELL, and Extensions
verification	Senescent Ground Tree Rewrite Systems
W
weak EXP hierarchy	Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy
weak monadic second-order	Weak MSO: Automata and Expressiveness Modulo Bisimilarity
Weighted first-order logic	Logical Characterization of Weighted Pebble Walking Automata
weights	Weight Monitoring with Linear Temporal Logic: Complexity and Decidability
Well-structured pushdown systems	Hyper-Ackermannian Bounds for Pushdown Vector Addition Systems
Wiener measure	A domain-theoretic approach to Brownian motion and general continuous stochastic processes
WMSO	Weak MSO: Automata and Expressiveness Modulo Bisimilarity
word equations	Graph Logics with Rational Relations: The Role of Word Combinatorics
X
XML and graph data	Pattern Logics and Auxiliary Relations

Disclaimer | Powered by EasyChair Smart Program