LICS 2017: THIRTY-SECOND ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE

A
Abramsky, Samson	The Pebbling Comonad in Finite Model Theory
Abu Zaid, Faried	Definability of Summation Problems for Abelian Groups and Semigroups
Afshari, Bahareh	Cut-free Completeness for Modal Mu-Calculus
Arenas, Marcelo	Descriptive Complexity for Counting Complexity Classes
Asada, Kazuyuki	Generalised Species of Rigid Resource Terms
Aschieri, Federico	Gödel Logic: From Natural Deduction to Parallel Computation
B
Bahr, Patrick	The Clocks Are Ticking: No More Delays! Reduction Semantics for Type Theory with Guarded Recursion
Baldan, Paolo	Domains and Event Structures for Fusions
Bar, Krzysztof	Data structures for quasistrict higher categories
Barceló, Pablo	The Homomorphism Problem for Regular Graph Patterns
Barto, Libor	The Two Dichotomy Conjectures for Infinite Domain Constraint Satisfaction Problems Are Equivalent
Baschenis, Félix	Untwisting two-way transducers in elementary time
Benedikt, Michael	Polynomial Automata: Zeroness and Applications
Berardi, Stefano	Equivalence of Inductive Definitions and Cyclic Proofs under Arithmetic
Berthon, Raphaël	Strategy Logic with Imperfect Information
Bickford, Mark	Bar Induction: The Good, the Bad, and the Ugly
Biernacka, Malgorzata	Fully Abstract Encodings of lambda-Calculus in HOcore through Abstract Machines
Biernacki, Dariusz	Fully Abstract Encodings of lambda-Calculus in HOcore through Abstract Machines
Blanchette, Jasmin Christian	Foundational Nonuniform (Co)datatypes for Higher-Order Logic
Blondin, Michael	Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States
Blot, Valentin	An interpretation of system F through bar recursion
Bova, Simone	Herbrand Property: Finite Quasi-Herbrand Models and Lifting Chandra-Merlin Theorem to Quantified Conjunctive Queries
Buchholtz, Ulrik	The real projective spaces in homotopy type theory
Bulatov, Andrei	Constraint Satisfaction Problems over semilattice block Mal'tsev algebras
C
Cadilhac, Michaël	A Crevice on the Crane Beach: Finite-Degree Predicates
Canavoi, Felix	Common Knowledge and Multi-Scale Locality Analysis in Cayley Structures
Capelli, Florent	Understanding the complexity of #SAT using knowledge compilation
Capretta, Venanzio	The Continuity of Monadic Stream Functions
Cervelle, Julien	On shift-invariant maximal filters and hormonal cellular automata
Chadha, Rohit	Verification of randomized security protocols
Chen, Hubie	The Logic of Counting Query Answers
Chen, Yu-Fang	Register automata with linear arithmetic
Ciabattoni, Agata	Gödel Logic: From Natural Deduction to Parallel Computation
Clemente, Lorenzo	Timed pushdown automata and branching vector addition systems
Colcombet, Thomas	Logic and regular cost functions Perfect Half Space Games
Constable, Robert	Bar Induction: The Good, the Bad, and the Ugly
Cook, Stephen	Uniform, Integral and Efficient Proofs for the Determinant Identities
Coquand, Thierry	Stack Semantics of Type Theory
Corradini, Andrea	Domains and Event Structures for Fusions
Czerwiński, Wojciech	Regular Separability of One Counter Automata
Cécé, Gérard	Foundation for a Series of Efficient Simulation Algorithms
D
Dal Lago, Ugo	The Geometry of Concurrent Interaction: Handling Multiple Ports by Way of Multiple Tokens Effectful Applicative Bisimilarity: Monads, Relators, and Howe's Method
Dawar, Anuj	The Pebbling Comonad in Finite Model Theory Definability of Summation Problems for Abelian Groups and Semigroups Definability of Semidefinite Programming and Lasserre Lower Bounds for CSPs
Doumane, Amina	Constructive completeness for the linear-time mu-calculus
Dudenhefner, Andrej	Typability in Bounded Dimension
Duff, Timothy	Polynomial Automata: Zeroness and Applications
E
Edalat, Abbas	Differentiation in Logical Form
Esparza, Javier	Static Analysis of Deterministic Negotiations
Etessami, Kousha	Algorithms for some infinite-state MDPs and stochastic games
F
Filiot, Emmanuel	On Delay and Regret Determinization of Max-Plus Automata
Finster, Eric	A Type-Theoretical Definition of Weak omega-Categories
Fowler, Jonathan	The Continuity of Monadic Stream Functions
Furber, Robert	Unrestricted Stone Duality for Markov Processes Riesz Modal Logic for Markov Processes
G
Gadducci, Fabio	Domains and Event Structures for Fusions
Gauwin, Olivier	Untwisting two-way transducers in elementary time
Gavazzo, Francesco	Effectful Applicative Bisimilarity: Monads, Relators, and Howe's Method
Gehrke, Mai	Quantifiers on languages and codensity monads
Genco, Francesco	Gödel Logic: From Natural Deduction to Parallel Computation
Gomaa, Walid	On the extension of computable real functions
Grathwohl, Hans Bugge	The Clocks Are Ticking: No More Delays! Reduction Semantics for Type Theory with Guarded Recursion
Grohe, Martin	Learning first-order definable concepts over structures of small degree The Descriptive Complexity of Solving Linear Equation Systems and its Applications
Grußien, Berit	Capturing Polynomial Time using Modular Decomposition
Grädel, Erich	Definability of Summation Problems for Abelian Groups and Semigroups
H
Haase, Christoph	Computing Quantiles in Markov Chains with Multi-Dimensional Costs Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States
Halfon, Simon	Decidability, complexity, and expressiveness of first-order logic over the subword ordering
Hara, Masaki	Categorical Liveness Checking by Corecursive Algebras
Hasuo, Ichiro	Categorical Liveness Checking by Corecursive Algebras
Hernich, André	Foundations of Information Integration under Bag Semantics
Heunen, Chris	A Convenient Category for Higher-Order Probability Theory
Hofman, Piotr	Linear Combinations of Unordered Data Vectors
Hofmann, Martin	A cartesian closed category for higher-order model checking
Hoyrup, Mathieu	On the extension of computable real functions
J
Jeandel, Emmanuel	Enumeration Reducibility in Closure Spaces with Applications to Logic and Algebra
Jecker, Ismaël	On Delay and Regret Determinization of Max-Plus Automata
Jurdzinski, Marcin	Succinct progress measures for solving parity games Perfect Half Space Games
K
Kaminski, Benjamin	A Weakest Pre-Expectation Semantics for Mixed-Sign Expectations
Kammar, Ohad	A Convenient Category for Higher-Order Probability Theory A monad for full ground reference cells
Katoen, Joost-Pieter	A Weakest Pre-Expectation Semantics for Mixed-Sign Expectations
Kavvos, G. A.	Dual-Context Calculi for Modal Logic
Khoussainov, Bakh	Large scale geometries of infinite strings
Kiefer, Sandra	The Weisfeiler-Leman dimension of planar graphs is at most 3
Kiefer, Stefan	On Strong Determinacy of Countable Stochastic Games Parity Objectives in Countable MDPs Computing Quantiles in Markov Chains with Multi-Dimensional Costs
Kissinger, Aleks	A categorical semantics for causal structure
Kolaitis, Phokion	Foundations of Information Integration under Bag Semantics
Kompatscher, Michael	The Two Dichotomy Conjectures for Infinite Domain Constraint Satisfaction Problems Are Equivalent
Kozen, Dexter	Unrestricted Stone Duality for Markov Processes
Kreutzer, Stephan	Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion
Kuske, Dietrich	First-order logic with counting: At least, WEAK Hanf normal forms always exist and can be computed!
L
Lafitte, Gregory	On shift-invariant maximal filters and hormonal cellular automata
Larsen, Kim	Unrestricted Stone Duality for Markov Processes
Lasota, Slawomir	Timed pushdown automata and branching vector addition systems Regular Separability of One Counter Automata
Lazic, Ranko	Succinct progress measures for solving parity games Perfect Half Space Games Timed pushdown automata and branching vector addition systems
Ledent, Jérémy	A cartesian closed category for higher-order model checking
Leigh, Graham	Cut-free Completeness for Modal Mu-Calculus
Lengal, Ondrej	Register automata with linear arithmetic
Lenglet, Sergueï	Fully Abstract Encodings of lambda-Calculus in HOcore through Abstract Machines
Leroux, Jérôme	Linear Combinations of Unordered Data Vectors
Levy, Paul Blain	A monad for full ground reference cells Effectful Applicative Bisimilarity: Monads, Relators, and Howe's Method
Lhote, Nathan	On Delay and Regret Determinization of Max-Plus Automata
Lohrey, Markus	Computing Quantiles in Markov Chains with Multi-Dimensional Costs
M
Maleki, Mehrdad	Differentiation in Logical Form
Mannaa, Bassel	Stack Semantics of Type Theory
Mardare, Radu	On Axiomatizability of the Quantitative Algebras Unrestricted Stone Duality for Markov Processes Riesz Modal Logic for Markov Processes
Maubert, Bastien	Strategy Logic with Imperfect Information
Mayr, Richard	On Strong Determinacy of Countable Stochastic Games Parity Objectives in Countable MDPs MDPs with Energy-Parity Objectives
Mazowiecki, Filip	Timed pushdown automata and branching vector addition systems
Meier, Fabian	Foundational Nonuniform (Co)datatypes for Higher-Order Logic
Melliès, Paul-André	Higher-order parity automata
Mengel, Stefan	The Logic of Counting Query Answers
Mimram, Samuel	A Type-Theoretical Definition of Weak omega-Categories
Mio, Matteo	Riesz Modal Logic for Markov Processes
Mogavero, Fabio	Herbrand Property: Finite Quasi-Herbrand Models and Lifting Chandra-Merlin Theorem to Quantified Conjunctive Queries
Moss, Sean	A monad for full ground reference cells
Murano, Aniello	Strategy Logic with Imperfect Information
Muscholl, Anca	Static Analysis of Deterministic Negotiations Untwisting two-way transducers in elementary time
Muñoz, Martín	Descriptive Complexity for Counting Complexity Classes
Møgelberg, Rasmus Ejlers	The Clocks Are Ticking: No More Delays! Reduction Semantics for Type Theory with Guarded Recursion
N
Nakamura, Yoshiki	Partial Derivatives on Graphs for Kleene Allegories
O
Olsak, Miroslav	The Two Dichotomy Conjectures for Infinite Domain Constraint Satisfaction Problems Are Equivalent
Ong, Luke	Quantitative semantics of the lambda calculus: some generalisations of the relational model Generalised Species of Rigid Resource Terms
Otto, Martin	Common Knowledge and Multi-Scale Locality Analysis in Cayley Structures
P
Pakusa, Wied	The Descriptive Complexity of Solving Linear Equation Systems and its Applications Definability of Summation Problems for Abelian Groups and Semigroups
Panangaden, Prakash	On Axiomatizability of the Quantitative Algebras Unrestricted Stone Duality for Markov Processes
Paperman, Charles	A Crevice on the Crane Beach: Finite-Degree Predicates
Pasareanu, Corina	Symbolic Execution and Probabilistic Reasoning
Pavlovic, Dusko	Quotients in monadic programming: Projective algebras are equivalent to coalgebras
Perez, Guillermo	On Delay and Regret Determinization of Max-Plus Automata
Petrisan, Daniela	Quantifiers on languages and codensity monads
Pham, Trung Van	The Two Dichotomy Conjectures for Infinite Domain Constraint Satisfaction Problems Are Equivalent
Pilipczuk, Michał	Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion
Pinsker, Michael	The Two Dichotomy Conjectures for Infinite Domain Constraint Satisfaction Problems Are Equivalent
Place, Thomas	Separation for Dot-Depth Two
Plotkin, Gordon	On Axiomatizability of the Quantitative Algebras
Polesiuk, Piotr	Fully Abstract Encodings of lambda-Calculus in HOcore through Abstract Machines
Ponomarenko, Ilia	The Weisfeiler-Leman dimension of planar graphs is at most 3
Popescu, Andrei	Foundational Nonuniform (Co)datatypes for Higher-Order Logic
Pous, Damien	Fully Abstract Encodings of lambda-Calculus in HOcore through Abstract Machines
Puppis, Gabriele	Untwisting two-way transducers in elementary time
Pédrot, Pierre-Marie	An Effectful Way to Eliminate Addiction to Dependence
Q
Quaas, Karin	Revisiting Reachability in Timed Automata
Quiroz, Daniel A.	Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion
R
Rabinovich, Roman	Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion
Rahli, Vincent	Bar Induction: The Good, the Bad, and the Ugly
Raskin, Jean-Francois	On Delay and Regret Determinization of Max-Plus Automata
Reggio, Luca	Quantifiers on languages and codensity monads
Rehof, Jakob	Typability in Bounded Dimension
Rijke, Egbert	The real projective spaces in homotopy type theory
Ritzert, Martin	Learning first-order definable concepts over structures of small degree
Riveros, Cristian	Descriptive Complexity for Counting Complexity Classes
Romero Orth, Miguel	The Homomorphism Problem for Regular Graph Patterns
Rubin, Sasha	Strategy Logic with Imperfect Information
Ruch, Fabian	Stack Semantics of Type Theory
S
Schewe, Sven	MDPs with Energy-Parity Objectives
Schmitt, Alan	Fully Abstract Encodings of lambda-Calculus in HOcore through Abstract Machines
Schmitz, Sylvain	Perfect Half Space Games
Schnoebelen, Philippe	Decidability, complexity, and expressiveness of first-order logic over the subword ordering
Schröder, Matthias	Bounded time computation on metric spaces and Banach spaces
Schweikardt, Nicole	First-order logic with counting: At least, WEAK Hanf normal forms always exist and can be computed!
Schweitzer, Pascal	The Weisfeiler-Leman dimension of planar graphs is at most 3
Seidel, Peter-Michael	Quotients in monadic programming: Projective algebras are equivalent to coalgebras
Sharad, Aditya	Polynomial Automata: Zeroness and Applications
Shirmohammadi, Mahsa	On Strong Determinacy of Countable Stochastic Games Parity Objectives in Countable MDPs Revisiting Reachability in Timed Automata
Siebertz, Sebastian	Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion
Sistla, A. Prasad	Verification of randomized security protocols
Staton, Sam	A Convenient Category for Higher-Order Probability Theory A monad for full ground reference cells
Steinberg, Florian	Bounded time computation on metric spaces and Banach spaces
Surinx, Dimitri	The primitivity of operators in the algebra of binary relations under conjunctions of containments
T
Tabareau, Nicolas	An Effectful Way to Eliminate Addiction to Dependence
Takisaka, Toru	Large scale geometries of infinite strings
Tan, Tony	Register automata with linear arithmetic
Tanaka, Ryo	The Geometry of Concurrent Interaction: Handling Multiple Ports by Way of Multiple Tokens
Tatsuta, Makoto	Equivalence of Inductive Definitions and Cyclic Proofs under Arithmetic
Thapper, Johan	The Limits of SDP Relaxations for General-Valued CSPs
Totzke, Patrick	Linear Combinations of Unordered Data Vectors MDPs with Energy-Parity Objectives
Traytel, Dmitriy	Foundational Nonuniform (Co)datatypes for Higher-Order Logic
Tsukada, Takeshi	Generalised Species of Rigid Resource Terms
Tzameret, Iddo	Uniform, Integral and Efficient Proofs for the Determinant Identities
U
Uemura, Taichi	Fibred Fibration Categories
Uijlen, Sander	A categorical semantics for causal structure
Urabe, Natsuki	Categorical Liveness Checking by Corecursive Algebras
V
Van den Bussche, Jan	The primitivity of operators in the algebra of binary relations under conjunctions of containments
van den Heuvel, Jan	Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion
van Glabbeek, Rob	Lean and Full Congruence Formats for Recursion
Van Gucht, Dirk	The primitivity of operators in the algebra of binary relations under conjunctions of containments
Vardi, Moshe	The Homomorphism Problem for Regular Graph Patterns Strategy Logic with Imperfect Information
Vial, Pierre	Infinitary Intersection Types as Sequences: a New Answer to Klop’s Problem
Vicary, Jamie	Data structures for quasistrict higher categories
Viswanathan, Mahesh	Verification of randomized security protocols
Voigt, Marco	A fine-grained hierarchy of hard problems in the separated fragment
W
Walukiewicz, Igor	Static Analysis of Deterministic Negotiations
Wang, Pengming	The Pebbling Comonad in Finite Model Theory Definability of Semidefinite Programming and Lasserre Lower Bounds for CSPs
Wojtczak, Dominik	On Strong Determinacy of Countable Stochastic Games Parity Objectives in Countable MDPs MDPs with Energy-Parity Objectives
Worrell, James	Polynomial Automata: Zeroness and Applications Revisiting Reachability in Timed Automata
Wrona, Michał	The Complexity of Minimal Inference Problem for Conservative Constraint Languages
Wu, Zhilin	Register automata with linear arithmetic
Y
Yang, Hongseok	A Convenient Category for Higher-Order Probability Theory
Yoshimizu, Akira	The Geometry of Concurrent Interaction: Handling Multiple Ports by Way of Multiple Tokens
Z
Zeitoun, Marc	Separation for Dot-Depth Two
Zetzsche, Georg	Decidability, complexity, and expressiveness of first-order logic over the subword ordering
Zimmermann, Martin	Games with Costs and Delays
Ž
Živný, Stanislav	The Limits of SDP Relaxations for General-Valued CSPs

Disclaimer | Powered by EasyChair Smart Program