LICS 2016: THIRTY FIRST ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE

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

(
(co)induction	Towards Completeness via Proof Search in the Linear Time Mu-calculus
\
\omega-categorical	The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
A
acyclicity	Semantically Acyclic Conjunctive Queries under Functional Dependencies
algebra	Two-variable logic with a between relation
Algebraic characterizations	First-order definability of rational transductions: An algebraic approach
Algebraic Theories	Program Equivalence is Coinductive
algorithm	Hanf normal form for first-order logic with unary counting quantifiers
algorithmic randomness	Effective Brenier's Theorem: Applications to Computable Analysis and Algorithmic Randomness
Algorithms
Almost-sure winning	Perfect-information Stochastic Games with Generalized Mean-Payoff Objectives
arc consistency	The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
automata	A step up in expressiveness of decidable fixpoint logics Proving Liveness of Parameterized Programs
Automata minimization	Minimization of Symbolic Tree Automata
Automata on infinite trees	Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings How unprovable is Rabin's decidability theorem?
automata theory	Complexity of regular abstractions of one-counter languages
Automata with equality and disequality constraints	Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings
Automated Theorem Proving	Deciding First-Order Satisfiability when Universal and Existential Variables are Separated
automatic structures	First-order logic with reachability for infinite-state systems
Axiom of choice	Hybrid realizability for intuitionistic and classical choice
Axiomatic Domain Theory	Fixed Points in Quantitative Semantics
B
Bar recursion	Goedel's functional interpretation and the concept of learning Hybrid realizability for intuitionistic and classical choice
barycentric axioms	Quantitative Algebraic Reasoning
behavioural approach	A categorical approach to open and interconnected dynamical systems
Bernays-Schönfinkel-Ramsey Class	Deciding First-Order Satisfiability when Universal and Existential Variables are Separated
Bishop spaces	A constructive function-theoretic approach to topological compactness
bisimulation	Ability to Count Messages Is Worth $\Theta(\Delta)$ Rounds in Distributed Computing Comparing Chemical Reaction Networks: A Categorical and Algorithmic Perspective
Bounded arithmetic	Understanding Gentzen and Frege Systems for QBF From positive and intuitionistic bounded arithmetic to proof complexity
bounded tree width	Order Invariance on Decomposable Structures
Bounded variation property	A Generalised Twinning Property for Minimisation of Cost Register Automata
bounded width	Graphs of relational structures: restricted colours
boundedness	A step up in expressiveness of decidable fixpoint logics
Brenier's theorem	Effective Brenier's Theorem: Applications to Computable Analysis and Algorithmic Randomness
C
c.e. algebra	Quantifier Free Definability on Infinite Algebras
categorical quantum mechanics	Interacting Frobenius Algebras are Hopf.
category theory	Interacting Frobenius Algebras are Hopf. A categorical approach to open and interconnected dynamical systems
chase	Semantically Acyclic Conjunctive Queries under Functional Dependencies
Chemical Reaction Networks	Comparing Chemical Reaction Networks: A Categorical and Algorithmic Perspective
circular proofs	Towards Completeness via Proof Search in the Linear Time Mu-calculus
classical logic	Unified Semantics and Proof System for Classical, Intuitionistic and Affine Logics
coinduction	Program Equivalence is Coinductive Coinduction All the Way Up
Coinductive Types	Type Theory based on Dependent Inductive and Coinductive Types
Communicating Processes	Data Communicating Processes with Unreliable Channels
commuting matrices	Solvability of Matrix-Exponential Equations
Comodels	Program Equivalence is Coinductive
compactness	A constructive function-theoretic approach to topological compactness
complete lattices	Coinduction All the Way Up
complexity	Graphs of relational structures: restricted colours Two-variable logic with a between relation Decidability and Complexity for Quiescent Consistency
compositionality	Towards Compositional Feedback in Non-Deterministic and Non-Input-Receptive Systems Kolmogorov Extension, Martingale Convergence, and Compositionality of Processes
computability	Effective Brenier's Theorem: Applications to Computable Analysis and Algorithmic Randomness
Computational complexity
computer-checked proofs	A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type Theory
Concurrency	Proving Liveness of Parameterized Programs
concurrency theory	Stochastic mechanics of graph rewriting
Concurrent objects	Decidability and Complexity for Quiescent Consistency
Conditional lower bounds	Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction
confluence	Infinitary Lambda Calculi from a Linear Perspective
congruence	Divide and Congruence II: Delay and Weak Bisimilarity
Congruence relations	Quantifier Free Definability on Infinite Algebras
Conjunctive Queries	Semantically Acyclic Conjunctive Queries under Functional Dependencies
conjunctive query	Querying Visible and Invisible Information
constraint satisfaction problem	Weak consistency notions for all the CSPs of bounded width Graphs of relational structures: restricted colours The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
constraint satisfaction problems	Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
constructive topology	A constructive function-theoretic approach to topological compactness
control theory	A categorical approach to open and interconnected dynamical systems
Coq	The Definitional Side of the Forcing
cost models	Church Meets Cook and Levin
Cost register automata	A Generalised Twinning Property for Minimisation of Cost Register Automata
Counting Logic	Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps
counting quantifiers	Upper Bounds on the Quantifier Depth For Graph Differentiation in First Order Logic
Cyber-Physical Systems	Differential Refinement Logic
D
DATALOG	Weak consistency notions for all the CSPs of bounded width
decidability	First-order logic with reachability for infinite-state systems Two-variable logic with a between relation Decidability and Complexity for Quiescent Consistency
Decidable First-Order Class	Deciding First-Order Satisfiability when Universal and Existential Variables are Separated
Deep inference	From positive and intuitionistic bounded arithmetic to proof complexity
definability	Quantifier Free Definability on Infinite Algebras
Definability problems	First-order definability of rational transductions: An algebraic approach
delimited continuations	Unified Semantics and Proof System for Classical, Intuitionistic and Affine Logics
Denotational semantics	Denotational semantics of recursive types in synthetic guarded domain theory
Dependent type theory	The Definitional Side of the Forcing
Dependent Types	A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type Theory Type Theory based on Dependent Inductive and Coinductive Types
determinacy of Gale-Stewart games	How unprovable is Rabin's decidability theorem?
diagrammatic reasoning	Rewriting modulo symmetric monoidal structure A categorical approach to open and interconnected dynamical systems
Dichotomy conjecture	The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
differentiability	Effective Brenier's Theorem: Applications to Computable Analysis and Algorithmic Randomness
Differential Dynamic Logic	Differential Refinement Logic
differential equations	On Recurrent Reachability for Continuous Linear Dynamical Systems
Differential privacy	Proving Differential Privacy via Probabilistic Couplings
Diophantine approximation	On Recurrent Reachability for Continuous Linear Dynamical Systems
discriminator variety	Factor Varieties and Symbolic Computation
distributed computing	Ability to Count Messages Is Worth $\Theta(\Delta)$ Rounds in Distributed Computing
distribution	Quantitative Automata under Probabilistic Semantics
Downward closed languages	The diagonal problem for higher-order recursive schemes is decidable
downward closure	Complexity of regular abstractions of one-counter languages
DPO rewriting	Rewriting modulo symmetric monoidal structure
duality	Healthiness from Duality
duality theorem	Semi-galois Categories I: The Classical Eilenberg Variety Theory
dualizing object	Healthiness from Duality
Dynamic Semantics	Interaction Graphs: Full Linear Logic
E
Effects	The Definitional Side of the Forcing
Eilenberg's variety theory	Semi-galois Categories I: The Classical Eilenberg Variety Theory
Emptiness problem	Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings
enhancements	Coinduction All the Way Up
entailment	Querying Visible and Invisible Information
equational logic	Program Equivalence is Coinductive Factor Varieties and Symbolic Computation
Equational reasoning	Quantitative Algebraic Reasoning
evaluation problem	Semantically Acyclic Conjunctive Queries under Functional Dependencies
Event Structures	On Thin Air Reads: Towards an Event Structures Model of Relaxed Memory
expected runtime	Reasoning about Recursive Probabilistic Programs
expected value	Quantitative Automata under Probabilistic Semantics
exponential matrices	Solvability of Matrix-Exponential Equations
F
factor circuit	Factor Varieties and Symbolic Computation
factor variety	Factor Varieties and Symbolic Computation
fast-growing complexity	The Complexity of Coverability in ν-Petri Nets
Feedback	Towards Compositional Feedback in Non-Deterministic and Non-Input-Receptive Systems
few subalgebras	Graphs of relational structures: restricted colours
Fibrations	Type Theory based on Dependent Inductive and Coinductive Types
finite algebras	Graphs of relational structures: restricted colours
Finite Model Property	Deciding First-Order Satisfiability when Universal and Existential Variables are Separated
finite model theory	Order Invariance on Decomposable Structures
Finite satisfiability	Order-Invariance of Two-Variable Logic is Decidable
Finite Variable Logics	Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps
Finiteness problem	Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings
first order logic	Upper Bounds on the Quantifier Depth For Graph Differentiation in First Order Logic
first-order logic	First-order logic with reachability for infinite-state systems Order Invariance on Decomposable Structures Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps Hanf normal form for first-order logic with unary counting quantifiers
First-order logics	First-order definability of rational transductions: An algebraic approach
Fixed Points	Fixed Points in Quantitative Semantics
fixpoint	A step up in expressiveness of decidable fixpoint logics
FO Logic	A New Perspective on FO Model Checking of Dense Graph Classes
focusing	Unified Semantics and Proof System for Classical, Intuitionistic and Affine Logics
forbidden patterns	The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
Forcing	The Definitional Side of the Forcing
Formal Methods	Differential Refinement Logic
Formal Verification	Differential Refinement Logic The Complexity of Coverability in ν-Petri Nets
FPC	Denotational semantics of recursive types in synthetic guarded domain theory
Frege systems	Understanding Gentzen and Frege Systems for QBF
Frobenius algebra	Interacting Frobenius Algebras are Hopf.
Frobenius monoid	Rewriting modulo symmetric monoidal structure
functional dependencies	Semantically Acyclic Conjunctive Queries under Functional Dependencies
functional interpretation	Goedel's functional interpretation and the concept of learning
Functor categories	Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
G
Game semantics	Plays as Resource Terms via Non-idempotent Intersection Types
game semantics for programming languages	Trace semantics for polymorphic references
games	Games with bound guess actions
Games on graphs	Perfect-information Stochastic Games with Generalized Mean-Payoff Objectives
Geometry of Interaction	Interaction Graphs: Full Linear Logic
Graph algorithms	Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction
graph identification	Upper Bounds on the Quantifier Depth For Graph Differentiation in First Order Logic
graph monoids	First-order logic with reachability for infinite-state systems
graph rewriting	Stochastic mechanics of graph rewriting
graphical calculi	Interacting Frobenius Algebras are Hopf.
guarded fragment	A step up in expressiveness of decidable fixpoint logics
Guarded Recursion	Denotational semantics of recursive types in synthetic guarded domain theory
H
Hanf normal form	Hanf normal form for first-order logic with unary counting quantifiers
Hausdorff metrics	Quantitative Algebraic Reasoning
healthiness	Healthiness from Duality
higher inductive types	Constructions with Non-Recursive Higher Inductive Types
Higher-order model checking	The diagonal problem for higher-order recursive schemes is decidable
higher-order references	Trace semantics for polymorphic references
homogeneous structures	Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
homotopy type theory	Constructions with Non-Recursive Higher Inductive Types A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type Theory
Hopf algebra	Interacting Frobenius Algebras are Hopf.
hybrid automata	Solvability of Matrix-Exponential Equations
Hybrid Systems	Differential Refinement Logic
I
implicit computational complexity	Church Meets Cook and Levin
Inductive types	Type Theory based on Dependent Inductive and Coinductive Types The Definitional Side of the Forcing
infinitary rewriting	Infinitary Lambda Calculi from a Linear Perspective
Infinite domain	The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
integrity constraints	Querying Visible and Invisible Information
intersection types	Plays as Resource Terms via Non-idempotent Intersection Types
intuitionistic logic	Understanding Gentzen and Frege Systems for QBF From positive and intuitionistic bounded arithmetic to proof complexity
Isabelle Formalization	Towards Compositional Feedback in Non-Deterministic and Non-Input-Receptive Systems
K
Kantorovich metrics	Quantitative Algebraic Reasoning
Kolmogorov extension	Kolmogorov Extension, Martingale Convergence, and Compositionality of Processes
L
Lambda Calculus	Fixed Points in Quantitative Semantics Infinitary Lambda Calculi from a Linear Perspective
Lambda Y calculus	The diagonal problem for higher-order recursive schemes is decidable
lambda-calculus	Church Meets Cook and Levin
lambda-mu calculus	Unified Semantics and Proof System for Classical, Intuitionistic and Affine Logics
Lawvere's presheaf hyperdoctrine	A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine
learning	Goedel's functional interpretation and the concept of learning
linear dynamical systems	On Recurrent Reachability for Continuous Linear Dynamical Systems
linear logic	Unified Semantics and Proof System for Classical, Intuitionistic and Affine Logics A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine Interaction Graphs: Full Linear Logic Conflict nets: efficient locally canonical MALL proof nets Church Meets Cook and Levin
Linear order	Order-Invariance of Two-Variable Logic is Decidable
local algorithms	Ability to Count Messages Is Worth $\Theta(\Delta)$ Rounds in Distributed Computing
local consistency checking algorithm	Weak consistency notions for all the CSPs of bounded width
logic	Two-variable logic with a between relation
Logic Interpretations	A New Perspective on FO Model Checking of Dense Graph Classes
logic transductions	Two-Way Visibly Pushdown Automata and Transducers
lower bounds	Understanding Gentzen and Frege Systems for QBF Ability to Count Messages Is Worth $\Theta(\Delta)$ Rounds in Distributed Computing
M
MALL	Conflict nets: efficient locally canonical MALL proof nets
Markov chains	Distinguishing Hidden Markov Chains Quantitative Automata under Probabilistic Semantics
Markov Decision processes	Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction
Markov process	Kolmogorov Extension, Martingale Convergence, and Compositionality of Processes
martingales	Kolmogorov Extension, Martingale Convergence, and Compositionality of Processes
matrix logarithms	Solvability of Matrix-Exponential Equations
matrix reachability	Solvability of Matrix-Exponential Equations
Mazurkiewicz Trace Theory	Decidability and Complexity for Quiescent Consistency
Mean-payoff objectives	Perfect-information Stochastic Games with Generalized Mean-Payoff Objectives
Measurable Dynamics	Interaction Graphs: Full Linear Logic
Measurable spaces	Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
Metric Entropy	Complexity Theory of (Functions on) Compact Metric Spaces
metric spaces	Quantitative Algebraic Reasoning
modal and temporal logic	Monadic second order logic as the model companion of temporal logic
modal and temporal logics	Two-variable logic with a between relation
modal logic	Divide and Congruence II: Delay and Weak Bisimilarity
Model checking	Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction Data Communicating Processes with Unreliable Channels
model companions	Monadic second order logic as the model companion of temporal logic
Model comparison	Comparing Chemical Reaction Networks: A Categorical and Algorithmic Perspective
model theory	Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
Model-Checking	A New Perspective on FO Model Checking of Dense Graph Classes
Models of Computation	Program Equivalence is Coinductive
Models of Linear Logic	Fixed Points in Quantitative Semantics
modulo counting quantifiers	Hanf normal form for first-order logic with unary counting quantifiers
modulo-counting logic	Order Invariance on Decomposable Structures
monad	Healthiness from Duality
Monadic Class	Deciding First-Order Satisfiability when Universal and Existential Variables are Separated
monadic second order logic	Monadic second order logic as the model companion of temporal logic
monadic second-order logic	Definability equals recognizability for graphs of bounded treewidth Order Invariance on Decomposable Structures
monads	Quantitative Algebraic Reasoning
monoidal categories	Interacting Frobenius Algebras are Hopf.
monoidal closed bifibrations	A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine
monoidal closed chiralities	A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine
Monotone proofs	From positive and intuitionistic bounded arithmetic to proof complexity
mu-calculus	Towards Completeness via Proof Search in the Linear Time Mu-calculus
Multi-dimensional objectives	Perfect-information Stochastic Games with Generalized Mean-Payoff Objectives
multi-valued logic	Factor Varieties and Symbolic Computation
Multiplicative-additive linear logic	Conflict nets: efficient locally canonical MALL proof nets
N
nested weighted automata	Quantitative Automata under Probabilistic Semantics
Non-commutative bimonoid	Rewriting modulo symmetric monoidal structure
O
OI languages	The diagonal problem for higher-order recursive schemes is decidable
omega-regular	Games with bound guess actions
one-counter automata	Complexity of regular abstractions of one-counter languages
open trace semantics	Trace semantics for polymorphic references
operational semantics	A categorical approach to open and interconnected dynamical systems
Optimal transport	Effective Brenier's Theorem: Applications to Computable Analysis and Algorithmic Randomness
order ideal	The Complexity of Coverability in ν-Petri Nets
Order invariance	Order-Invariance of Two-Variable Logic is Decidable
order-invariant logic	Order Invariance on Decomposable Structures
Ordinary Differential Equations	Comparing Chemical Reaction Networks: A Categorical and Algorithmic Perspective
P
Parameterized Complexity	A New Perspective on FO Model Checking of Dense Graph Classes
parametrised coinduction	Coinduction All the Way Up
Parikh theorem	Complexity of regular abstractions of one-counter languages
parity automata	Towards Completeness via Proof Search in the Linear Time Mu-calculus
Parity Games
Petri nets	Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete
phase semantics	Unified Semantics and Proof System for Classical, Intuitionistic and Affine Logics
Pi_m sets	Quantifier Free Definability on Infinite Algebras
planarity	Order Invariance on Decomposable Structures
polymorphism	Trace semantics for polymorphic references The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
polynomial-time algorithm	Complexity of regular abstractions of one-counter languages
polynomial-time tractability	Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
port-numbering model	Ability to Count Messages Is Worth $\Theta(\Delta)$ Rounds in Distributed Computing
positional determinacy of parity games	How unprovable is Rabin's decidability theorem?
predicate transformer	Healthiness from Duality
Primitive positive interpretation	The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
probabilistic computation	Kolmogorov Extension, Martingale Convergence, and Compositionality of Processes
Probabilistic coupling	Proving Differential Privacy via Probabilistic Couplings
Probabilistic logics	On the Satisfiability of Some Simple Probabilistic Logics
Probabilistic programming languages	Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
probabilistic programs	Reasoning about Recursive Probabilistic Programs
probabilistic systems	Stochastic mechanics of graph rewriting
probabilistic verification	Distinguishing Hidden Markov Chains
productivity	Infinitary Lambda Calculi from a Linear Perspective
profinite monoid	Semi-galois Categories I: The Classical Eilenberg Variety Theory
program extraction	Goedel's functional interpretation and the concept of learning
Program logic	Proving Differential Privacy via Probabilistic Couplings
program verification	Reasoning about Recursive Probabilistic Programs Healthiness from Duality Data Communicating Processes with Unreliable Channels
proof complexity	Understanding Gentzen and Frege Systems for QBF From positive and intuitionistic bounded arithmetic to proof complexity
Proof nets	Conflict nets: efficient locally canonical MALL proof nets
proof theory	Unified Semantics and Proof System for Classical, Intuitionistic and Affine Logics
proof-search	Towards Completeness via Proof Search in the Linear Time Mu-calculus
PROP	Rewriting modulo symmetric monoidal structure
PROPs	Interacting Frobenius Algebras are Hopf. A categorical approach to open and interconnected dynamical systems
pumping lemma	Complexity of regular abstractions of one-counter languages
Q
quantified Boolean formulas (QBF)	Understanding Gentzen and Frege Systems for QBF
quantifier depth	Upper Bounds on the Quantifier Depth For Graph Differentiation in First Order Logic Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps
Quantitative Semantics	Fixed Points in Quantitative Semantics Interaction Graphs: Full Linear Logic
quantum computing	Interacting Frobenius Algebras are Hopf.
Quiescent consistency	Decidability and Complexity for Quiescent Consistency
R
Rabin's decidability theorem	How unprovable is Rabin's decidability theorem?
Rational word transductions	First-order definability of rational transductions: An algebraic approach
reachability	First-order logic with reachability for infinite-state systems On Recurrent Reachability for Continuous Linear Dynamical Systems
reachability problem	Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete
Reactive Systems	Towards Compositional Feedback in Non-Deterministic and Non-Input-Receptive Systems
Realizability	Hybrid realizability for intuitionistic and classical choice
recognizability	Definability equals recognizability for graphs of bounded treewidth
Recursion	On the Satisfiability of Some Simple Probabilistic Logics Reasoning about Recursive Probabilistic Programs
Recursive Analysis	Complexity Theory of (Functions on) Compact Metric Spaces
Recursive Types	Denotational semantics of recursive types in synthetic guarded domain theory
Refinement	Towards Compositional Feedback in Non-Deterministic and Non-Input-Receptive Systems
Register complexity	A Generalised Twinning Property for Minimisation of Cost Register Automata
regular cost functions	Games with bound guess actions
regular languages of trees	Invisible Pushdown Languages
Relation lifting	Proving Differential Privacy via Probabilistic Couplings
relational models	Plays as Resource Terms via Non-idempotent Intersection Types
Relaxed Memory Models	On Thin Air Reads: Towards an Event Structures Model of Relaxed Memory
resource calculus	Plays as Resource Terms via Non-idempotent Intersection Types
Resource-Bounded Complexity	Complexity Theory of (Functions on) Compact Metric Spaces
reversal-bounded pushdown automata	Complexity of regular abstractions of one-counter languages
reverse mathematics	How unprovable is Rabin's decidability theorem?
runtime monitoring	Distinguishing Hidden Markov Chains
S
safra construction	Towards Completeness via Proof Search in the Linear Time Mu-calculus
Satisfiability problem	On the Satisfiability of Some Simple Probabilistic Logics
Semantics	On Thin Air Reads: Towards an Event Structures Model of Relaxed Memory
semi-galois category	Semi-galois Categories I: The Classical Eilenberg Variety Theory
semilinear set	Complexity of regular abstractions of one-counter languages
separability	Invisible Pushdown Languages
sequent calculus	Understanding Gentzen and Frege Systems for QBF Towards Completeness via Proof Search in the Linear Time Mu-calculus
sequential colimits	Constructions with Non-Recursive Higher Inductive Types
Siggers term	The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
Sigma_n sets	Quantifier Free Definability on Infinite Algebras
signal flow graphs	A categorical approach to open and interconnected dynamical systems
Simon's factorization forest	Definability equals recognizability for graphs of bounded treewidth
simulations	Understanding Gentzen and Frege Systems for QBF
Skolem problem	On Recurrent Reachability for Continuous Linear Dynamical Systems
SMT solvers	Minimization of Symbolic Tree Automata
Software Model Checking	Proving Liveness of Parameterized Programs
Sparse Graph Classes	A New Perspective on FO Model Checking of Dense Graph Classes
Stochastic games	Perfect-information Stochastic Games with Generalized Mean-Payoff Objectives
stochastic models	Distinguishing Hidden Markov Chains
Stochastic relations	Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
String diagram	Rewriting modulo symmetric monoidal structure
string diagrams	A categorical approach to open and interconnected dynamical systems
structural computational complexity	Church Meets Cook and Levin
structural operational semantics	Divide and Congruence II: Delay and Weak Bisimilarity
Successor relation	Order-Invariance of Two-Variable Logic is Decidable
Symbolic automata	Minimization of Symbolic Tree Automata
symbolic computation	Factor Varieties and Symbolic Computation
Symmetric monoidal category	Rewriting modulo symmetric monoidal structure
Synthetic domain theory	Denotational semantics of recursive types in synthetic guarded domain theory
T
Termination	Proving Liveness of Parameterized Programs Infinitary Lambda Calculi from a Linear Perspective
terms	Quantifier Free Definability on Infinite Algebras
Theorem Proving	Differential Refinement Logic
Topological clone	The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
topological clones	Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
tractability	The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
tractability conjecture	Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
Trade-off	Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps
transducers	Two-Way Visibly Pushdown Automata and Transducers
transition systems	First-order logic with reachability for infinite-state systems
Tree automata	Monadic second order logic as the model companion of temporal logic Minimization of Symbolic Tree Automata
tree decomposition	Definability equals recognizability for graphs of bounded treewidth
tree-width	Semantically Acyclic Conjunctive Queries under Functional Dependencies
treewidth	Definability equals recognizability for graphs of bounded treewidth
truncation elimination	Constructions with Non-Recursive Higher Inductive Types
Twinning property	A Generalised Twinning Property for Minimisation of Cost Register Automata
Two-variable logic	Order-Invariance of Two-Variable Logic is Decidable
two-way	Two-Way Visibly Pushdown Automata and Transducers
type refinement systems	A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine
Type Theory	Denotational semantics of recursive types in synthetic guarded domain theory
U
ultimately periodic sets	Hanf normal form for first-order logic with unary counting quantifiers
unary counting quantifiers	Hanf normal form for first-order logic with unary counting quantifiers
universal algebra	Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction Quantifier Free Definability on Infinite Algebras Factor Varieties and Symbolic Computation
upward closure	Complexity of regular abstractions of one-counter languages
V
valence automata	First-order logic with reachability for infinite-state systems
van Doorn construction	Constructions with Non-Recursive Higher Inductive Types
vector addition systems	Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete
Verification	Complexity of regular abstractions of one-counter languages Proving Liveness of Parameterized Programs
visibly pushdown automata	Invisible Pushdown Languages Two-Way Visibly Pushdown Automata and Transducers
W
weakest precondition	Reasoning about Recursive Probabilistic Programs
Weighted automata	A Generalised Twinning Property for Minimisation of Cost Register Automata Quantitative Automata under Probabilistic Semantics
Weisfeiler-Leman	Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps
Weisfeiler-Leman algorithm	Upper Bounds on the Quantifier Depth For Graph Differentiation in First Order Logic
well-quasi-order	The Complexity of Coverability in ν-Petri Nets
well-structured transition system	The Complexity of Coverability in ν-Petri Nets
Winning Cores
X
XML	Invisible Pushdown Languages
Z
ZX-calculus	Interacting Frobenius Algebras are Hopf.

Disclaimer | Powered by EasyChair Smart Program