| 2017 | 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017 |
| 2017 | A cartesian-closed category for higher-order model checking. Martin Hofmann, Jérémy Ledent |
| 2017 | A categorical semantics for causal structure. Aleks Kissinger, Sander Uijlen |
| 2017 | A convenient category for higher-order probability theory. Chris Heunen, Ohad Kammar, Sam Staton, Hongseok Yang |
| 2017 | A crevice on the Crane Beach: Finite-degree predicates. Michaël Cadilhac, Charles Paperman |
| 2017 | A fine-grained hierarchy of hard problems in the separated fragment. Marco Voigt |
| 2017 | A monad for full ground reference cells. Ohad Kammar, Paul Blain Levy, Sean K. Moss, Sam Staton |
| 2017 | A type-theoretical definition of weak ω-categories. Eric Finster, Samuel Mimram |
| 2017 | A weakest pre-expectation semantics for mixed-sign expectations. Benjamin Lucien Kaminski, Joost-Pieter Katoen |
| 2017 | Algorithms for some infinite-state MDPs and stochastic games. Kousha Etessami |
| 2017 | An effectful way to eliminate addiction to dependence. Pierre-Marie Pédrot, Nicolas Tabareau |
| 2017 | An interpretation of system F through bar recursion. Valentin Blot |
| 2017 | Bar induction: The good, the bad, and the ugly. Vincent Rahli, Mark Bickford, Robert L. Constable |
| 2017 | Bounded time computation on metric spaces and Banach spaces. Matthias Schröder, Florian Steinberg |
| 2017 | Capturing polynomial time using Modular Decomposition. Berit Grußien |
| 2017 | Categorical liveness checking by corecursive algebras. Natsuki Urabe, Masaki Hara, Ichiro Hasuo |
| 2017 | Common knowledge and multi-scale locality analysis in Cayley structures. Felix Canavoi, Martin Otto |
| 2017 | Computing quantiles in Markov chains with multi-dimensional costs. Christoph Haase, Stefan Kiefer, Markus Lohrey |
| 2017 | Constraint satisfaction problems over semilattice block Mal'tsev algebras. Andrei A. Bulatov |
| 2017 | Constructive completeness for the linear-time μ-calculus. Amina Doumane |
| 2017 | Cut-free completeness for modal mu-calculus. Bahareh Afshari, Graham E. Leigh |
| 2017 | Data structures for quasistrict higher categories. Krzysztof Bar, Jamie Vicary |
| 2017 | Decidability, complexity, and expressiveness of first-order logic over the subword ordering. Simon Halfon, Philippe Schnoebelen, Georg Zetzsche |
| 2017 | Definability of semidefinite programming and lasserre lower bounds for CSPs. Anuj Dawar, Pengming Wang |
| 2017 | Definability of summation problems for Abelian groups and semigroups. Faried Abu Zaid, Anuj Dawar, Erich Grädel, Wied Pakusa |
| 2017 | Descriptive Complexity for counting complexity classes. Marcelo Arenas, Martin Muñoz, Cristian Riveros |
| 2017 | Descriptive complexity of linear equation systems and applications to propositional proof complexity. Martin Grohe, Wied Pakusa |
| 2017 | Differentiation in logical form. Abbas Edalat, Mehrdad Maleki |
| 2017 | Domains and event structures for fusions. Paolo Baldan, Andrea Corradini, Fabio Gadducci |
| 2017 | Dual-context calculi for modal logic. G. A. Kavvos |
| 2017 | Effectful applicative bisimilarity: Monads, relators, and Howe's method. Ugo Dal Lago, Francesco Gavazzo, Paul Blain Levy |
| 2017 | Enumeration reducibility in closure spaces with applications to logic and algebra. Emmanuel Jeandel |
| 2017 | Equivalence of inductive definitions and cyclic proofs under arithmetic. Stefano Berardi, Makoto Tatsuta |
| 2017 | Fibred fibration categories. Taichi Uemura |
| 2017 | First-order logic with counting. Dietrich Kuske, Nicole Schweikardt |
| 2017 | Foundation for a series of efficient simulation algorithms. Gérard Cécé |
| 2017 | Foundational nonuniform (Co)datatypes for higher-order logic. Jasmin Christian Blanchette, Fabian Meier, Andrei Popescu, Dmitriy Traytel |
| 2017 | Foundations of information integration under bag semantics. André Hernich, Phokion G. Kolaitis |
| 2017 | Fully abstract encodings of λ-calculus in HOcore through abstract machines. Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt |
| 2017 | Games with costs and delays. Martin Zimmermann |
| 2017 | Generalised species of rigid resource terms. Takeshi Tsukada, Kazuyuki Asada, C.-H. Luke Ong |
| 2017 | Gödel logic: From natural deduction to parallel computation. Federico Aschieri, Agata Ciabattoni, Francesco A. Genco |
| 2017 | Herbrand property, finite quasi-Herbrand models, and a Chandra-Merlin theorem for quantified conjunctive queries. Simone Bova, Fabio Mogavero |
| 2017 | Higher-order parity automata. Paul-André Melliès |
| 2017 | Infinitary intersection types as sequences: A new answer to Klop's problem. Pierre Vial |
| 2017 | LICS 2017 foreword. Joël Ouaknine |
| 2017 | Large scale geometries of infinite strings. Bakh Khoussainov, Toru Takisaka |
| 2017 | Lean and full congruence formats for recursion. Rob J. van Glabbeek |
| 2017 | Learning first-order definable concepts over structures of small degree. Martin Grohe, Martin Ritzert |
| 2017 | Linear combinations of unordered data vectors. Piotr Hofman, Jérôme Leroux, Patrick Totzke |
| 2017 | Logic and regular cost functions. Thomas Colcombet |
| 2017 | Logics for continuous reachability in Petri nets and vector addition systems with states. Michael Blondin, Christoph Haase |
| 2017 | MDPs with energy-parity objectives. Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak |
| 2017 | Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz |
| 2017 | On delay and regret determinization of max-plus automata. Emmanuel Filiot, Ismaël Jecker, Nathan Lhote, Guillermo A. Pérez, Jean-François Raskin |
| 2017 | On shift-invariant maximal filters and hormonal cellular automata. Julien Cervelle, Grégory Lafitte |
| 2017 | On strong determinacy of countable stochastic games. Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak |
| 2017 | On the axiomatizability of quantitative algebras. Radu Mardare, Prakash Panangaden, Gordon D. Plotkin |
| 2017 | On the extension of computable real functions. Mathieu Hoyrup, Walid Gomaa |
| 2017 | Parity objectives in countable MDPs. Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak |
| 2017 | Partial derivatives on graphs for Kleene allegories. Yoshiki Nakamura |
| 2017 | Perfect half space games. Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz |
| 2017 | Polynomial automata: Zeroness and applications. Michael Benedikt, Timothy Duff, Aditya Sharad, James Worrell |
| 2017 | Quantifiers on languages and codensity monads. Mai Gehrke, Daniela Petrisan, Luca Reggio |
| 2017 | Quantitative semantics of the lambda calculus: Some generalisations of the relational model. C.-H. Luke Ong |
| 2017 | Quotients in monadic programming: Projective algebras are equivalent to coalgebras. Dusko Pavlovic, Peter-Michael Seidel |
| 2017 | Register automata with linear arithmetic. Yu-Fang Chen, Ondrej Lengál, Tony Tan, Zhilin Wu |
| 2017 | Regular separability of one counter automata. Wojciech Czerwinski, Slawomir Lasota |
| 2017 | Revisiting reachability in timed automata. Karin Quaas, Mahsa Shirmohammadi, James Worrell |
| 2017 | Riesz Modal logic for Markov processes. Matteo Mio, Robert Furber, Radu Mardare |
| 2017 | Separation for dot-depth two. Thomas Place, Marc Zeitoun |
| 2017 | Stack semantics of type theory. Thierry Coquand, Bassel Mannaa, Fabian Ruch |
| 2017 | Static analysis of deterministic negotiations. Javier Esparza, Anca Muscholl, Igor Walukiewicz |
| 2017 | Strategy logic with imperfect information. Raphaël Berthon, Bastien Maubert, Aniello Murano, Sasha Rubin, Moshe Y. Vardi |
| 2017 | Succinct progress measures for solving parity games. Marcin Jurdzinski, Ranko Lazic |
| 2017 | Symbolic execution and probabilistic reasoning. Corina S. Pasareanu |
| 2017 | The Weisfeiler-Leman dimension of planar graphs is at most 3. Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer |
| 2017 | The clocks are ticking: No more delays! Patrick Bahr, Hans Bugge Grathwohl, Rasmus Ejlers Møgelberg |
| 2017 | The complexity of minimal inference problem for conservative constraint languages. Michal Wrona |
| 2017 | The continuity of monadic stream functions. Venanzio Capretta, Jonathan Fowler |
| 2017 | The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems. Libor Barto, Michael Kompatscher, Miroslav Olsák, Trung Van Pham, Michael Pinsker |
| 2017 | The geometry of concurrent interaction: Handling multiple ports by way of multiple tokens. Ugo Dal Lago, Ryo Tanaka, Akira Yoshimizu |
| 2017 | The homomorphism problem for regular graph patterns. Miguel Romero, Pablo Barceló, Moshe Y. Vardi |
| 2017 | The limits of SDP relaxations for general-valued CSPs. Johan Thapper, Stanislav Zivný |
| 2017 | The logic of counting query answers. Hubie Chen, Stefan Mengel |
| 2017 | The pebbling comonad in Finite Model Theory. Samson Abramsky, Anuj Dawar, Pengming Wang |
| 2017 | The primitivity of operators in the algebra of binary relations under conjunctions of containments. Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht |
| 2017 | The real projective spaces in homotopy type theory. Ulrik Buchholtz, Egbert Rijke |
| 2017 | Timed pushdown automata and branching vector addition systems. Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki |
| 2017 | Typability in bounded dimension. Andrej Dudenhefner, Jakob Rehof |
| 2017 | Understanding the complexity of #SAT using knowledge compilation. Florent Capelli |
| 2017 | Uniform, integral and efficient proofs for the determinant identities. Iddo Tzameret, Stephen A. Cook |
| 2017 | Unrestricted stone duality for Markov processes. Robert Furber, Dexter Kozen, Kim G. Larsen, Radu Mardare, Prakash Panangaden |
| 2017 | Untwisting two-way transducers in elementary time. Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis |
| 2017 | Verification of randomized security protocols. Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan |