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

A
Abdulla, Parosh Aziz	Data Communicating Processes with Unreliable Channels
Aiswarya, C.	Data Communicating Processes with Unreliable Channels
Atig, Mohamed Faouzi	Data Communicating Processes with Unreliable Channels Complexity of regular abstractions of one-counter languages
B
Baelde, David	Towards Completeness via Proof Search in the Linear Time Mu-calculus
Barthe, Gilles	Proving Differential Privacy via Probabilistic Couplings
Barto, Libor	The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
Basold, Henning	Type Theory based on Dependent Inductive and Coinductive Types
Behr, Nicolas	Stochastic mechanics of graph rewriting
Benedikt, Michael	Querying Visible and Invisible Information A step up in expressiveness of decidable fixpoint logics
Berkholz, Christoph	Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps
Beyersdorff, Olaf	Understanding Gentzen and Frege Systems for QBF
Blot, Valentin	Hybrid realizability for intuitionistic and classical choice
Bodirsky, Manuel	Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
Bojańczyk, Mikołaj	Definability equals recognizability for graphs of bounded treewidth
Bonchi, Filippo	Rewriting modulo symmetric monoidal structure
Bourhis, Pierre	Querying Visible and Invisible Information A step up in expressiveness of decidable fixpoint logics
Bulatov, Andrei	Graphs of relational structures: restricted colours
C
Carayol, Arnaud	Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings
Cardelli, Luca	Comparing Chemical Reaction Networks: A Categorical and Algorithmic Perspective
Chakraborty, Souymodip	On the Satisfiability of Some Simple Probabilistic Logics
Chatterjee, Krishnendu	Quantitative Automata under Probabilistic Semantics Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction Perfect-information Stochastic Games with Generalized Mean-Payoff Objectives
Chistikov, Dmitry	Complexity of regular abstractions of one-counter languages
Chonev, Ventsislav	On Recurrent Reachability for Continuous Linear Dynamical Systems
Clemente, Lorenzo	The diagonal problem for higher-order recursive schemes is decidable
Colcombet, Thomas	Games with bound guess actions
Cooper, Martin C.	The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
D
D'Antoni, Loris	Minimization of Symbolic Tree Automata
D'Osualdo, Emanuele	First-order logic with reachability for infinite-state systems
Dal Lago, Ugo	Infinitary Lambda Calculi from a Linear Perspective
Danos, Vincent	Stochastic mechanics of graph rewriting
Dartois, Luc	Two-Way Visibly Pushdown Automata and Transducers
Das, Anupam	From positive and intuitionistic bounded arithmetic to proof complexity
Daviaud, Laure	A Generalised Twinning Property for Minimisation of Cost Register Automata
Dongol, Brijesh	Decidability and Complexity for Quiescent Consistency
Doumane, Amina	Towards Completeness via Proof Search in the Linear Time Mu-calculus
Doyen, Laurent	Perfect-information Stochastic Games with Generalized Mean-Payoff Objectives
Duncan, Ross	Interacting Frobenius Algebras are Hopf.
Dunne, Kevin	Interacting Frobenius Algebras are Hopf.
Dvořák, Wolfgang	Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction
E
Elberfeld, Michael	Order Invariance on Decomposable Structures
Englert, Matthias	Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete
F
Farzan, Azadeh	Proving Liveness of Parameterized Programs
Favro, Giordano	Factor Varieties and Symbolic Computation
Figueira, Diego	Semantically Acyclic Conjunctive Queries under Functional Dependencies
Filiot, Emmanuel	First-order definability of rational transductions: An algebraic approach Two-Way Visibly Pushdown Automata and Transducers
Finster, Eric	A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type Theory
Fokkink, Wan	Divide and Congruence II: Delay and Weak Bisimilarity
Fong, Brendan	A categorical approach to open and interconnected dynamical systems
Frickenschmidt, Marlin	Order Invariance on Decomposable Structures
G
Gaboardi, Marco	Proving Differential Privacy via Probabilistic Couplings
Gadducci, Fabio	Rewriting modulo symmetric monoidal structure
Gajarský, Jakub	A New Perspective on FO Model Checking of Dense Graph Classes
Galicki, Alex	Effective Brenier's Theorem: Applications to Computable Analysis and Algorithmic Randomness
Garnier, Ilias	Stochastic mechanics of graph rewriting
Gauwin, Olivier	First-order definability of rational transductions: An algebraic approach
Geuvers, Herman	Type Theory based on Dependent Inductive and Coinductive Types
Ghilardi, Silvio	Monadic second order logic as the model companion of temporal logic
Grégoire, Benjamin	Proving Differential Privacy via Probabilistic Couplings
Grohe, Martin	Order Invariance on Decomposable Structures
Göller, Stefan	Games with bound guess actions
H
Harwath, Frederik	Order-Invariance of Two-Variable Logic is Decidable
Hasuo, Ichiro	Healthiness from Duality
Heijltjes, Willem	Conflict nets: efficient locally canonical MALL proof nets
Heimberg, Lucas	Hanf normal form for first-order logic with unary counting quantifiers
Henzinger, Monika	Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction
Henzinger, Thomas	Quantitative Automata under Probabilistic Semantics
Heunen, Chris	Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
Hierons, Rob	Decidability and Complexity for Quiescent Consistency
Hino, Wataru	Healthiness from Duality
Hirschi, Lucca	Towards Completeness via Proof Search in the Linear Time Mu-calculus
Hlineny, Petr	A New Perspective on FO Model Checking of Dense Graph Classes
Hofman, Piotr	Complexity of regular abstractions of one-counter languages
Hou Favonia, Kuen-Bang	A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type Theory
Hsu, Justin	Proving Differential Privacy via Probabilistic Couplings
Hughes, Dominic	Conflict nets: efficient locally canonical MALL proof nets
J
Jaber, Guilhem	The Definitional Side of the Forcing Trace semantics for polymorphic references
Jacobs, Bart	Healthiness from Duality
Jeffrey, Alan	On Thin Air Reads: Towards an Event Structures Model of Relaxed Memory
K
Kaminski, Benjamin Lucien	Reasoning about Recursive Probabilistic Programs
Kammar, Ohad	Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
Katoen, Joost-Pieter	Reasoning about Recursive Probabilistic Programs On the Satisfiability of Some Simple Probabilistic Logics
Kawamura, Akitoshi	Complexity Theory of (Functions on) Compact Metric Spaces
Khoussainov, Bakh	Quantifier Free Definability on Infinite Algebras
Kiefer, Sandra	Upper Bounds on the Quantifier Depth For Graph Differentiation in First Order Logic
Kiefer, Stefan	Distinguishing Hidden Markov Chains
Kincaid, Zachary	Proving Liveness of Parameterized Programs
Kissinger, Aleks	Rewriting modulo symmetric monoidal structure
Kobayashi, Hiroki	Healthiness from Duality
Kopczynski, Eryk	Invisible Pushdown Languages
Kozen, Dexter	Kolmogorov Extension, Martingale Convergence, and Compositionality of Processes
Kozik, Marcin	Weak consistency notions for all the CSPs of bounded width
Kołodziejczyk, Leszek Aleksander	How unprovable is Rabin's decidability theorem?
Kraus, Nicolai	Constructions with Non-Recursive Higher Inductive Types
Krebs, Andreas	Two-variable logic with a between relation
Kuske, Dietrich	Hanf normal form for first-order logic with unary counting quantifiers
L
Laird, James	Fixed Points in Quantitative Semantics
Lazic, Ranko	The Complexity of Coverability in ν-Petri Nets Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete
Lempiäinen, Tuomo	Ability to Count Messages Is Worth $\Theta(\Delta)$ Rounds in Distributed Computing
Lewertowski, Gabriel	The Definitional Side of the Forcing
Lhote, Nathan	First-order definability of rational transductions: An algebraic approach
Liang, Chuck	Unified Semantics and Proof System for Classical, Intuitionistic and Affine Logics
Licata, Daniel R.	A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type Theory
Lodaya, Kamal	Two-variable logic with a between relation
Loitzenbauer, Veronika	Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction
Lokshtanov, Daniel	A New Perspective on FO Model Checking of Dense Graph Classes
Loos, Sarah	Differential Refinement Logic
Lumsdaine, Peter	A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type Theory
Löding, Christof	Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings
M
Manzonetto, Giulio	Factor Varieties and Symbolic Computation
Mardare, Radu	Quantitative Algebraic Reasoning
Matheja, Christoph	Reasoning about Recursive Probabilistic Programs
Mazza, Damiano	Church Meets Cook and Levin
Melliès, Paul-André	A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine
Meyer, Roland	First-order logic with reachability for infinite-state systems
Michalewski, Henryk	How unprovable is Rabin's decidability theorem?
Mottet, Antoine	Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
Møgelberg, Rasmus Ejlers	Denotational semantics of recursive types in synthetic guarded domain theory
N
Narayan Kumar, K.	Complexity of regular abstractions of one-counter languages
Nordström, Jakob	Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps
O
Obdrzalek, Jan	A New Perspective on FO Model Checking of Dense Graph Classes
Olmedo, Federico	Reasoning about Recursive Probabilistic Programs
Ong, Luke	Plays as Resource Terms via Non-idempotent Intersection Types
Otop, Jan	Quantitative Automata under Probabilistic Semantics
Ouaknine, Joel	On Recurrent Reachability for Continuous Linear Dynamical Systems Solvability of Matrix-Exponential Equations
P
Panangaden, Prakash	Quantitative Algebraic Reasoning
Pandya, Paritosh	Two-variable logic with a between relation
Parys, Paweł	The diagonal problem for higher-order recursive schemes is decidable
Pattinson, Dirk	Program Equivalence is Coinductive
Paviotti, Marco	Denotational semantics of recursive types in synthetic guarded domain theory
Petrakis, Iosif	A constructive function-theoretic approach to topological compactness
Pich, Jan	Understanding Gentzen and Frege Systems for QBF
Pilipczuk, Michał	Definability equals recognizability for graphs of bounded treewidth
Pinsker, Michael	The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
Platzer, André	Differential Refinement Logic
Plotkin, Gordon	Quantitative Algebraic Reasoning
Podelski, Andreas	Proving Liveness of Parameterized Programs
Pouly, Amaury	Solvability of Matrix-Exponential Equations
Pous, Damien	Coinduction All the Way Up
Powell, Thomas	Goedel's functional interpretation and the concept of learning
Preoteasa, Viorel	Towards Compositional Feedback in Non-Deterministic and Non-Input-Receptive Systems
Puppis, Gabriele	Querying Visible and Invisible Information
Pédrot, Pierre-Marie	The Definitional Side of the Forcing
R
Ramanujan, M. S.	A New Perspective on FO Model Checking of Dense Graph Classes
Rapisarda, Paolo	A categorical approach to open and interconnected dynamical systems
Reynier, Pierre-Alain	A Generalised Twinning Property for Minimisation of Cost Register Automata Two-Way Visibly Pushdown Automata and Transducers
Riely, James	On Thin Air Reads: Towards an Event Structures Model of Relaxed Memory
S
Saivasan, Prakash	Complexity of regular abstractions of one-counter languages
Salibra, Antonino	Factor Varieties and Symbolic Computation
Salvati, Sylvain	The diagonal problem for higher-order recursive schemes is decidable
Saurin, Alexis	Towards Completeness via Proof Search in the Linear Time Mu-calculus
Schmitz, Sylvain	The Complexity of Coverability in ν-Petri Nets
Schröder, Lutz	Program Equivalence is Coinductive
Schweikardt, Nicole	Hanf normal form for first-order logic with unary counting quantifiers
Schweitzer, Pascal	Upper Bounds on the Quantifier Depth For Graph Differentiation in First Order Logic
Seiller, Thomas	Interaction Graphs: Full Linear Logic
Serre, Olivier	Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings
Sistla, A. Prasad	Distinguishing Hidden Markov Chains
Sobocinski, Pawel	Rewriting modulo symmetric monoidal structure A categorical approach to open and interconnected dynamical systems
Sousa-Pinto, Joao	Solvability of Matrix-Exponential Equations
Sozeau, Matthieu	The Definitional Side of the Forcing
Staton, Sam	Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
Steinberg, Florian	Complexity Theory of (Functions on) Compact Metric Spaces
Straubing, Howard	Two-variable logic with a between relation
Strub, Pierre-Yves	Proving Differential Privacy via Probabilistic Couplings
Sturm, Thomas	Deciding First-Order Satisfiability when Universal and Existential Variables are Separated
T
Tabareau, Nicolas	The Definitional Side of the Forcing
Talbot, Jean-Marc	A Generalised Twinning Property for Minimisation of Cost Register Automata Two-Way Visibly Pushdown Automata and Transducers
Ten Cate, Balder	Querying Visible and Invisible Information
Totzke, Patrick	Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete
Tribastone, Mirco	Comparing Chemical Reaction Networks: A Categorical and Algorithmic Perspective
Tripakis, Stavros	Towards Compositional Feedback in Non-Deterministic and Non-Input-Receptive Systems
Tschaikowski, Max	Comparing Chemical Reaction Networks: A Categorical and Algorithmic Perspective
Tsukada, Takeshi	Plays as Resource Terms via Non-idempotent Intersection Types
Tzevelekos, Nikos	Trace semantics for polymorphic references
U
Uramoto, Takeo	Semi-galois Categories I: The Classical Eilenberg Variety Theory
V
Van Glabbeek, Rob	Divide and Congruence II: Delay and Weak Bisimilarity
van Gool, Samuel J.	Monadic second order logic as the model companion of temporal logic
Vanden Boom, Michael	A step up in expressiveness of decidable fixpoint logics
Vandin, Andrea	Comparing Chemical Reaction Networks: A Categorical and Algorithmic Perspective
Veanes, Margus	Minimization of Symbolic Tree Automata
Vester, Steen
Voigt, Marco	Deciding First-Order Satisfiability when Universal and Existential Variables are Separated
W
Walukiewicz, Igor	The diagonal problem for higher-order recursive schemes is decidable
Weidenbach, Christoph	Deciding First-Order Satisfiability when Universal and Existential Variables are Separated
Wood, Frank	Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
Worrell, James	On Recurrent Reachability for Continuous Linear Dynamical Systems Solvability of Matrix-Exponential Equations
Y
Yang, Hongseok	Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
Z
Zanasi, Fabio	Rewriting modulo symmetric monoidal structure
Zeilberger, Noam	A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine
Zetzsche, Georg	Complexity of regular abstractions of one-counter languages First-order logic with reachability for infinite-state systems
Zeume, Thomas	Order-Invariance of Two-Variable Logic is Decidable
Ziegler, Martin	Complexity Theory of (Functions on) Compact Metric Spaces
Ž
Živný, Stanislav	The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns

Disclaimer | Powered by EasyChair Smart Program