LICS A*

90 papers

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